6 search results - page 1 / 2 » Easy Numbers for the Elliptic Curve Primality Proving Algori... |
ISSAC
1992
Springer
13 years 9 months ago
1992
Springer
We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the...
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
In 1986, following the work of Schoof on counting points on elliptic curves over finite fields, new algorithms for primality proving emerged, due to Goldwasser and Kilian on the on...
CRYPTO
2003
Springer
13 years 10 months ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
ANTS
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
ANTS
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Mazur proved that any element ξ of order three in the Shafarevich-Tate group of an elliptic curve E over a number field k can be made visible in an abelian surface A in...