A Note on Square Roots in Finite Fields

IEEE Transactions on Information Theory

Volumn 36, Issue 6, 1990, Pages 1494-1498

  Bach, Eric ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES; PROBABILITY--RANDOM PROCESSES;

FINITE FIELDS; PROBABILISTIC ALGORITHMS; RANDOMIZED ALGORITHMS; SQUARE ROOTS;

COMPUTER PROGRAMMING;

EID: 0025517401     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.59955     Document Type: Article

References (22)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
2. E. Bach, “Realistic analysis of some randomized algorithms,” in Proc. Nineteenth Ann. ACM Symp. Theory of Comput., 1987, pp. 453–461. [Final version to appear, J. Comput. Syst. Sci.]
3. P. Bachmann, Niedere Zahlentheorie, vol. 1. New York: Chelsea, 1968.
4. E. R. Berlekamp, “Factoring polynomials over large finite fields,” Math. Comp., vol. 24, pp. 713–735, 1970.
5. E. R. Berlekamp, H. Rumsey, and G. Solomon, “On the solution of algebraic equations over finite fields,” Inform. Contr., vol. 10, pp. 553–564, 1967.
6. G. Collins and R. Loos, “The Jacobi symbol algorithm,” SIGSAM Bull., vol. 16, pp. 12–16, 1982.
7. D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” in Proc. Nineteenth Ann. ACM Symp. Theory of Computing, 1987, pp. 1–6. [Final version to appear, J. Symbol. Comp.]
8. F. E. Fich and M. Tompa, “The parallel complexity of exponentiating polynomials over finite fields,” J. ACM, vol. 35, pp. 651–667, 1988.
9. C. F. Gauss, “Neue Beweise und Erweiterungen des Fundamentalsatzes in der Lehre von den quadratischen Resten,” in C. F. Gauss, Untersuchen ü ber Hohere Arithmetik. New York: Chelsea, 1965, pp. 496–510.
10. R. Hartshorne, Algebraic Geometry. Berlin: Springer-Verlag, 1977.
11. T. Itoh and S. Tsujii, “An efficient algorithm for deciding quadratic residuosity in finite fields GF(p m),” Inform. Processing Lett., vol. 30, pp. 111–114, 1989.
12. H. Kuhne, “Eine Wechselbeziehung zwischen Functionen mehrer Unbestimmten, die zu Reciprocitatsgesetzen f ü hrt,” J. Reine Angew. Math., vol. 124, pp. 121–131, 1902.
13. D. H. Lehmer, “Computer technology applied to the theory of numbers,” in Studies in Number Theory, W. J. LeVeque, Ed. Washington, D.C.: MAA, 1969.
14. R. Moenck, “Fast computation of GCD's,” Proc. Fifth Ann. ACM Symp. Theory of Computing, 1973, 142–151.
15. R. Loos, “Generalized polynomial remainder sequences,” in Computer Algebra: Symbolic and Algebraic Computation, 2nd ed., B. Buchberger, G. E. Collins, and R. Loos, Eds. Wien: Springer-Verlag, 1983, pp. 115–137.
16. O. Ore, “Contributions to the theory of finite fields,” Trans. Amer. Math. Soc., vol. 36, pp. 243–274, 1934.
17. R. Peralta, “A simple and fast probabilistic algorithm for computing square roots modulo a prime number,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 846–847, 1986.
18. M. O. Rabin, “Probabilistic algorithms in finite fields,” SIAM J. Comput., vol. 9, pp. 273–280, 1980.
19. W. M. Schmidt, Equations over Finite Fields: An Elementary Approach. Berlin: Springer-Verlag, 1976.
20. A. Schonhage, “Schnelle Berechnungen von Kettenbruchentwicklungen,” Acta Informatica, vol. 1, pp. 139–144, 1971.
21. D. Shanks, “Five number-theoretic algorithms,” in Proc. Second Manitoba Conf. Numerical Math., 1972, pp. 51–70.
22. V. Shoup, “New algorithms for finding irreducible polynomials over finite fields,” Math. Comp., vol. 54, pp. 435–447, 1990.