Skip to main navigation Skip to search Skip to main content

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Downloads (Pure)

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
Title of host publicationPublic Key Cryptography - PKC 2011 (14th International Conference on Practice and Theory in Public-Key Cryptography, Taormina, Italy, March 6-9, 2011. Proceedings)
EditorsD. Catalano, N. Fazio, R. Gennaro, A. Nicolosi
Place of PublicationBerlin
PublisherSpringer
Pages128-146
ISBN (Print)978-3-642-19378-1
DOIs
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science
Volume6571
ISSN (Print)0302-9743

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