New minimal weight representations for left-to-right window methods

Lecture Notes in Computer Science

Volumn 3376, Issue , 2005, Pages 366-383

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

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

LEFT-TO-RIGHT ALGORITHM; WINDOW METHOD;

CRYPTOGRAPHY;

EID: 23844487671     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30574-3_25     Document Type: Conference Paper

References (14)

1. R. M. Avanzi A Note on the Signed Sliding Window Integer Recoding and its Left-to-Right Analogue, in "Selected Areas in Cryptography 2004". To appear in Lecture Notes in Computer Science.
2. I. F. Blake, G. Seroussi and N. P. Smart. Elliptic Curves in Cryptography, Cambridge University Press, 1999.
3. H. Cohen. Analysis of the Flexible Window Powering Algorithm. To appear in Journal of Cryptology. Available from http://www.math.u-bordeaux.fr/~cohen/window.dvi.
4. 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.
5. D. M. Gordon. A Survey of Fast Exponentiation Methods, Journal of Algorithms 27 (1998), 129-146.
6. P. Grabner, C. Heuberger, H. Prodinger and J. Thuswaldner. Analysis of Linear Combination Algorithms in Cryptography. Submitted. Available from http://www.opt.math.tu-graz.ac.at/~cheub/publications/.
7. D. Hankerson, A. Menezes and S. Vanstone. Guide to Elliptic Curve Cryptography, Springer, 2004.
8. C. Heuberger, R. Katti, H. Prodinger, and X. Ruan. The Alternating Greedy Expansion and Applications to Left-To-Right Algorithms in Cryptography. Submitted. Available from http://www.opt.math.u-graz.ac.at/~cheub/publications/.
9. M. Joye and S. Yen. Optimal Left-to-Right Binary Signed-Digit Recoding, IEEE Transactions on Computers 49 (2000), 740-748.
10. J. A. Muir and D. R. Stinson. New Minimal Weight Representations for Left-to-Right Window Methods (Extended Version). Available from http://www.math.uwaterloo.ca/~jamuir/papers.htm.
11. J. A. Muir and D. R. Stinson. Minimality and Other Properties of the Width-w Nonadjacent Form. To appear in Mathematics of Computation. Available from http://www.math.uwaterloo.ca/~jamuir/papers.htm.
12. V. Müller. Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two. Journal of Cryptology 11 (1998), 219-234.
13. 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.
14. J. A. Solinas. Efficient arithmetic on Koblitz curves. Designs, Codes and Cryptography 19 (2000), 195-249.