A binary algorithm with low divergence for modular inversion on SIMD architectures
From MaRDI portal
Publication:480385
DOI10.1007/s11587-014-0213-9zbMath1360.11003OpenAlexW2074350275MaRDI QIDQ480385
Maurizio Laporta, Alberto Pizzirani
Publication date: 8 December 2014
Published in: Ricerche di Matematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11587-014-0213-9
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Theory of software (68N99)
Related Items (1)
Uses Software
Cites Work
- A binary algorithm with low divergence for modular inversion on SIMD architectures
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
- Modular Multiplication Without Trial Division
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A binary algorithm with low divergence for modular inversion on SIMD architectures