A Tree-Based Approach for Computing Double-Base Chains
From MaRDI portal
Publication:3511180
DOI10.1007/978-3-540-70500-0_32zbMath1370.94507OpenAlexW1603274586MaRDI QIDQ3511180
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
Related Items
Analysis on Yu et al.'s dynamic algorithm for canonic DBC, Twisted Hessian Curves, О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат, Double-Base Number System for Multi-scalar Multiplications, Double-base chains for scalar multiplications on elliptic curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trading inversions for multiplications in elliptic curve cryptography
- An algorithm for modular exponentiation.
- Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
- Elliptic Curve Cryptosystems
- Hybrid algorithm for the computation of the matrix polynomial I+A+···+A/sup N-1/
- Inverted Edwards Coordinates
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
- Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
- Extending Scalar Multiplication Using Double Bases
- Advances in Elliptic Curve Cryptography
- Progress in Cryptology – Mycrypt 2005
- Public Key Cryptography - PKC 2006