Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction (Q1758892): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1504/ijact.2012.045590 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012770528 / rank | |||
Normal rank | |||
Latest revision as of 09:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction |
scientific article |
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
