Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Solving 112-bit prime ECDLP on game consoles using sloppy reduction
 
research article

Solving 112-bit prime ECDLP on game consoles using sloppy reduction

Bos, Joppe Willem
•
Kaihara, M.
•
Kleinjung, T.
Show more
2012
International Journal of Applied Cryptography

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.

  • Files
  • Details
  • Metrics
Type
research article
DOI
10.1504/IJACT.2012.045590
Author(s)
Bos, Joppe Willem
Kaihara, M.
Kleinjung, T.
Lenstra, Arjen K.  
Montgomery, P. L.
Date Issued

2012

Published in
International Journal of Applied Cryptography
Volume

2

Issue

3

Start page

212

End page

228

Subjects

elliptic curve discrete logarithm

•

Pollard’s rho method

•

cell processor

•

single instruction multiple data (SIMD)

•

negation map

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LACAL  
Available on Infoscience
March 29, 2011
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/65768
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés