ECC2K-130 on Cell CPUs

  • Joppe W. Bos
  • Thorsten Kleinjung
  • Ruben Niederhagen
  • Peter Schwabe
Conference paper

DOI: 10.1007/978-3-642-12678-9_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6055)
Cite this paper as:
Bos J.W., Kleinjung T., Niederhagen R., Schwabe P. (2010) ECC2K-130 on Cell CPUs. In: Bernstein D.J., Lange T. (eds) Progress in Cryptology – AFRICACRYPT 2010. AFRICACRYPT 2010. Lecture Notes in Computer Science, vol 6055. Springer, Berlin, Heidelberg

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.

Keywords

Cell Broadband Engine Architecture elliptic curve discrete logarithm problem binary-field arithmetic parallel Pollard rho 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Joppe W. Bos
    • 1
  • Thorsten Kleinjung
    • 1
  • Ruben Niederhagen
    • 2
    • 3
  • Peter Schwabe
    • 3
  1. 1.Laboratory for Cryptologic AlgorithmsEPFLLausanneSwitzerland
  2. 2.Department of Electrical EngineeringNational Taiwan UniversityTaipeiTaiwan
  3. 3.Department of Mathematics and Computer ScienceTechnische Universiteit EindhovenEindhovenNetherlands

Personalised recommendations