Sciweavers

ANTS
2004
Springer
121views Algorithms» more  ANTS 2004»
13 years 10 months ago
Function Field Sieve in Characteristic Three
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
Robert Granger, Andrew J. Holt, Dan Page, Nigel P....
ANTS
2004
Springer
90views Algorithms» more  ANTS 2004»
13 years 10 months ago
Conjectures about Discriminants of Hecke Algebras of Prime Level
In this paper, we study p-divisibility of discriminants of Hecke algebras associated to spaces of cusp forms of prime level. By considering cusp forms of weight bigger than 2, we a...
Frank Calegari, William A. Stein
ANTS
2004
Springer
74views Algorithms» more  ANTS 2004»
13 years 10 months ago
Rational Divisors in Rational Divisor Classes
We discuss the situation where a curve C, defined over a number field K, has a known K-rational divisor class of degree 1, and consider whether this class contains an actual K-ra...
Nils Bruin, E. Victor Flynn
ANTS
2004
Springer
97views Algorithms» more  ANTS 2004»
13 years 10 months ago
Elliptic Curves with a Given Number of Points
We present a non-archimedean method to construct, given an integer N ≥ 1, a finite field Fq and an elliptic curve E/Fq such that E(Fq) has order N.
Reinier Bröker, Peter Stevenhagen
ANTS
2004
Springer
114views Algorithms» more  ANTS 2004»
13 years 10 months ago
Montgomery Scalar Multiplication for Genus 2 Curves
Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this metho...
Sylvain Duquesne
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
13 years 10 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
ANTS
2004
Springer
139views Algorithms» more  ANTS 2004»
13 years 10 months ago
Binary GCD Like Algorithms for Some Complex Quadratic Rings
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
Saurabh Agarwal, Gudmund Skovbjerg Frandsen
ANTS
2004
Springer
112views Algorithms» more  ANTS 2004»
13 years 10 months ago
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...
Kirsten Eisenträger, Kristin Lauter, Peter L....