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

DOI10.1007/978-3-540-77026-8_27MaRDI QIDQ5458223zbMATH OpenOpenAlexFDO

Authors Rana Barua, Sumit Kumar Pandey, Ravi Pankaj

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

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

Recommendations

• The double-base number system and its application to elliptic curve cryptography
• Fast scalar multiplication based on subset of double-base number system
• Fast elliptic curve point multiplication based on window non-adjacent form method
• 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

Cites work

• An algorithm for modular exponentiation.
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• 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
• scientific article; zbMATH DE number 1302784 (Why is no real title available?)
• scientific article; zbMATH DE number 1504800 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• Trading inversions for multiplications in elliptic curve cryptography

Cited in

(8)

• Double-base chains for scalar multiplications on elliptic curves
• Fast elliptic curve point multiplication based on window non-adjacent form method
• Fast scalar multiplication based on subset of double-base number system
• Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases
• Метод адаптивного «окна» операций в эллиптических кривых
• Cryptology and Network Security
• Efficient scalar multiplication on Koblitz curves with pre-computation
• Fast elliptic scalar multiplication using new double-base chain and point halving

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458223)