Extending Scalar Multiplication Using Double Bases

DOI10.1007/11935230_9zbMATH Open1172.94558OpenAlexW2102308384MaRDI QIDQ5459075FDOQ5459075

Authors: Christophe Doche, Francesco Sica, Roberto Maria Avanzi, Vassil S. Dimitrov 

Publication date: 24 April 2008

Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11935230_9

Recommendations

• Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication∗
• Scalar multiplication on Koblitz curves using double bases
• Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
• The double-base number system and its application to elliptic curve cryptography
• Double-Base Number System for Multi-scalar Multiplications

Mathematics Subject Classification ID

Cryptography (94A60) Complex multiplication and moduli of abelian varieties (11G15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cited In (29)

• Optimizing memory cost of multi-scalar multiplication
• A Graph Theoretic Analysis of Double Base Number Systems
• On the minimal Hamming weight of a multi-base representation
• The double-base number system and its application to elliptic curve cryptography
• Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication∗
• Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
• Efficient algorithms for Koblitz curves over fields of characteristic three
• Secure simultaneous bit extraction from Koblitz curves
• Progress in Cryptology – Mycrypt 2005
• Faster and lower memory scalar multiplication on supersingular curves in characteristic three
• Scalar multiplication for twisted Edwards curves using the extended double-base number system
• Sublinear scalar multiplication on hyperelliptic Koblitz curves
• Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
• Lower bounds on the lengths of double-base representations
• Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
• On using expansions to the base of −2
• Extending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptography
• Analysis on Yu et al.'s dynamic algorithm for canonic DBC
• Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited
• Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
• Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication
• Double-base chains for scalar multiplications on elliptic curves
• Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools
• Double-Base Number System for Multi-scalar Multiplications
• Efficient scalar multiplication on Koblitz curves with pre-computation
• Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
• Scalar multiplication on Koblitz curves using double bases
• A Tree-Based Approach for Computing Double-Base Chains
• Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases

This page was built for publication: Extending Scalar Multiplication Using Double Bases

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