Paper 2010/077
ECC2K-130 on Cell CPUs
Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhagen, and Peter Schwabe
Abstract
This paper describes an implementation of Pollard's rho algorithm to compute the elliptic curve discrete logarithm for the Synergistic Processor Elements of the Cell Broadband Engine Architecture. Our implementation targets the elliptic curve discrete logarithm problem defined in the Certicom ECC2K-130 challenge. We compare a bitsliced implementation to a non-bitsliced implementation and describe several optimization techniques for both approaches. In particular, we address the question whether normal-basis or polynomial-basis representation of field elements leads to better performance. Using our software, the ECC2K-130 challenge can be solved in one year using the Synergistic Processor Units of less than 2700 Sony Playstation~3 gaming consoles.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Cell Broadband Engine Architectureelliptic curve discrete logarithm problembinary-field arithmeticparallel Pollard rho
- Contact author(s)
- peter @ cryptojedi org
- History
- 2010-02-16: received
- Short URL
- https://ia.cr/2010/077
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/077,
author = {Joppe W. Bos and Thorsten Kleinjung and Ruben Niederhagen and Peter Schwabe},
title = {ECC2K-130 on Cell CPUs},
howpublished = {Cryptology ePrint Archive, Paper 2010/077},
year = {2010},
note = {\url{https://eprint.iacr.org/2010/077}},
url = {https://eprint.iacr.org/2010/077}
}
