Fast endomorphisms in integer sub-decomposition method on Secp192k1
From MaRDI portal
Recommendations
- Efficient scalar multiplications for elliptic curve cryptosystems using mixed coordinates strategy and direct computations
- Efficient scalar multiplication on Koblitz curves with pre-computation
- scientific article; zbMATH DE number 2044535
- scientific article; zbMATH DE number 1612501
- Shorter addition chain for smooth integers using decomposition method
Cites work
- Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
- Elliptic Curve Cryptosystems
- Elliptic Curves of Type y2=x3−3pqx Having Ranks Zero and One
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- Four\(\mathbb {Q}\): four-dimensional decompositions on a \(\mathbb {Q}\)-curve over the Mersenne prime
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 2009969 (Why is no real title available?)
- scientific article; zbMATH DE number 1842492 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- The Arithmetic of Elliptic Curves
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication
This page was built for publication: Fast endomorphisms in integer sub-decomposition method on Secp192k1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618035)