A note on the signed sliding window integer recoding and a left-to-right analogue

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

Volumn 3357, Issue , 2004, Pages 130-143

  Avanzi, Roberto Maria ^a  

^a UNIVERSITY HOSPITAL ESSEN   (Germany)

Author keywords

Computer arithmetic; Integer Recoding; Left to right recoding; Non adjacent form; Redundant number representation; Signed digit representation; Width w non adjacent form (w NAF)

Indexed keywords

CRYPTOGRAPHY; COMPUTATION THEORY; INTEGRAL EQUATIONS; PROBLEM SOLVING; RANDOM PROCESSES;

COMPUTER ARITHMETIC; INTEGER RECODINGS; LEFT-TO-RIGHT RECODING; NONADJACENT FORMS; RECODING; REDUNDANT NUMBER REPRESENTATIONS; SIGNED-DIGIT REPRESENTATION; SLIDING WINDOW; WIDTH-W NON-ADJACENT FORM;

ARTIFICIAL INTELLIGENCE; CRYPTOGRAPHY;

COMPUTER ARITHMETIC; INTEGER RECODING; LEFT-TO-RIGHT RECODING; NON-ADJACENT FORMS; REDUNDANT NUMBER REPRESENTATION; SIGNED-DIGIT REPRESENTATION; WIDTH-W NON-ADJACENT FORM (W-NAF);

EID: 23844439141     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30564-4_9     Document Type: Article

References (26)

1. R. M. Avanzi. On the complexity of certain multi-exponentiation techniques in cryptography. To appear in: J. of Cryptology.
2. D. J. Bernstein. Pippenger's exponentiation algorithm. Preprint. Available from http://cr.yp.to
3. A. Brauer. On addition chains. Bull. AMS. 45, pages 736-739 (1939).
4. H. Cohen. Analysis of the flexible window powering algorithm. To appear in: J. of Cryptology.
5. H. Cohen, A. Miyaji, and T. Ono. Efficient elliptic curve exponentiation. In Proceedings ICICS'97, LNCS 1334, 282-290. Springer, 1997.
6. P. Downey, B. Leong, and R. Sethi. Computing sequences with addition chains. SIAM J. Computing 10, 638-646 (1981). MR 82h:68064.
7. P. Erdos. Remarks on number theory III. On addition chains. Acta Arith., 6, 77-81 (1960).
8. D. Gordon. A Survey of Fast Exponentiation Methods. J. of Algorithms, 27, 129-146 (1998).
9. P. J. Grabner, C. Heuberger, and H. Prodinger. Distribution results for low-weight binary representations for pairs of integers. Theoretical Computer Science, to appear.
10. P. J. Grabner, C. Heuberger, H. Prodinger, and J. Thuswaldner. Analysis of linear combination algorithms in cryptography. Preprint. Available from: http://www.opt.math.tu-graz.ac.at/~cheub/publications/Windows.pdf
11. C. Heuberger, R. Katti, H. Prodinger, and X. Ruan. The Alternating Greedy Expansion and Applications to Left-To-Right Algorithms in Cryptography. Preprint.
12. M. Joye, and S.-M. Yen. Optimal left-to-right binary signed-digit recoding. IEEE Trans, on Comp. 49(7), 740-748 (2000).
13. M. Joye, and S.-M. Yen. New Minimal Modified Radix-r Representation. In Proceedings of PKC2002. LNCS 2274, 375-384. Springer, 2003.
14. N. Koblitz. Elliptic curve cryptosystems. Math. Comp. 48 (177), 203-209 (1987).
15. N. Koblitz. Hyperelliptic cryptosystems. J. of Cryptology 1, 139-150 (1989).
16. V. S. Miller. Use of elliptic curves in cryptography. In: Proceedings of Crypto '85, LNCS 218, 417-426. Springer, 1986.
17. J.A. Muir, and D.R. Stinson. Minimality and Other Properties of the Width-w Nonadjacent Form. Technical Report CORR 2004-08, Centre for Applied Cryptographic Research. Available from http://www.cacr.math.uwaterloo.ca/ techreports/2004/
18. J.A. Muir, and D. R. Stinson. New Minimal Weight Representations for Left-to-Right Window Methods. Technical Report CACR 2004-03, Centre for Applied Cryptographic Research. Available from http://www.cacr.math.uwaterloo.ca/ techreports/2004/
19. K. Okeya, K. Schmidt-Samoa, C. Spahn, and T. Takagi. Signed Binary Representations Revisited. Proceedings of Crypto 2004.
20. G. W. Reitwiesner. Binary arithmetic. Advances in Computers 1, 231-308 (1960).
21. k-ary and of the sliding window algorithms for fast exponentiation. To appear in: Rivista di Matematica dell'Universitá di Parma.
22. J. A. Solinas. An improved algorithm for arithmetic on a family of elliptic curves. In Proceedings of CRYPTO '97, LNCS 1294, 357-371. Springer, 1997.
23. J. A. Solinas. Low-Weight Binary Representations for Pairs of Integers. Centre for Applied Cryptographic Research, University of Waterloo, Combinatorics and Optimization Research Report CORR 2001-41, 2001. Available from: http://www.cacr.math.uwaterloo.ca/techreports/2001/corr2001-41.ps
24. M. Stam and A. K. Lenstra. Efficient subgroup exponentiation in quadratic and sixth degree extensions. In Proceedings of CHES 2002. LNCS 2523, 318-332. Springer, 2003.
25. E. G. Thurber. On addition chains l(mn) ≤ l(n)b and lower bounds for c(r). Duke Math. J. 40 907-913 (1973).
26. A. C. Yao. On the evaluation of powers. SIAM J. Computing 5 100-103 (1976).