Skip to main content
SpringerLink
Log in
Book cover

International Conference on Finite Fields and Applications

Fq 2003: Finite Fields and Applications pp 89–108Cite as

What Do Random Polynomials over Finite Fields Look Like?

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2948))

Abstract

In this paper, we survey old and new results about random univariate polynomials over a finite field \(\mathbb{F}_q\). We are interested in three aspects: (1) the decomposition of a random polynomial in terms of its irreducible factors, (2) the usage of random polynomials in algorithms, and (3) the average-case analysis of algorithms that use polynomials over finite fields.

The author was funded by NSERC grant number 238757.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L.: The function field sieve. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 108–121. Springer, Heidelberg (1994)

    Google Scholar 

  2. Bach, E., von zur Gathen, J., Lenstra Jr., H.W.: Factoring Polynomials over Special Finite Fields. Finite Fields and Their Applications 7, 5–28 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ben-Or, M.: Probabilistic algorithms in finite fields. In: Proc. 22nd IEEE Symp. Foundations Computer Science, pp. 394–398 (1981)

    Google Scholar 

  4. Bender, E.: Central and local limit theorems applied to asymptotic enumeration. J. Combin. Theory, Ser. A 15, 91–111 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bender, E., Richmond, B.: Central and local limit theorems applied to asymptotic enumeration II: multivariate generating functions. J. Combin. Theory, Ser. A 34, 255–265 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  6. Berlekamp, E.R.: Algebraic Coding Theory. McGraw Hill, New York (1968)

    MATH  Google Scholar 

  7. Blake, I.F., Fuji-Hara, R., Mullin, R.C., Vanstone, S.A.: Computing discrete logarithms in finite fields of characteristic two. SIAM J. Alg. Disc. Meth. 5, 276–285 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  8. Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM J. Comput. 13, 850–864 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Buchstab, A.A.: Asymptotic estimates of a general number theoretic function. Mat. Sbornik 44, 1239–1246 (1937)

    Google Scholar 

  10. Car, M.: Théorèmes de densité dans \(\mathbb{F}\) q [x]. Acta Arith. 48, 145–165 (1987)

    MATH  MathSciNet  Google Scholar 

  11. Carlitz, L.: The arithmetic of polynomials in a Galois field. Amer. J. Math. 54, 39–50 (1932)

    Article  MathSciNet  Google Scholar 

  12. Carlitz, L.: The distribution of irreducible polynomials in several indeterminates. Illinois J. Math. 7, 371–375 (1963)

    MATH  MathSciNet  Google Scholar 

  13. Carlitz, L.: The distribution of irreducible polynomials in several indeterminates II. Canad. J. Math. 17, 261–266 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  14. Cohen, S.D.: The distribution of irreducible polynomials in several indeterminates over a finite field. Proc. Edinburgh Math. Soc. 16, 1–17 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  15. Cohen, S.D.: The values of a polynomial over a finite field. Glasgow Math. J. 14, 205–208 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  16. Coppersmith, D.: Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Info. Theory 30, 587–594 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  17. de Bruijn, N.: On the number of positive integers ≤ x and free of prime factors > y. Indag. Math. 13, 2–12 (1951)

    Google Scholar 

  18. Dickman, K.: On the frequency of numbers containing prime factors of a certain relative magnitude. Ark. Mat. Astr. Fys. 22, 1–14 (1930)

    Google Scholar 

  19. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inform. Theory 22, 644–654 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  20. Drmota, M., Panario, D.: A rigorous proof of the Waterloo algorithm for the discrete logarithm problem. Designs, Codes and Cryptography 26, 229–241 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Info. Theory 31, 469–472 (1985)

    Article  MATH  Google Scholar 

  22. Evdokimov, S.A.: Factorization of polynomials over finite fields in subexponential time under GRH. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 209–219. Springer, Heidelberg (1994)

    Google Scholar 

  23. Finch, S.R.: Mathematical Constants. Encyclopedia of Mathematics and its Applications, vol. 94. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  24. Flajolet, P., Golin, M.: Mellin transform and asymptotics: the mergesort recurrence. Acta Inf. 31, 673–696 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  25. Flajolet, P., Gourdon, X., Panario, D.: The complete analysis of a polynomial factorization algorithm over finite fields. J. of Algorithms 40, 37–81 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  26. Flajolet, P., Odlyzko, A.: Singularity analysis of generating functions. SIAM J. of Disc. Math. 2, 216–240 (1990)

    Article  MathSciNet  Google Scholar 

  27. Flajolet, P., Sedgewick, R.: Analytic Combinatorics (in preparation), see: http://www.algo.inria.fr/flajolet/Publications/books.html

  28. Flajolet, P., Soria, M.: Gaussian limiting distributions for the number of components in combinatorial structures. J. of Combin. Theory, Ser. A 53, 165–182 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  29. Flajolet, P., Soria, M.: General combinatorial schemas: Gaussian limiting distributions and exponential tails. Discrete Math. 114, 159–180 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  30. Friesen, C., Hensley, D.: The statistics of continued fractions for polynomials over a finite field. Proc. Amer. Math. Soc. 124, 2661–2673 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  31. Gao, S.: On the deterministic complexity of polynomial factoring. Journal of Symbolic Computation 31, 19–36 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  32. Gao, S., von zur Gathen, J., Panario, D.: Gauss periods: orders and cryptographical applications. Math. Comp. 67, 343–352 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  33. Gao, S., Howell, J., Panario, D.: Irreducible polynomials of given forms. In: Mullin, R.C., Mullen, G.L. (eds.) Finite Fields: Theory, Applications, and Algorithms (Fourth International Conference on Finite Fields: Theory, Applications, and Algorithms). Contemporary Mathematics, vol. 225, pp. 43–54. American Mathematical Society (1999)

    Google Scholar 

  34. Gao, S., Lauder, A.: Hensel lifting and polynomial factorisation. Math. Comp. 71, 1663–1676 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  35. Gao, S., Panario, D.: Tests and constructions of irreducible polynomials over finite fields. In: Cucker, F., Shub, M. (eds.) Foundations of Computational Mathematics, pp. 346–361. Springer, Heidelberg (1997)

    Google Scholar 

  36. Gao, Z., Richmond, B.: Central and local limit theorems applied to asymptotic enumeration IV: multivariate generating functions. J. of Comput. Appl. Math. 41, 177–186 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  37. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  38. Garefalakis, T., Panario, D.: The index calculus method using non-smooth polynomials. Mathematics of Computation 70, 1253–1264 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  39. Garefalakis, T., Panario, D.: Polynomials over finite fields free from large and small degree irreducible factors. Journal of Algorithms 44, 98–120 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  40. von zur Gathen, J., Gerhard, J.: Polynomial factorization over \(\mathbb{F}\) 2. Math. Comp. 71, 1677–1698 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  41. von zur Gathen, J., Panario, D.: A survey on factoring polynomials over finite fields. Journal of Symbolic Computation 31, 3–17 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  42. von zur Gathen, J., Shoup, V.: Computing Frobenius maps and factoring polynomials. Comput complexity 2, 187–224 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  43. Gourdon, X.: Combinatoire, algorithmique et géométrie des polynômes. PhD thesis, École Polytechnique (1996)

    Google Scholar 

  44. Gourdon, X.: Largest component in random combinatorial structures. Discrete Math. 180, 185–209 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  45. Hayes, D.R.: The distribution of irreducibles in \(\mathbb{F}\) q [x]. Trans. American Math. Soc. 117, 101–127 (1965)

    MATH  MathSciNet  Google Scholar 

  46. Grabner, P., Heuberger, C., Prodinger, H., Thuswaldner, J.: Efficient linear combinations in elliptic curve cryptography (2003) (preprint)

    Google Scholar 

  47. Kaltofen, E., Shoup, V.: Subquadratic-time factoring of polynomials over finite fields. In: Proc. 27th ACM Symp. Theory of Computing, pp. 398–406 (1995)

    Google Scholar 

  48. Knopfmacher, J., Knopfmacher, A.: The exact length of the Euclidean algorithm in F q [X]. Mathematika 35, 297–304 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  49. Knopfmacher, A., Knopfmacher, J.: Counting polynomials with a given number of zeros in a finite field. Lin. and Multilin. Alg. 26, 287–292 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  50. Knopfmacher, J., Knopfmacher, A.: Counting irreducible factors of polynomials over a finite field. SIAM J. on Disc. Math. 112, 103–118 (1993)

    MATH  MathSciNet  Google Scholar 

  51. Knopfmacher, A., Warlimont, R.: Distinct degree factorizations for polynomials over a finite field. Trans. Amer. Math. Soc. 37, 2235–2243 (1995)

    Article  MathSciNet  Google Scholar 

  52. Knuth, D.E.: The Art of Computer Programming, 3rd edn. Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1997)

    Google Scholar 

  53. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications, 2nd edn. Encyclopedia of Mathematics and its Applications, vol. 20. Cambridge University Press, Cambridge (1994)

    MATH  Google Scholar 

  54. Ma, K., von zur Gathen, J.: Analysis of Euclidean algorithms for polynomials over finite fields. J. of Symb. Comp. 9, 429–455 (1990)

    Article  MATH  Google Scholar 

  55. Mignotte, M., Nicolas, J.L.: Statistiques sur \(\mathbb{F}\) q [x]. Ann. de l’Inst. Henri Poincaré 19, 113–121 (1983)

    MATH  MathSciNet  Google Scholar 

  56. Niederreiter, H.: Factoring polynomials over finite fields using differential equations and normal bases. Math. Comp. 62, 819–830 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  57. Odlyzko, A.: Discrete logarithms and their cryptographic significance. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 224–314. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  58. Odlyzko, A.: Asymptotic enumeration methods. In: Graham, R., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, vol. 2, pp. 1063–1229. Elsevier, Amsterdam (1995)

    Google Scholar 

  59. Panario, D., Pittel, B., Richmond, B., Viola, A.: Analysis of Rabin’s irreducibility test for polynomials over finite fields. Random Struct. Alg. 19, 525–551 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  60. Panario, D., Richmond, B.: Analysis of Ben-Or’s polynomial irreducibility test. Random Struct. Alg. 13, 439–456 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  61. Panario, D., Richmond, B.: Smallest components in decomposable structures: exp-log class. Algorithmica 29, 205–226 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  62. Panario, D., Richmond, B.: Exact largest and smallest size of components in decomposable structures. Algorithmica 31, 413–432 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  63. Rabin, M.O.: Probabilistic algorithms in finite fields. SIAM J. Comp. 9, 273–280 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  64. Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading (1996)

    MATH  Google Scholar 

  65. Shoup, V.: A new polynomial factorization algorithm and its implementation. J. Symb. Comp. 20, 363–397 (1996)

    Article  MathSciNet  Google Scholar 

  66. Uchiyama, S.: Note on the mean value of υ(f) II. Proc. Japan Acad. 31, 321–323 (1955)

    Article  MathSciNet  Google Scholar 

  67. Williams, K.S.: Polynomials with irreducible factors of specified degree. Canad. Math. Bull. 12, 221–223 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  68. Zsigmondy, K.: Über die Anzahl derjenigen ganzen ganzzahligen Functionen nten Grades von x , welche in Bezug auf einen gegebenen Primzahlmodul eine vorgeschriebene Anzahl von Wurzeln besitzen. Sitzungsber. Wien Abt II 103, 135–144 (1894)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Carleton University, Ottawa, K1S 5B6, Canada

    Daniel Panario

Authors
  1. Daniel Panario
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, The Pennsylvania State University, University Park, 16802, PA, USA

    Gary L. Mullen

  2. University Paul Sabatier, AAECC/IRIT, 118 route de Narbonne, 31300, Toulouse cedex, France

    Alain Poli

  3. Sabancı University - FENS, Orhanli - Tuzla, 34956, Istanbul, Turkey

    Henning Stichtenoth

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Panario, D. (2004). What Do Random Polynomials over Finite Fields Look Like?. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds) Finite Fields and Applications. Fq 2003. Lecture Notes in Computer Science, vol 2948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24633-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24633-6_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21324-6

  • Online ISBN: 978-3-540-24633-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation