Minimality and other properties of the width-w nonadjacent form

Mathematics of Computation

Volumn 74, Issue 253, 2006, Pages 369-384

  Muir, James A ^a   Stinson, Douglas R ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Efficient representations; Elliptic curve arithmetic; Minimal weight

Indexed keywords

EID: 32944459321     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-05-01769-2     Document Type: Article

References (16)

1. R. M. Avanzi. A Note on the Sliding Window Integer Recoding and its Left-to-Right Analogue, to appear in "Workshop on Selected Areas in Cryptography - SAC 2004".
2. I. F. Blake, G. Seroussi and N. P. Smart. Elliptic Curves in Cryptography, Cambridge University Press, 1999. MR1771549 (20011:94048)
3. S. H. Chang and N. Tsao-Wu. Distance and Structure of Cyclic Arithmetic Codes, in "Proceedings of the Hawaii International Conference on System Sciences" (1968), 463-466.
4. H. Cohen. Analysis of the Flexible Window Powering Algorithm. Preprint. Available from http://www.math.u-bordeaux.fr/~cohen/window.dvi.
5. H. Cohen, A. Miyaji and T. Ono. Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, in "Advances in Cryptology - ASIACRYPT '98", Lecture. Notes in Computer Science 1514 (1998), 51-65. MR1726152
6. D. M. Gordon. A Survey of Fast Exponentiation Methods. Journal of Algorithms 27 (1998), 129-146. MR1613189 (99g:94014)
7. D. Hankerson, A. Menezes and S. Vanstone. Guide to Elliptic Curve Cryptography, Springer, 2004. MR2054891 (2005c:94049)
8. C. Heuberger, R. Katti, H. Prodinger and X. Ruan. The Alternating Greedy Expansion and Applications to Left-to-Right Algorithms in Cryptography, Preprint. Available from http://www.wits.ac.za/helmut/paperlst.htm.
9. K. Koyama and Y. Tsuruoka. Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method, in "Advances in Cryptology - CRYPTO '92", Lecture Notes in Computer Science 740 (1993). 345-357. MR1287864
10. J. H. van Lint, Introduction to Coding Theory. 3rd edition, Springer, 1999. MR1664228 (2000a:94001)
11. A. Miyaji, T. Ono and H. Cohen. Efficient Elliptic Curve Exponentiation, in "Information and Communication Security - ICICS '97". Lecture Notes in Computer Science 1334 (1997), 282-290.
12. B. Möller. Improved Techniques for Fast Exponentiation, in "Information Security and Cryptology - ICISC 2002", Lecture Notes in Computer Science 2587 (2002), 298-312. MR2080830
13. J. A. Muir and D. R. Stinson. New Minimal Weight Representations for Left-to-Right Window Methods, Technical Report CORR 2004-19, Centre for Applied Cryptographic Research. Available from http://www.cacr.math.uwaterloo.ca/ techreports/2004.
14. K. Okeya, K. Schmidt-Samoa, C. Spahn and T. Takagi. Signed Binary Representations Revisited, in "Advances in Cryptology - CRYPTO 2004", Lecture Notes in Computer Science 3152 (2004), 123-139.
15. G. W. Reitwiesner. Binary Arithmetic, in Advances in Computers, Vol. 1. Academic Press, 1960, pp. 231-308. MR0122018 (22:12745)
16. J. A. Solinas. Efficient arithmetic on Koblitz curves. Designs, Codes and Cryptography 19 (2000), 195-249. MR.1759617 (2002k:14039)