Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction (Q1758892)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction |
scientific article; zbMATH DE number 6108312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction |
scientific article; zbMATH DE number 6108312 |
Statements
Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction (English)
0 references
16 November 2012
0 references
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.
0 references
elliptic curve discrete logarithm
0 references
Pollard's rho method
0 references
cell processors
0 references
single instruction multiple data
0 references
SIMD
0 references
negation map
0 references
0.8600864
0 references
0 references
0.82876736
0 references
0.8279143
0 references
0.8273606
0 references
