Pre-computation scheme of window NAF for Koblitz curves revisited

DOI10.1007/978-3-030-77886-6_7zbMATH Open1479.94353OpenAlexW3144398558MaRDI QIDQ2056729FDOQ2056729

Authors: 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

Recommendations

• Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication
• Efficient algorithms for Koblitz curves over fields of characteristic three
• Improved precomputation scheme for scalar multiplication on elliptic curves
• A method for the efficient computation of scalar multiplication in Koblitz curve
• Faster implementation of scalar multiplication on Koblitz curves

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Efficient arithmetic on elliptic curves in characteristic 2
• A note on window \(\tau\)-NAF algorithm
• Efficient arithmetic on Koblitz curves
• Nonadjacent Radix-τ Expansions of Integers in Euclidean Imaginary Quadratic Number Fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Twisted \({\mu}_4\)-normal form for elliptic curves
• Extending Scalar Multiplication Using Double Bases
• Information Security and Privacy
• Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
• Fast point multiplication algorithms for binary elliptic curves with and without precomputation
• Double-Base Number System for Multi-scalar Multiplications
• Complete addition formulas for prime order elliptic curves
• Double-base chains for scalar multiplications on elliptic curves
• Speeding up scalar multiplication on Koblitz curves using \(\mu_4\) coordinates
• On the Optimal Pre-Computation of Window NAF for Koblitz Curves
• Introduction

Cited In (6)

• Efficient algorithms for Koblitz curves over fields of characteristic three
• Efficient precomputation schemes of \(kP+lQ\)
• Fast and simple point operations on Edwards448 and E448
• A method for the efficient computation of scalar multiplication in Koblitz curve
• Efficient scalar multiplication on Koblitz curves with pre-computation
• Improved precomputation scheme for scalar multiplication on elliptic curves

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

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