A note on window τ-NAF algorithm

Authors:
Ian F. Blake;V. Kumar Murty;Guangwu Xu
Affiliations:
Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada;Department of Mathematics, University of Toronto, Toronto, Ontario, Canada;Department of Electrical Engineering and Computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI
Venue:
Information Processing Letters
Year:
2005

Citing 5
Cited 0

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Efficient Arithmetic on Koblitz Curves

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Elliptic curves in cryptography

Elliptic curves in cryptography
CM-Curves with Good Cryptographic Properties

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Efficient Multiplication on Certain Nonsupersingular Elliptic Curves

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.89

Visualization

Abstract

The window τ-adic algorithm of Solinas [Efficient arithmetic on Koblitz curves, Designs, Codes and Cryptography 19 (2000) 195] is the most powerful method for computing point multiplication for Koblitz curves. In this note, the existence of a more general window τ-adic form for each element in Z[τ] is obtained. In particular, this provides a proof of the termination of Solinas algorithm.