Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
From MaRDI portal
Publication:1758892
DOI10.1504/IJACT.2012.045590zbMath1276.94008MaRDI QIDQ1758892
Arjen K. Lenstra, Marcelo E. Kaihara, Joppe W. Bos, Thorsten Kleinjung, Peter L. Montgomery
Publication date: 16 November 2012
Published in: International Journal of Applied Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijact.2012.045590
elliptic curve discrete logarithm; negation map; Pollard's rho method; SIMD; single instruction multiple data; cell processors
Related Items
Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation, Fast cryptography in genus 2, Accelerating Pollard's rho algorithm on finite fields, A binary algorithm with low divergence for modular inversion on SIMD architectures, Index calculus in the trace zero variety, Recent progress on the elliptic curve discrete logarithm problem, Complexity bounds on Semaev's naive index calculus method for ECDLP, Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory, Quantum algorithm for solving hyperelliptic curve discrete logarithm problem, On the heuristic of approximating polynomials over finite fields by random mappings, Lattice-Based Fault Attacks Against ECMQV
