Elliptic curves in cryptography
Elliptic curves in cryptography
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Improving the arithmetic of elliptic curves in the Jacobi model
Information Processing Letters
New formulae for efficient elliptic curve arithmetic
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Faster addition and doubling on elliptic curves
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Extended double-base number system with applications to elliptic curve cryptography
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient and secure elliptic curve point multiplication using double-base chains
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Efficient scalar multiplication by isogeny decompositions
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
A Tree-Based Approach for Computing Double-Base Chains
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Twisted Edwards Curves Revisited
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Double-Base Number System for Multi-scalar Multiplications
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
New formulae for efficient elliptic curve arithmetic
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Faster group operations on elliptic curves
AISC '09 Proceedings of the Seventh Australasian Conference on Information Security - Volume 98
Hi-index | 0.00 |
This 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 formulas for tripling on Edwards curves; - double-base chains with many different doubling/tripling ratios, including standard base-2 chains as an extreme case; - many precomputation strategies, going beyond Dimitrov, Imbert, Mishra (Asiacrypt 2005) and Doche and Imbert (Indocrypt 2006). The analysis takes account of speedups such as S - M tradeoffs and includes recent advances such as inverted Edwards coordinates. The main conclusions are as follows. Optimized precomputations and triplings save time for single-scalar multiplication in Jacobian coordinates, Hessian curves, and tripling-oriented Doche/Icart/Kohel curves. However, even faster single-scalar multiplication is possible in Jacobi intersections, Edwards curves, extended Jacobi-quartic coordinates, and inverted Edwards coordinates, thanks to extremely fast doublings and additions; there is no evidence that double-base chains are worthwhile for the fastest curves. Inverted Edwards coordinates are the speed leader.