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

DOI10.1007/11593447_4zbMATH Open1154.94388OpenAlexW1487297807MaRDI QIDQ5451064FDOQ5451064

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

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

Mathematics Subject Classification ID

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

Cited In (31)

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

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)