Solving 112-bit prime ECDLP on game consoles using sloppy reduction
Bos, Joppe Willem; Kaihara, M.; Kleinjung, T.; Lenstra, Arjen K.; Montgomery, P. L.
2012

Files

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

Title Solving 112-bit prime ECDLP on game consoles using sloppy reduction
Author(s) Bos, Joppe Willem ; Kaihara, M. ; Kleinjung, T. ; Lenstra, Arjen K. ; Montgomery, P. L.
Published in International Journal of Applied Cryptography
Volume 2
Issue 3
Pages 212-228
Date 2012
Keywords
DOI https://doi.org/10.1504/IJACT.2012.045590
Laboratories LACAL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date 2011-03-29

PDF