On the Correct Use of the Negation Map in the Pollard rho Method

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.

• Type: Journal
• Year: 2011
• Where: PKC
• Authors: Daniel J. Bernstein, Tanja Lange, Peter Schwabe
• Keywords: Cryptology, Lenstra, Modular Arithmetic, PKC 2011, Playstation 3