30 search results - page 1 / 6 » Primality Proving with Elliptic Curves |
ISSAC
1992
Springer
14 years 3 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
14 years 3 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...
TPHOL
2007
IEEE
14 years 5 months ago
2007
IEEE
CRYPTO
2003
Springer
14 years 4 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...
AAECC
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie