A Survey of Fast Exponentiation Methods

Journal of Algorithms

Volumn 27, Issue 1, 1998, Pages 129-146

  Gordon, Daniel M ^a  

^a CENTER FOR COMMUNICATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000490812     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0913     Document Type: Article

References (32)

1. L. M. Adleman and K. Kompella, Using smoothness to achieve parallelism, in "Proceedings of the 20th ACM Symposium on the Theory of Computing," pp. 528-538, 1988.
2. G. B. Agnew, R. C. Mullin, and S. A. Vanstone, Fast exponentiation in GF(2n), in "Advances in Cryptology - Proceedings of Eurocrypt '88," Vol. 330, pp. 251-255, Springer-Verlag, Berlin/New York, 1988.
3. S. Arno and F. S. Wheeler, Signed digit represenations of minimal Hamming weight, IEEE Trans. Comput. 42 (1993), 1007-1010.
4. D. J. Bernstein, "Detecting Perfect Powers in Essentially Linear Time, and Other Studies in Computational Number Theory," Ph.D. thesis, University of California, Berkeley, 1995.
5. J. Bos and M. Coster, Addition chain heuristics, in "Advances in Cryptology - Proceedings of Crypto '89," Vol. 435, pp. 400-407, Springer-Verlag, Berlin/New York, 1990.
6. E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson, Fast exponentiation with precomputation: Algorithms and lower bounds, preprint, 1995. (Contact the second author for a copy.)
7. E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson. Fast exponentiation with precomputation, in "Advances in Cryptology - Proceedings of Eurocrypt '92," Vol. 658, pp. 200-207, Springer-Verlag, Berlin/New York, 1992.
8. P. de Rooij, Efficient exponentiation using precomputation and vector addition chains, in "Advances in Cryptology - Proceedings of Eurocrypt '94," Vol. 950, pp. 389-399, 1994.
9. W. Diffie and M. E. Hellman, New directions in cryptography. IEEE Trans. Inform. Theory 22 (1976), 644-654.
10. P. Downey, B. Leong, and R. Sethi, Computing sequences with addition chains, SIAM J. Comput. 10 (1981), 638-646.
11. P. Erdos, Remarks on number theory. III. On addition chains, Acta Arith. (1960), 77-81.
12. S.-M. Hong, S.-Y. Oh, and H. Yoon, New modular multiplication algorithms for fast modular exponentiation, in "Advances in Cryptology - Proceedings of Eurocrypt '96," pp. 166-177, 1996.
13. D. E. Knuth, "Seminumerical Algorithms," 2nd ed., "The Art of Computer Programming," Vol. 2, Addison-Wesley, Reading, MA, 1981.
14. N. Koblitz, CM-curves with good cryptographic properties, in "Advances in Cryptology -Proceedings of Crypto '92," (J. Feigenbaum, Ed.) Vol. 576, pp. 279-287, 1992.
15. K. Koyama and Y. Tsuruoka, Speeding up elliptic cryptosystems by using a signed binary window method, in "Advances in Cryptology - Proceedings of Crypto '92," Vol. 740, pp. 345-357, Springer-Verlag, Berlin/New York, 1993.
16. C. H. Lim and P. J. Lee, More flexible exponentiation with precomputation, in "Advances in Cryptology-Proceedings of Crypto '94," Vol. 839, pp. 95-107, 1994.
17. W. Meier and O. Staffelbach, Efficient multiplication on certain nonsupersingular elliptic curves, in "Advances in Cryptology - Proceedings of Crypto '92, "Vol. 740, pp. 333-344, Springer-Verlag, Berlin/New York, 1993.
18. A. J. Menezes, "Elliptic Curve Public Key Cryptosystems," Kluwer, Dordrecht/Norwell, MA, 1993.
19. A. J. Menezes, T. Okamoto, and S. A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Trans. Inform. Theory 39 (1993), 1639-1646.
20. P. Montgomery, Modular multiplication without trial division, Math. Comp. 44 (1985), 519-521.
21. F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, Inform. Theory Appl. 24 (1990), 531-543.
22. J. Olivos, On vectorial addition chains, J. Algorithms 2 (1981), 13-21.
23. R. G. E. Pinch, Some primality testing algorithms, Notices Amer. Math. Soc. 40 (1993), 1203-1210.
24. B. Poonen, private communication.
25. R. Rivest, A. Shamir, and L. M. Adleman, A method for obtaining digital signatures and public key cryptosystems, Communications of the ACM 21 (1978), 120-126.
26. J. A. Solinas, An improved algorithm for arithmetic on a family of elliptic curves, in "Advances in Cryptology - Proceedings of Crypto '97," pp. 357-371, 1997.
27. n), SIAM J. Comput. 19 (1990), 711-717.
28. J. H. van Lint, "Introduction to Coding Theory," Springer-Verlag, Berlin/New York, 1982.
29. J. von zur Gathen, Efficient exponentiation in finite fields, in "Proceedings of the 32nd IEEE Symposium on the Foundations of Computer Science," pp. 384-391, 1991.
30. J. von zur Gathen, Computing powers in parallel, SIAM J. Comput. (1987), 930-945.
31. J. von zur Gathen, Efficient and optimal exponentiation in finite fields, Comput. Complexity, (1991), 360-394.
32. A. C. Yao, On the evaluation of powers, SIAM J. Comput. 5 (1976), 100-103.