An algorithm for modular exponentiation

Information Processing Letters

Volumn 66, Issue 3, 1998, Pages 155-159

  Dimitrov, V S ^a   Jullien, G A ^a   Miller, W C ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

Author keywords

Computer arithmetic; Cryptography; Modular exponentiations; Number theory

Indexed keywords

EID: 0002535157     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00044-1     Document Type: Article

References (14)

1. A. Borodin, I. Munro, The computational complexity of algebraic and numeric problems, Theory Comput. Ser., Vol. 1, 1974.
2. E.F. Brickell, D.M. Gordon, K.S. McCurley, D.B. Wilson, Fast exponentiation with precomputation, in: R.A. Rueppel (Ed.), Advances in Cryptology - Proceedings of Eurocrypt-92, Lecture Notes in Computer Sci., Vol. 658, Springer, Berlin, 1993, pp. 200-207.
3. E.F. Brickell, K.S. McCurley, An interactive identification scheme based on discrete logarithms and factoring, J. Cryptology 5 (1) (1992) 29-39.
4. C.-Y. Chen, C.-C. Chang, W.P. Yang, Hybrid method for modular exponentiation with precomputations, Electron. Lett. 32 (6) (1996) 540-541.
5. P. de Rooij, Efficient exponentiation using precomputations and vector addition chains, in: Proceedings Eurocrypt-94, pp. 403-415.
6. B.M.M. de Weger, Algorithms for Diophantine Equations, CWI Tracts, Vol. 65, CWI, Amsterdam, 1989.
7. V. Dimitrov, T. Cooklev, Two algorithms for modular exponentiation using nonstandard arithmetics, IEICE Trans. Fundam. E78-A (1) (1995) 82-87.
8. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory IT-31 (4) (1985) 469-472.
9. G. Hardy, Ramanujan, Cambridge University Press, 1940.
10. D.E. Knuth, Seminumerical Algorithms, 2nd ed., The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, MA, 1981.
11. P. Montgomery, A survey on modern integer factorizing algorithms, CWI Quarterly 7 (4) (1994) 337-366.
12. C.P. Shnorr, Efficient signature generation by smart cards, J. Cryptology 4 (3) (1991) 161-174.
13. R. Tijdeman, On the maximal distance between integers composed of small primes, Compositio Math. 28 (1974) 159-162.
14. J. von zur Gathen, Processor-efficient exponentiation in finite fields, Inform. Process. Lett. 41 (1992) 81-86.