Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
type: Item
instance of: scholarly article
title: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
zbMATH Open document ID: 1276.94008
DOI: 10.1504/IJACT.2012.045590
author: Joppe W. Bos
author: Marcelo E. Kaihara
author: Thorsten Kleinjung
author: Arjen K. Lenstra
author: Peter L. Montgomery
published in: International Journal of Applied Cryptography
publication date: 2012-11-16T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 6108312
zbMATH Keywords: elliptic curve discrete logarithm
zbMATH Keywords: Pollard's rho method
zbMATH Keywords: cell processors
zbMATH Keywords: single instruction multiple data
zbMATH Keywords: SIMD
zbMATH Keywords: negation map
MaRDI profile type: Publication
full work available at URL: ijact.2012.045590
OpenAlex ID: W2012770528
Recommended article: Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
Recommended article: Q4675703
Recommended article: Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
Recommended article: On the discrete logarithm problem for prime-field elliptic curves
Recommended article: A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
Recommended article: Solving elliptic curve discrete logarithm problems using Weil descent
Recommended article: Q2739457
description: scientific article; zbMATH DE number 6108312