Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
DOI10.1504/IJACT.2012.045590zbMATH Open1276.94008OpenAlexW2012770528MaRDI QIDQ1758892FDOQ1758892
Authors: Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, 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
Recommendations
- Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
- scientific article; zbMATH DE number 2165762
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- On the discrete logarithm problem for prime-field elliptic curves
- A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
- Solving elliptic curve discrete logarithm problems using Weil descent
- scientific article; zbMATH DE number 1643938
elliptic curve discrete logarithmnegation mapPollard's rho methodSIMDsingle instruction multiple datacell processors
Cited In (18)
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
- Index calculus in the trace zero variety
- Recent progress on the elliptic curve discrete logarithm problem
- Fast cryptography in genus 2
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- Accelerating Pollard's rho algorithm on finite fields
- Solving 114-bit ECDLP for a Barreto-Naehrig curve
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
- Memory-efficient attacks on small LWE keys
- ECC2K-130 on Cell CPUs
- A binary algorithm with low divergence for modular inversion on SIMD architectures
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- On the correct use of the negation map in the Pollard rho method
- On the heuristic of approximating polynomials over finite fields by random mappings
- Is ML-based cryptanalysis inherently limited? Simulating cryptographic adversaries via gradient-based methods
- Memory-efficient attacks on small LWE keys
- Solving the discrete logarithm of a 113-bit Koblitz curve with an FPGA cluster
- Lattice-based fault attacks against ECMQV
This page was built for publication: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758892)
