On the use of the negation map in the Pollard rho method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6197 LNCS, Issue , 2010, Pages 66-82

  Bos, Joppe W ^a   Kleinjung, Thorsten ^a   Lenstra, Arjen K ^a  

^a EPFL   (Switzerland)

Author keywords

fruitless cycles; negation map; Pollard's rho method

Indexed keywords

DISCRETE LOGARITHMS; ELLIPTIC CURVES OVER FINITE FIELDS; FRUITLESS CYCLES; RANDOM WALK; SPEED-UP FACTORS; SPEED-UPS;

ALGEBRA; NUMBER THEORY;

HARVESTING;

EID: 77955324328     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14518-6_9     Document Type: Conference Paper

References (18)

1. Avanzi, R. M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman & Hall/CRC (2006)
2. Bailey, D. V., et al.: Breaking ECC2K-130. In: Cryptology ePrint Archive, Report 2009/541 (2009), http://eprint.iacr.org/
3. Bos, J. W., Kaihara, M. E., Montgomery, P. L.: Pollard rho on the PlayStation 3. In: Workshop record of SHARCS 2009, pp. 35-50 (2009), http://www.hyperelliptic.org/tanja/SHARCS/record2.pdf
4. Brent, R. P., Pollard, J. M.: Factorization of the eighth Fermat number. Math. Comp. 36 (154), 627-630 (1981)
5. Certicom. Certicom ECC Challenge (1997), http://www.certicom.com/images/ pdfs/cert-ecc-challenge.pdf
6. Certicom. Press release: Certicom announces elliptic curve cryptosystem (ECC) challenge winner (2002), http://www.certicom.com/index.php/2002-press- releases/38-2002-press-releases/340-notre-dame-mathematician-solveseccp-109- encryption-key-problem-issued-in-1997
7. Duursma, I. M., Gaudry, P., Morain, F.: Speeding up the discrete log computation on curves with automorphisms. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 103-121. Springer, Heidelberg (1999)
8. Escott, A. E., Sager, J. C., Selkirk, A. P. L., Tsapakidis, D.: Attacking elliptic curve cryptosystems using the parallel Pollard rho method. CryptoBytes Technical Newsletter 4 (2), 15-19 (1999), ftp.rsasecurity.com/pub/cryptobytes/ crypto4n2.pdf
9. Gallant, R. P., Lambert, R. J., Vanstone, S. A.: Improving the parallelized Pollard lambda search on anomalous binary curves. Math. Comp. 69 (232), 1699-1705 (2000)
10. Harley, R.: Elliptic curve discrete logarithms project, http://pauillac.inria.fr/~harley/
11. Koblitz, N.: Elliptic curve cryptosystems. Math. Comp. 48, 203-209 (1987)
12. Koblitz, N.: CM-curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 279-287. Springer, Heidelberg (1992)
13. Miller, V. S.: Use of elliptic curves in cryptography. In: Williams, H. C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417-426. Springer, Heidelberg (1986)
14. Montgomery, P. L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comp. 48, 243-264 (1987)
15. Pollard, J. M.: Monte Carlo methods for index computation (mod p). Math. Comp. 32, 918-924 (1978)
16. Teske, E.: On random walks for Pollard's rho method. Math. Comp. 70 (234), 809-825 (2001)
17. van Oorschot, P. C., Wiener, M. J.: Parallel collision search with cryptanalytic applications. Journal of Cryptology 12 (1), 1-28 (1999)
18. Wiener, M. J., Zuccherato, R. J.: Faster attacks on elliptic curve cryptosystems. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 190-200. Springer, Heidelberg (1999)