Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited

DOI10.1007/978-3-030-77886-6_7zbMath1479.94353OpenAlexW3144398558MaRDI QIDQ2056729

Wei Yu, Guangwu Xu

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_7

zbMATH Keywords

elliptic curve cryptographyscalar multiplicationKoblitz curvepre-computationwindow \(\tau\)NAF

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Efficient scalar multiplication on Koblitz curves with pre-computation

Cites Work

• Unnamed Item
• 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
• Speeding up scalar multiplication on Koblitz curves using \(\mu_4\) coordinates
• Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation
• Complete Addition Formulas for Prime Order Elliptic Curves
• Efficient Arithmetic on Elliptic Curves in Characteristic 2
• On the Optimal Pre-Computation of Window NAF for Koblitz Curves
• Nonadjacent Radix-τ Expansions of Integers in Euclidean Imaginary Quadratic Number Fields
• Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
• Double-Base Number System for Multi-scalar Multiplications
• Extending Scalar Multiplication Using Double Bases
• Information Security and Privacy
• Twisted $${\mu }_4$$ -Normal Form for Elliptic Curves
• Introduction

This page was built for publication: Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited