A note on window τ-NAF algorithm

被引：20
作者：
Blake, IF [1 ]
Murty, VK
Xu, GW
机构：
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada
[2] Univ Toronto, Dept Math, Toronto, ON M5S 3G3, Canada
[3] Univ Wisconsin, Dept Elect Engn & Comp Sci, Milwaukee, WI 53211 USA
来源：
INFORMATION PROCESSING LETTERS | 2005年 / 95卷 / 05期
关键词：
cryptography; algorithms; elliptic curves;
D O I：
10.1016/j.ipl.2005.05.013
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The window tau-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 tau-adic form for each element in Z[tau] is obtained. In particular, this provides a proof of the termination of Solinas algorithm. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：496 / 502
页数：7
相关论文
共 6 条
  • [1] Blake I.F., 1999, ELLIPTIC CURVES CRYP
  • [2] KOBLITZ N, 1992, LECT NOTES COMPUT SC, V576, P279
  • [3] KOBLITZ N, 1987, MATH COMPUT, V48, P203, DOI 10.1090/S0025-5718-1987-0866109-5
  • [4] MEIER W, 1993, LNCS, V740, P333
  • [5] MILLER V, 1992, LECT NOTES COMPUT SC, V218, P417
  • [6] Efficient arithmetic on Koblitz curves
    Solinas, JA
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2000, 19 (2-3) : 195 - 249
1