论文信息 - Parametrizations for Families of ECM-Friendly Curves

Parametrizations for Families of ECM-Friendly Curves

We provide a new family of elliptic curves that results in a one to two percent performance improvement of the elliptic curve integer factorization method. The speedup is confirmed by extensive tests for factors ranging from 15 to 63 bits.

Arjen K. Lenstra | Thorsten Kleinjung | Alexandre Gélin

[1] Tanja Lange,et al. Starfish on Strike , 2010, LATINCRYPT.

[2] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[3] François Morain,et al. Finding suitable curves for the elliptic curve method of factorization , 1993 .

[4] Carl Pomerance,et al. The Development of the Number Field Sieve , 1994 .

[5] Ed Dawson,et al. Twisted Edwards Curves Revisited , 2008, IACR Cryptol. ePrint Arch..

[6] Razvan Barbulescu,et al. Finding ECM-Friendly Curves through a Study of Galois Properties , 2012, IACR Cryptol. ePrint Arch..

[7] Tanja Lange,et al. ECM using Edwards curves , 2012, Math. Comput..

[8] H. W. Lenstra,et al. Factoring integers with elliptic curves , 1987 .

[9] Tanja Lange,et al. Twisted Edwards Curves , 2008, AFRICACRYPT.

[10] Dj Daniel Bernstein,et al. A general number field sieve implementation , 1993 .

[11] H. Edwards. A normal form for elliptic curves , 2007 .