Optimizing Elliptic Curve Scalar Multiplication with Near-Factorization
Abstract
Index Terms
- Optimizing Elliptic Curve Scalar Multiplication with Near-Factorization
Recommendations
Optimizing double-base elliptic-curve single-scalar multiplication
INDOCRYPT'07: Proceedings of the cryptology 8th international conference on Progress in cryptologyThis paper analyzes the best speeds that can be obtained for single-scalar multiplication with variable base point by combining a huge range of options: - many choices of coordinate systems and formulas for individual group operations, including new ...
The $$\mathbb {Q}$$Q-curve Construction for Endomorphism-Accelerated Elliptic Curves
We give a detailed account of the use of $$\mathbb {Q}$$Q-curve reductions to construct elliptic curves over $$\mathbb {F}_{p^2}$$Fp2 with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the ...
Efficient Scalar Multiplication on Koblitz Curves with Pre-computation
Information SecurityAbstractScalar multiplication is the basic operation in elliptic curve cryptography. The double-base number system (DBNS) is an effective tool for speeding up scalar multiplication on elliptic curves. This paper proposes a novel decomposition algorithm ...
Comments
Information & Contributors
Information
Published In
Publisher
SCITEPRESS - Science and Technology Publications, Lda
Setubal, Portugal
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in