@inproceedings{38aedacffbc648f194190dfcc405880a,
title = "On the correct use of the negation map in the Pollard rho method",
abstract = "Bos, Kaihara, Kleinjung, Lenstra, and Montgomery recently showed that ECDLPs on the 112-bit secp112r1 curve can be solved in an expected time of 65 years on a PlayStation 3. This paper shows how to solve the same ECDLPs at almost twice the speed on the same hardware. The improvement comes primarily from a new variant of Pollard{\textquoteright}s rho method that fully exploits the negation map without branching, and secondarily from improved techniques for modular arithmetic.",
author = "D.J. Bernstein and T. Lange and P. Schwabe",
year = "2011",
doi = "10.1007/978-3-642-19379-8\_8",
language = "English",
isbn = "978-3-642-19378-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "128--146",
editor = "D. Catalano and N. Fazio and R. Gennaro and A. Nicolosi",
booktitle = "Public Key Cryptography - PKC 2011 (14th International Conference on Practice and Theory in Public-Key Cryptography, Taormina, Italy, March 6-9, 2011. Proceedings)",
address = "Germany",
}