ANTS
2006
Springer
14 years 2 months ago
2006
Springer
This paper offers numerical evidence for a conjecture that primality proving may be done in (log N)3+o(1) operations by examining the growth rate of quantities known as pseudosquar...
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...