Analysis and optimization of elliptic-curve single-scalar multiplication
From MaRDI portal
Publication:3635533
Recommendations
- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
- Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
- scientific article; zbMATH DE number 1962162
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Trading inversions for multiplications in elliptic curve cryptography
Cited in
(14)- ECM using Edwards curves
- Fast cryptography in genus 2
- Isomorphism classes of Edwards curves over finite fields
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- \(\lambda\)-coordinates for binary elliptic curves
- \(d\)-MUL: optimizing and implementing a multidimensional scalar multiplication algorithm over elliptic curves
- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
- On the number of distinct elliptic curves in some families
- Trading inversions for multiplications in elliptic curve cryptography
- Twisted Hessian curves
- Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
- Compressed Jacobian coordinates for OEF
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
This page was built for publication: Analysis and optimization of elliptic-curve single-scalar multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635533)
