Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction (Q1758892)

From MaRDI portal
Revision as of 22:07, 26 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers