Solving 112-bit prime ECDLP on game consoles using sloppy reduction
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.
Cite this item
Bos, J. W., Kaihara, M., Kleinjung, T., Lenstra, A. K., & Montgomery, P. L. (2012). Solving 112-bit prime ECDLP on game consoles using sloppy reduction. International Journal of Applied Cryptography, 2(3), 212–228. https://doi.org/10.1504/IJACT.2012.045590
Click Copy to copy the citation, or select the text manually.
164550.pdf
openaccess
312.13 KB
Adobe PDF
b6fff40660a4a16ef76bfbe9f769082a