ECC2K-130 on Cell CPUs
From MaRDI portal
Publication:3558314
Recommendations
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
- ECC2K-130 on NVIDIA GPUs
- Fast Elliptic-Curve Cryptography on the Cell Broadband Engine
- Solving the discrete logarithm of a 113-bit Koblitz curve with an FPGA cluster
- On the correct use of the negation map in the Pollard rho method
Cited in
(9)- Fast polynomial inversion for post quantum QC-MDPC cryptography
- Energy-efficient ARM64 cluster with cryptanalytic applications. 80 cores that do not cost you an ARM and a leg
- Solving the discrete logarithm of a 113-bit Koblitz curve with an FPGA cluster
- ECC2K-130 on NVIDIA GPUs
- Parallelizing the Weil and Tate pairings
- Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA
- Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)
- 2DT-GLS: faster and exception-free scalar multiplication in the GLS254 binary curve
- Is ML-based cryptanalysis inherently limited? Simulating cryptographic adversaries via gradient-based methods
This page was built for publication: ECC2K-130 on Cell CPUs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558314)