Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

PKC
2011
Springer

favoriteEmaildiscussreport

212views Cryptology» more PKC 2011»

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

12 years 7 months ago

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

Download eprint.iacr.org

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.

Daniel J. Bernstein, Tanja Lange, Peter Schwabe

Real-time Traffic

Cryptology | Lenstra | Modular Arithmetic | PKC 2011 | Playstation 3 |

claim paper

Related Content

» On the Use of the Negation Map in the Pollard Rho Method

» Negative weights make adversaries stronger

» Validation of an NSPbased negative selection pattern gene family identification strategy

» A Discriminative Candidate Generator for String Transformations

» Improving reinforcement learning function approximators via neuroevolution

» A new pooling strategy for highthroughput screening the Shifted Transversal Design

Post Info
More Details (n/a)

Added	17 Sep 2011
Updated	17 Sep 2011
Type	Journal
Year	2011
Where	PKC
Authors	Daniel J. Bernstein, Tanja Lange, Peter Schwabe

Comments (0)