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

D.J. Bernstein, T. Lange, P. Schwabe

Research output: Book/ReportReportAcademic

25 Citations (Scopus)

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.
Original languageEnglish
PublisherIACR
Number of pages26
Publication statusPublished - 2011

Publication series

NameCryptology ePrint Archive
Volume2011/003

Fingerprint

Dive into the research topics of 'On the correct use of the negation map in the Pollard rho method'. Together they form a unique fingerprint.

Cite this