| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331944 | Information Processing Letters | 2005 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ian F. Blake, V. Kumar Murty, Guangwu Xu,