A Tree-Based Approach for Computing Double-Base Chains

DOI10.1007/978-3-540-70500-0_32MaRDI QIDQ3511180zbMATH OpenOpenAlexFDO

Authors Christophe Doche, Laurent Habsieger

Publication date 8 July 2008

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70500-0_32

zbMATH Keywords

double-base number systemelliptic curve cryptographyscalar multiplication

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• Double-base chains for scalar multiplications on elliptic curves
• On the enumeration of double-base chains with applications to elliptic curve cryptography
• Optimal 2-3 chains for scalar multiplication
• Bounds and trade-offs for double-base number systems
• Computing optimal 2-3 chains for pairings

Cites work

• Advances in Elliptic Curve Cryptography
• An algorithm for modular exponentiation.
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
• Elliptic Curve Cryptosystems
• Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
• Extending Scalar Multiplication Using Double Bases
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1349933 (Why is no real title available?)
• scientific article; zbMATH DE number 1936525 (Why is no real title available?)
• Hybrid algorithm for the computation of the matrix polynomial I+A+···+A/sup N-1/
• Inverted Edwards Coordinates
• Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
• Progress in Cryptology – Mycrypt 2005
• Public Key Cryptography - PKC 2006
• Trading inversions for multiplications in elliptic curve cryptography

Cited in

(7)

• Double-base chains for scalar multiplications on elliptic curves
• Analysis on Yu et al.'s dynamic algorithm for canonic DBC
• Computing optimal 2-3 chains for pairings
• Twisted Hessian curves
• Lower bounds on the lengths of double-base representations
• Double-Base Number System for Multi-scalar Multiplications
• Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates

This page was built for publication: A Tree-Based Approach for Computing Double-Base Chains

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