Efficient scalar multiplication on Koblitz curves with pre-computation

DOI10.1007/978-3-031-22390-7_11zbMath1530.94035OpenAlexW4312809730MaRDI QIDQ6111989

Unnamed Author, Xiuxiu Li, Kun-Peng Wang

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22390-7_11

zbMATH Keywords

elliptic curve cryptographyscalar multiplicationKoblitz curvesdouble-base number systemwidth-\( \omega\) \(\tau \)-NAF

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on window \(\tau\)-NAF algorithm
• Efficient arithmetic on Koblitz curves
• Double-base chains for scalar multiplications on elliptic curves
• Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited
• Speeding up scalar multiplication on Koblitz curves using \(\mu_4\) coordinates
• An algorithm for modular exponentiation.
• The geometry of efficient arithmetic on elliptic curves
• Scalar Multiplication on Koblitz Curves Using Double Bases
• Faster Implementation of Scalar Multiplication on Koblitz Curves
• Nonadjacent Radix-τ Expansions of Integers in Euclidean Imaginary Quadratic Number Fields
• Double-Base Number System for Multi-scalar Multiplications
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• Extending Scalar Multiplication Using Double Bases
• Twisted $${\mu }_4$$ -Normal Form for Elliptic Curves

This page was built for publication: Efficient scalar multiplication on Koblitz curves with pre-computation