Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains

DOI10.1007/11593447_4MaRDI QIDQ5451064zbMATH OpenOpenAlexFDO

Authors Laurent Imbert, Pradeep Kumar Mishra, Vassil S. Dimitrov

Publication date 18 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11593447_4

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• The double-base number system and its application to elliptic curve cryptography
• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
• scientific article; zbMATH DE number 2044541
• scientific article; zbMATH DE number 2085437
• scientific article; zbMATH DE number 1955800

Cited in

(31)

• Efficient Tate pairing computation using double-base chains
• Random Euclidean addition chain generation and its application to point multiplication
• A duality in space usage between left-to-right and right-to-left exponentiation
• Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
• Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication∗
• Lower bounds on the lengths of double-base representations
• A fast and SPA secure scalar multiplication for elliptic curve cryptography
• Double-base chains for scalar multiplications on elliptic curves
• Faster cofactorization with ECM using mixed representations
• Double-Base Number System for Multi-scalar Multiplications
• Bounds and trade-offs for double-base number systems
• New strategy for doubling-free short addition-subtraction chain
• Fast point multiplication algorithms for binary elliptic curves with and without precomputation
• The double-base number system and its application to elliptic curve cryptography
• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
• Dynamical directions in numeration
• Multibase scalar multiplications in cryptographic pairings
• Elliptic curve scalar multiplication algorithm based on bronze ratio addition chain
• Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation over \(\mathrm{GF}(p)\)
• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
• Efficient scalar multiplication on Koblitz curves with pre-computation
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• Efficient scalar multiplication for elliptic curves over binary fields
• Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
• Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System
• Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
• A New Double Point Multiplication Algorithm and Its Application to Binary Elliptic Curves with Endomorphisms
• A Tree-Based Approach for Computing Double-Base Chains
• Fast elliptic curve point multiplication based on window non-adjacent form method
• A Graph Theoretic Analysis of Double Base Number Systems
• Fast elliptic scalar multiplication using new double-base chain and point halving

This page was built for publication: Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451064)