Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System

DOI10.1007/978-3-540-77026-8_27zbMath1153.94346OpenAlexW1604053475MaRDI QIDQ5458223

Rana Barua, Ravi Pankaj, Sumit Kumar Pandey

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_27

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Curves over finite and local fields (11G20) Other number representations (11A67)

Cites Work

• 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
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System