Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
From MaRDI portal
Publication:744601
DOI10.1007/s00145-012-9144-3zbMath1297.94088OpenAlexW2568115099MaRDI QIDQ744601
Publication date: 25 September 2014
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-012-9144-3
elliptic curvesscalar multiplicationGLV-GLS methodmulticore computationside-channel protectiontwisted Edwards curve
Cryptography (94A60) Special algebraic curves and curves of low genus (14H45) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (7)
Ready-made short basis for GLV+GLS on high degree twisted curves ⋮ New techniques for SIDH-based NIKE ⋮ A new twofold Cornacchia-type algorithm and its applications ⋮ Explicit isogenies in quadratic time in any characteristic ⋮ Refinement of the four-dimensional GLV method on elliptic curves ⋮ New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 ⋮ Koblitz curves over quadratic fields
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Factoring polynomials with rational coefficients
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
- Fast Elliptic Curve Cryptography in OpenSSL
- Faster Implementation of Scalar Multiplication on Koblitz Curves
- High-Speed High-Security Signatures
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Twisted Edwards Curves
- Efficient Techniques for High-Speed Elliptic Curve Cryptography
- Twisted Edwards Curves Revisited
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- Exponent Recoding and Regular Exponentiation Algorithms
- A normal form for elliptic curves
- New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
- Algorithmic Number Theory
- Public Key Cryptography - PKC 2006
This page was built for publication: Four-dimensional Gallant-Lambert-Vanstone scalar multiplication