Analysis on Yu et al.'s dynamic algorithm for canonic DBC
From MaRDI portal
Publication:2656954
Recommendations
Cites work
- A Tree-Based Approach for Computing Double-Base Chains
- Computing optimal 2-3 chains for pairings
- Curve41417: Karatsuba revisited
- Double-base chains for scalar multiplications on elliptic curves
- Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
- Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
- Extending Scalar Multiplication Using Double Bases
- Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
- Introduction to algorithms.
- On the enumeration of double-base chains with applications to elliptic curve cryptography
- The double-base number system and its application to elliptic curve cryptography
- Trading inversions for multiplications in elliptic curve cryptography
This page was built for publication: Analysis on Yu et al.'s dynamic algorithm for canonic DBC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656954)