Double-base chains for scalar multiplications on elliptic curves
From MaRDI portal
Publication:2055666
DOI10.1007/978-3-030-45727-3_18zbMath1479.94276OpenAlexW3013718874MaRDI QIDQ2055666
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_18
Related Items (4)
Analysis on Yu et al.'s dynamic algorithm for canonic DBC ⋮ Efficient scalar multiplication on Koblitz curves with pre-computation ⋮ A note on inverted twisted Edwards curve ⋮ Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient Tate pairing computation using double-base chains
- On tables of random numbers
- Bounds and trade-offs for double-base number systems
- Trading inversions for multiplications in elliptic curve cryptography
- Complete Addition Formulas for Prime Order Elliptic Curves
- On the maximal weight of $(p,q)$-ary chain partitions with bounded parts
- On the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography
- Computing Optimal 2-3 Chains for Pairings
- Efficient Double Bases for Scalar Multiplication
- Lower bounds on the lengths of double-base representations
- Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
- 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
- Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields
- Triple-Base Number System for Scalar Multiplication
- Strictly chained (p,q)-ary partitions
- New and Improved Methods to Analyze and Compute Double-Scalar Multiplications
- Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems
- The double-base number system and its application to elliptic curve cryptography
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
- Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
- Extending Scalar Multiplication Using Double Bases
This page was built for publication: Double-base chains for scalar multiplications on elliptic curves
