Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Solving a 112-bit Prime Elliptic Curve Discrete Logarithm Problem on Game Consoles using Sloppy Reduction

Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, and Peter L. Montgomery

Abstract

We describe a cell processor implementation of Pollard's rho method to solve discrete logarithms in groups of elliptic curves over prime fields. The implementation was used on a cluster of PlayStation 3 game consoles to set a new record. We present in detail the underlying single instruction multiple data modular arithmetic.

Details

Publication typeArticle
Published inInternational Journal of Applied Cryptography
URLhttp://inderscience.metapress.com/content/7453607x7p726416/
Pages212–228
Volume2
Number3
PublisherInderscience Enterprises Ltd.
> Publications > Solving a 112-bit Prime Elliptic Curve Discrete Logarithm Problem on Game Consoles using Sloppy Reduction