ECC2K-130 on Cell CPUs

J.W. Bos, T. Kleinjung, R.F. Niederhagen, P. Schwabe

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

17 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProgress in Cryptology - AfricaCrypt 2010 (Third International Conference on Cryptology in Africa, Stellenbosch, South Africa, May 3-6, 2010. Proceedings)
EditorsD.J. Bernstein, T. Lange
Place of PublicationBerlin
PublisherSpringer
Pages225-242
ISBN (Print)978-3-642-12677-2
DOIs
Publication statusPublished - 2010

Publication series

NameLecture Notes in Computer Science
Volume6055
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'ECC2K-130 on Cell CPUs'. Together they form a unique fingerprint.

Cite this