An adaptive exponentiation method

Journal of Systems and Software

Volumn 42, Issue 1, 1998, Pages 59-69

  Lou, Der Chyuan ^a   Chang, Chin Chen ^b  

^a NATIONAL DEFENSE UNIVERSITY   (Taiwan)

^b NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Exponentiation; Public key cryptography; The binary method; The m ary method

Indexed keywords

ADAPTIVE SYSTEMS; ALGORITHMS; BINARY CODES; OPTIMIZATION; PARAMETER ESTIMATION; PERFORMANCE; TABLE LOOKUP;

PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 0032119102     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(98)00007-7     Document Type: Article

References (20)

1. Bos, J., Coster, M., 1990. Addition chain heuristics. In: Advances in Cryptology - Proceedings of Crypto '89. Springer, New York, pp. 400-407.
2. Brickell, E.F., 1983. A fast modular multiplication algorithm with application to two key cryptography. In: Advances in Cryptology -Proceedings of Crypto '82. Plenum Press, New York, pp. 51-60.
3. Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D., 1993. Fast exponentiation with precomputation. In: Advances in Cryptology -Proceedings of Eurocrypt '92. Springer, New York, pp. 200-207.
4. Brickell, E.F., McCurley, K.S., 1991. Interactive identification and digital signature. AT&T Technical Journal (November/December), 73-86.
5. Chen, C.-Y., Chang, C.-C., Yang, W.-P., 1996. Hybrid method for modular exponentiation with precomputation. IEE Electronics Letters 32 (6), 540-541.
6. Chiou, C.-W., 1993. Parallel implementation of the RSA public-key cryptosystem. International Journal of Computer Mathematics 48 (3-4), 153-155.
7. Diffie, W., Hellman, M.E., 1976. New directions in cryptography. IEEE Trans. Information Theory IT 22 (6), 644-654.
8. Dimitrov, V., Cooklev, T., 1995. Two algorithms for modular exponentiation using nonstandard arithmetics. IEICE Transactions on Fundamentals E78 A (1), 82-87.
9. Eldridge, S.E., Walter, C.D., 1993. Hardware implementation of Montgomery's modular multiplication algorithm. IEEE Trans. Comput. 42 (6), 693-699.
10. ElGamal, T., 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory 31 (4), 469-472.
11. Knuth, D.E., 1969. The Art of Computer Programming. Vol. II: Seminumerical Algorithms. Addison-Wesley, Reading, MA.
12. Lou, D.-C., Chang, C.-C., 1996. Fast exponentiation method obtained by folding the exponent in half. IEE Electronics Letters 32 (11), 984-985.
13. MacWilliams, F.J., Sloane, N.J.A., 1977. The Theory of Error-Correcting Codes. North-Holland, Amsterdam.
14. Montgomery, P.L., 1985. Modular multiplication without trial division. Mathematics of Computation 44 (170), 519-521.
15. National Institute of Standards and Technology, 1991. A proposed federal information processing standard for digital signature standard (DSS). Federal Register 56 (169), 42980-2982.
16. Rivest, R.L., Shamir, A., Adleman, L., 1978. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21 (2), 120-126.
17. Rooij, P. de., 1995. Efficient exponentiation using precomputation and vector addition chains. In: Advances in Cryptology - Proceedings of Eurocrypt'94. Springer, New York, pp. 405-415.
18. Schnorr, C.P., 1990. Efficient identification and signature for smart cards. In: Advances in Cryptology - Proceedings of Crypto '89. Springer, New York, pp. 239-252.
19. Walter, C.D., 1992. Fast modular multiplication by operand scaling. In: Advances in Cryptology - Proceedings of Crypto'91. Springer, New York, pp. 313-323.
20. Williams, H.C., 1982. A p+1 method factoring. Mathematics of Computation 39 (159), 225-234.