How to compute modular exponentiation with large operators based on the right-to-left binary algorithm

Applied Mathematics and Computation

Volumn 176, Issue 1, 2006, Pages 280-292

  Sun, Da Zhi ^a   Cao, Zhen Fu ^a   Sun, Yu ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b BEIJING NORMAL UNIVERSITY   (China)

Author keywords

Computer algebra system; Framework; Modular exponentiation; Performance; Right to left binary algorithm; t fold exponent method

Indexed keywords

COMPUTATION THEORY; LINEAR ALGEBRA; MATHEMATICAL TECHNIQUES; THEOREM PROVING;

COMPUTER ALGEBRA SYSTEM; FRAMEWORK; MODULAR EXPONENTIATION; RIGHT-TO-LEFT BINARY ALGORITHMS; T-FOLD EXPONENT METHOD;

LEARNING ALGORITHMS;

EID: 33748056835     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2005.09.062     Document Type: Article

References (16)

1. Knuth D.E. The Art of Computer Programming. Seminumerical Algorithms. third edition vol. 2 (1997), Addison-Wesley, Reading, MA 461
2. Downey P., Leong B., and Sethi R. Computing sequences with addition chains. SIAM Journal on Computing 10 3 (1981) 638-646
3. Erdös P. Remarks on number theory. III. On addition chains. Acta Arithmetica 6 (1960) 77-81
4. Lou D.C., and Chang C.C. An adaptive exponentiation method. The Journal of Systems and Software 42 1 (1998) 59-69
5. Bos J., and Coster M. Addition chain heuristics, Advances in Cryptology-CRYPTO'89, LNCS 435 (1990), Springer-Verlag pp. 400-407
6. Koç C.K. Analysis of sliding window techniques for exponentiation. Computers and Mathematics with Applications 30 10 (1995) 17-24
7. Park H., Park K., and Cho Y. Analysis of the variable length nonzero window method for exponentiation. Computers and Mathematics with Applications 37 7 (1999) 21-29
8. Cohen H. Analysis of the sliding window powering algorithm. Journal of Cryptology 18 1 (2005) 63-76
9. Gordon D.M. A survey of fast exponentiation methods. Journal of Algorithms 27 1 (1998) 129-146
10. Ç.K. Koç, High-speed RSA implementation, Technical Report TR 201, RSA Laboratories, 1994.
11. Lou D.C., and Chang C.C. Fast exponentiation method obtained by folding the exponent in half. Electronics Letters 32 11 (1996) 984-985
12. m). IEEE Journal on Selected Areas in Communications 6 3 (1988) 578-586
13. 2m. Mathematics of Computation 60 201 (1993) 407-420
14. Blake I., Seroussi G., and Smart N. Elliptic Curves in Cryptography (1999), Cambridge University Press p. 29
15. Yen S.M., and Laih C.S. Common-multiplicand multiplication and its applications to public key cryptography. Electronics Letters 29 17 (1993) 1583-1584
16. Wu T.C., and Chang Y.S. Improved generalisation common-multiplicand multiplications algorithm of Yen and Laih. Electronics Letters 31 20 (1995) 1738-1739