Faster scalar multiplication algorithm based on addition chain
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2219248
- Fast scalar multiplication based on subset of double-base number system
- Improvement of the algorithm of point multiplication on elliptic curves over \(\mathrm{GF}(2^m)\)
- A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
- scientific article; zbMATH DE number 1612501
Cited in
(7)- Elliptic curve scalar multiplication algorithm based on bronze ratio addition chain
- scientific article; zbMATH DE number 7235119 (Why is no real title available?)
- Fast scalar multiplication based on subset of double-base number system
- Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
- scientific article; zbMATH DE number 7272516 (Why is no real title available?)
- Improvement of the algorithm of point multiplication on elliptic curves over \(\mathrm{GF}(2^m)\)
- scientific article; zbMATH DE number 2219248 (Why is no real title available?)
This page was built for publication: Faster scalar multiplication algorithm based on addition chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3185369)