A note on window \(\tau\)-NAF algorithm
From MaRDI portal
Publication:1041820
DOI10.1016/J.IPL.2005.05.013zbMath1182.94037OpenAlexW1975533027MaRDI QIDQ1041820
V. Kumar Murty, Guangwu Xu, Ian F. Blake
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.013
Analysis of algorithms (68W40) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (8)
Non-commutative digit expansions for arithmetic on supersingular elliptic curves ⋮ Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices ⋮ Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases ⋮ Analysis of width-\(w\) non-adjacent forms to imaginary quadratic bases ⋮ Efficient scalar multiplication on Koblitz curves with pre-computation ⋮ Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication ⋮ Existence and optimality of \(w\)-non-adjacent forms with an algebraic integer base ⋮ Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited
Cites Work
This page was built for publication: A note on window \(\tau\)-NAF algorithm
