Exponentiation in finite fields: Theory and practice

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

Volumn 1255, Issue , 1997, Pages 88-113

  Von Zur Gathen, Joachim ^a   Nocker, Michael ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957797971     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63163-1_8     Document Type: Conference Paper

References (42)

1. n). In Advances in Cryptology-EUROCRYPT‘88, ed. C. G. Gunther, vol. 330 of Lecture Notes in Computer Science, 251-255. Springer, Berlin, 1988.
2. I. Bocharova and B. Kudryashov, Fast exponentiation in cryptography. In Proceedings Applied algebra., algebraic algorithms and error correcting codes: 11th International Symposium AAECC, ed. G. COHEN, Lecture notes in computer science 948, Berlin, 1995, Springer, 146-157.
3. A. Brauer, On addition chains. Bull. Amer. Math. Soc. 45 (1939), 736-739.
4. R. P. Brent and H. T. Kung, Fast algorithms for manipulating formal power series. J. Assoc. Comput. Mach. 25 (1978), 581-595.
5. E. Brickell, D. Gordon, K. McCurley, and D. Wilson, Fast exponentiation with precomputation. In Advances in cryptology: Proceedings EUROCRYPT‘92, ed. R. Rueppel, Lecture notes in computer science 658, Berlin, 1993, Springer, 200-207
6. D. G. Cantor, On arithmetical algorithms over finite fields. Journal of Combinatorial Theory, Series A 50 (1989), 285-300.
7. D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras. Acta. Inform. 28 (1991), 693-701.
8. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions. J. Symb. Comp. 9 (1990), 251-280.
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 E. Sethi, Computing sequences with addition chains. SIAM J. Comput. 10(3) (1981), 638-646.
11. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on information theory IT-31 (4) (1985), 469-472.
12. S. Gao and H. W. Lenstra., Optimal normal bases. Designs, Codes, and Cryptography 2 (1992), 315-323.
13. S. Gao, J. von zur Gathen, and D. Panario, Gauss periods and fast exponentiation in finite fields. In Proc. Latin‘95, Valparaiso, Chile, Springer Lecture Notes in Computer Science 911, 1995, 311-322.
14. J. von zur Gathen, Efficient and optimal exponentiation in finite fields. Comput complexity 1 (1991), 360-394.
15. 2. In Proc. ISSAC‘96, Zürich, Switzerland. ACM press, 1996, 1-9.
16. Joachim von zur Gathen and Sandra Schlink, Normal bases via general Gauss periods. Reihe Informatik tr-ri-96-177, Umversität-Gesamthochschule Paderbom, 1996
17. J. VON ZUR Gathen and V. Shoup, Computing Frobenius maps and factoring polynomials. Computational complexity 2 (1992), 187-224.
18. W. GEISELMANN, Algebraische Algorithmenentwicklung am Beispiel der Arithmetik in endlichcn Korpern. Dissertation, Universitat Karlsruhe, Aachen, 1994.
19. m) using normal bases. Information and Computation 78 (1988), 171-177.
20. D. Jungnickel, Finite Fields: Structure and Arithmetics. BI Wissenschaftsverlag, Mannheim, 1993.
21. A. Karatsuba and Y. Ofman, Уmhoҗehиe MHoгo3Haчнx чиceл Ha aB- Tomatax. Dokl. Akad. Nauk USSR 145 (1962), 293-294. Multiplication of multidigit numbers on automata, Soviet Physics-Doklady 7 (1963), 595-596.
22. D. E. Knuth, The Art of Computer Programming, Vol.2, Seminumerical Algorithms. Addison-Wesley, Reading MA, 2 edition, 1981.
23. D. H. Lehmer, Euclid’s algorithm for large numbers. American Mathematical Monthly 45 (1938), 227-233.
24. R. Lidl and H. Niederreiter, Finite Fields. Encyclopedia of Mathematics and its Applications 20. Addison-Wesley, Reading MA, 1983.
25. M. Lothaire, Combinatorics on Words. Addison-Wesley Reading, MA, 1983.
26. Alfred j. menezes, Ian F. Blake, XuHong Gao, Ronald C. Mullin, Scott A. Vanstone, and Tomik Yaghoobian, Applications of finite fields. Kluwer Academic Publishers, Norwell MA, 1993.
27. n). Discrete Applied Math. 22 (1989), 149-161.
28. A. Odlyzko, Discrete logarithms and their cryptographic significance. In Advances in Cryptology, Proceedings of Eurocrypt 1984. Springer-Verlag, 1985, 224-314.
29. R. L. Rivest, A. Shamir, and L. M. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM 21 (1978), 120-126.
30. P. de Rooij, Efficient exponentiation using precomputation and vector addition chains. In Advances in cryptology: Proceedings EUROCRYPT‘94, ed. A. DeSantis, Lecture notes in computer science 950, Berlin, 1995, Springer, 389-399.
31. A. Schönhage, Schnelle Berechnung von Kettenbruchentwicklungen. Acta Informatica 1 (1971), 139-144.
32. A. Schönhage, A lower bound for the length of addition chains. Theor. Computer Science 1 (1975), 1-12.
33. A. Schonhage, Schnelle Multiplikation von Polynomen über Korpern der Charakteristik 2. Acta Inf. 7 (1977), 395-398.
34. A. Schonhage and V. Strassen, Schnelle Multiplikation grofier Zahlen. Computing (1971), 281-292.
35. V. Shoup, Exponentiation in GF(2”) using fewer polynomial multiplications. Preprint, 1994.
36. n). SIAM J. Comput. 19 (1990), 711-717.
37. V. Strassen, Gaussian elimination is not optimal. Ntimer. Mathematik 13 (1969), 354-356.
38. V. Strassen, The computational complexity of continued fractions. SIAMJ. Comput. 12 (1983), 1-27.
39. P. Tunstall, Synthesis of noiseless compression codes. Ph.D. dissertation, Georgia Inst. Technol., 1968.
40. A. Wassermann, Zur Arithmetik in endliehen Korpern. Bayreuther Math. Schriften 44 (1993), 147-251.
41. Y. Yacobi, Exponentiating faster with addition chains. In Advances in cryptology: Proceedings EUROCRYPT‘90, ed. I. Damgard, Lecture notes in computer science 473, Berlin, 1991, Springer, 222-229.
42. J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory IT-24(5) (1978), 530-536.