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