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
On redundant T-adic expansions and non-adjacent digit sets
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Designs, Codes and Cryptography
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
| Hi-index | 0.89 |
The window @t-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 @t-adic form for each element in Z[@t] is obtained. In particular, this provides a proof of the termination of Solinas algorithm.