ECC2K-130 on cell CPUs

Authors:
Joppe W. Bos;Thorsten Kleinjung;Ruben Niederhagen;Peter Schwabe
Affiliations:
Laboratory for Cryptologic Algorithms, EPFL, Lausanne, Switzerland;Laboratory for Cryptologic Algorithms, EPFL, Lausanne, Switzerland;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, MB, Netherlands
Venue:
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Year:
2010

Citing 5
Cited 7

A Fast New DES Implementation in Software

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
Power Efficient Processor Architecture and The Cell Processor

HPCA '05 Proceedings of the 11th International Symposium on High-Performance Computer Architecture
Efficient Multiplication Using Type 2 Optimal Normal Bases

WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Batch Binary Edwards

CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology

Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication

CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction

International Journal of Applied Cryptography
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction

International Journal of Applied Cryptography
Parallelizing the weil and tate pairings

IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Cryptanalysis of the Full AES Using GPU-Like Special-Purpose Hardware

Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
Faster implementation of scalar multiplication on koblitz curves

LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
A hardware-accelerated ECDLP with high-performance modular multiplication

International Journal of Reconfigurable Computing - Special issue on Selected Papers from the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig 2011)

Quantified Score

Hi-index	0.00

Visualization

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. We show that 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.