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's rho method that fully exploits the negation map without branching, and secondarily from improved techniques for modular arithmetic. © 2011 International Association for Cryptologic Research.
Author supplied keywords
Cite
CITATION STYLE
Bernstein, D. J., Lange, T., & Schwabe, P. (2011). On the correct use of the negation map in the pollard rho method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6571 LNCS, pp. 128–146). https://doi.org/10.1007/978-3-642-19379-8_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
