A Graph Theoretic Analysis of Double Base Number Systems
From MaRDI portal
Publication:5458207
DOI10.1007/978-3-540-77026-8_12zbMath1153.94414OpenAlexW1562845089MaRDI QIDQ5458207
Pradeep Kumar Mishra, Vassil S. Dimitrov
Publication date: 11 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77026-8_12
Applications of graph theory (05C90) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Other number representations (11A67)
Cites Work
- Unnamed Item
- Unnamed Item
- Signed bits and fast exponentiation
- Trading inversions for multiplications in elliptic curve cryptography
- An algorithm for modular exponentiation.
- On Mahler's partition problem
- Scalar Multiplication on Koblitz Curves Using Double Bases
- Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
- 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
- Progress in Cryptology – Mycrypt 2005
- Public Key Cryptography - PKC 2006
This page was built for publication: A Graph Theoretic Analysis of Double Base Number Systems