A note on signed binary window algorithm for elliptic curve cryptosystems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3810 LNCS, Issue , 2005, Pages 223-235

  Kong, Fanyu ^a   Li, Daxing ^a  

^a SHANDONG UNIVERSITY   (China)

Author keywords

Elliptic curve cryptosystems; Point multiplication; Signed window algorithm; Signed digit number representations

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INTEGER PROGRAMMING; OPTIMAL CONTROL SYSTEMS; THEOREM PROVING;

ELLIPTIC CURVE CRYPTOSYSTEMS; POINT MULTIPLICATION; SIGNED WINDOW ALGORITHM; SIGNED-DIGIT NUMBER REPRESENTATIONS;

CRYPTOGRAPHY;

EID: 33744831172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11599371_19     Document Type: Conference Paper

References (32)

1. N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol. 48, pp. 203-209, 1987.
2. V. S. Miller, "Use of elliptic curve in cryptography," Advances in Cryptology -CRYPTO'85, LNCS 218, Springer-Verlag , pp. 417-426, 1986.
3. D. E. Knuth, The Art of Computer Programming, vol. 2: Seminumerical Algorithms, Addison-Wesley, 3rd edition, 1998.
4. H. Cohen, A Course in Computational Algebraic Number Theory, vol. 138 of Graduate Texts in Mathematics, Springer-Verlag, 1993.
5. C. K. Koc, "Analysis of sliding window techniques for exponentiation," Computers and Mathematics with Applications, 30(10), pp.17-24, 1995.
6. k-ary and of the sliding window algorithms for fast exponentiation," Rivista di Matematica dell'Universitá di Parma. 7(3). 2004.
7. D.M. Gordon, "A Survey of Fast Exponentiation Methods," Journal of Algorithms, vol. 27, pp. 129-146, 1998.
8. A. D. Booth, "A Signed Binary Multiplication Technique," Q. J. Mech. Appl. Math., vol. 4, no. 2, pp. 236-240, 1951.
9. G. W. Reitwiesner, "Binary arithmetic," Advances in Computers, vol. 1, pp. 231-308, 1960.
10. F. Morain and J. Olivos, "Speeding up the computations on an elliptic curve using addition-subtraction chains," Theoretical Informatics and Applications, vol. 24, pp. 531-543, 1990.
11. K. Koyama and T. Tsuruoka, "Speeding up elliptic curve cryptosystems using a signed binary window method," Advances in Cryptology - CRYPTO'92, LNCS 740, Springer-Verlag , pp. 345-357, 1992.
12. N. Kunihiro and H. Yamamoto, "Window and extended window methods for addition-subtraction chain," IEICE Trans. on Fundamentals, vol.E81-A, no.1, pp. 72-81, Jan. 1998.
13. E. De Win, S. Mister, B. Preneel and M. Wiener, "On the Performance of Signature Schemes based on Elliptic Curves," Proc. of ANTS'98, Springer-Verlag, LNCS 1423, pp. 252-266, 1998.
14. A. Miyaji, T. Ono and H. Cohen, "Efficient elliptic curve exponentiation," In Proceedings ICICS'97, LNCS 1334, pp. 282-290, Springer-Verlag, 1997.
15. J. A. Solinas, "An improved algorithm for arithmetic on a family of elliptic curves," In Proceedings of CRYPTO '97, LNCS 1294, pp. 357-371, Springer-Verlag, 1997.
16. J. A. Solinas, "Efficient arithmetic on Koblitz curves," Designs, Codes and Cryptography, vol. 19 , pp. 195-249, 2000.
17. H. Cohen, "Analysis of the sliding window powering algorithm," J. of Cryptology, vol. 18, no.1, pp.63-76, 2005.
18. J. A. Muir and D. R. Stinson, "Minimality and Other Properties of the Width-w Nonadjacent Form," to appear in Mathematics of Computation. Available at: http://www.ccsl.carleton.ca/~jamuir/papers/wNAF-revised-3.pdf.
19. M. Joye, and S. M. Yen, "Optimal left-to-right binary signed-digit recoding," IEEE Trans, on Comp. 49 (7), pp. 740-748, 2000.
20. R. M. Avanzi, "A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue," In: H. Handschuh and A. Hasan (Eds.): SAC 2004, LNCS 3357, pp. 130-143, Springer-Verlag, 2005.
21. Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Spahn, Tsuyoshi Takagi, "Signed Binary Representations Revisited," CRYPTO 2004, LNCS 3152, pp. 123-139, Springer-Verlag, 2004.
22. J. A. Muir, and D. R. Stinson, "New Minimal Weight Representations for Left-to-Right Window Methods," CT-RSA 2005, Lecture Notes in Computer Science 3376, pp. 366-383, Springer-Verlag, 2005.
23. B. Möller, "Improved Techniques for Fast Exponentiation," Information Security and Cryptology - ICISC 2002, Lecture Notes in Computer Science 2587, pp. 298-312, Springer-Verlag, 2002.
24. B. Möller, "Fractional Windows Revisited: Improved Signed-Digit Representations for Efficient Exponentiation," Information Security and Cryptology - ICISC 2004, Lecture Notes in Computer Science 3506 , pp. 137-153, Springer-Verlag, 2005.
25. S. Arno and F. S. Wheeler, "Signed digit representations of minimal hamming weight," IEEE Transactions on Computers, vol. 42, no. 8, pp. 1007-1010, 1993.
26. O. Egecioglu and C. K. Koc, "Exponentiation using canonical recoding," Theoretical Computer Science, 129(2), pp. 407-417, 1994.
27. W. Bosma, "Signed Bits and Fast Exponentiation," J. Théor. Nombres Bordeaux, 13(1), pp. 27-41, 2001.
28. R. M. Avanzi, "On multi-exponentiation in cryptography," Technical Report 2002/154, Cryptology ePrint Archive(2002), Available at: http://eprint.iacr.org/2002/154.
29. R. M. Avanzi, "On the complexity of certain multi-exponentiation techniques in cryptography," J. of Cryptology, Online First, 2005.
30. Clemens Heuberger and Peter Grabner, "On the number of optimal base 2 representations of integers," Preprint available at: http://www.opt.math. tu-graz.ac.at/~cheub/publications.
31. B. Phillips and N. Burgess, "Minimal Weight Digit Set Conversions," IEEE Transactions on Computers, vol.53, no.6, pp. 666-677, 2004.
32. Olivier Semay, "Efficiency analysis of window methods using Markov chains," Diplomarbeit, Sommer 2004. Available at: http://www.cdc. informatik.tu-darmstadt.de/reports/reports/KP/Olivier.Semay.diplom.ps.