Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
From MaRDI portal
Recommendations
- Implementation of cryptographic algorithms for elliptic curves
- A secure and parallel Montgomery ladder algorithm of ECC
- Fast point multiplication algorithms for binary elliptic curves with and without precomputation
- Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication
- scientific article; zbMATH DE number 1759279
Cites work
- -coordinates for binary elliptic curves
- A New Double Point Multiplication Algorithm and Its Application to Binary Elliptic Curves with Endomorphisms
- Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields
- Binary Huff Curves
- Differential addition on binary elliptic curves
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Fast point multiplication algorithms for binary elliptic curves with and without precomputation
- Faster compact Diffie-Hellman: endomorphisms on the x-line
- Four\(\mathbb {Q}\): four-dimensional decompositions on a \(\mathbb {Q}\)-curve over the Mersenne prime
- High-speed high-security signatures
- scientific article; zbMATH DE number 1504820 (Why is no real title available?)
- Montgomery Curves and the Montgomery Ladder
- On Montgomery-Like Representations for Elliptic Curves over GF(2k)
- Recent progress on the elliptic curve discrete logarithm problem
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Twisted \({\mu}_4\)-normal form for elliptic curves
Cited in
(2)
This page was built for publication: Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055960)