Advertisement

An Alternate Construction of the Berlekamp Subalgebra

  • Greg Stein
Conference paper

Abstract

We give an alternate construction of the Berlekamp subalgebra for cyclotomic polynomials over finite fields. This gives a new, deterministic, polynomial time reduction of factoring these polynomials to knowing the trace of an appropriate root of unity.

Keywords

Finite Field Zero Divisor Coset Representative Alternate Construction Cyclotomic Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Bini and V. Pan, Polynomial and Matrix Computations, Birkhauser, Boston, (1994).Google Scholar
  2. 2.
    L.D. Bauwert and W.H. Mills, Uniform cyclotomy. Journal of Number Theory, [14], (1982), 67–82.MathSciNetCrossRefGoogle Scholar
  3. 3.
    L.E. Dickson, Cyclotomy, higher congruences, and Waring’s problem. Amer. J. Math., [57], (1935). 391–424.MathSciNetCrossRefGoogle Scholar
  4. 4.
    D. Jungnickel, Finite Fields, Wissenschaftsverlag, Mannheim, (1993).zbMATHGoogle Scholar
  5. 5.
    D. Knuth, The Art of Computer Programming, volume 2, Semi-numerical algorithms, 2nd ed., Addison-Wesley, Reading, (1981).Google Scholar
  6. 6.
    H. W. Lenstra, Jr., Finding isomorphims between finite fields. Math. Comp., [56], (1991), 329–347.MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    R. Lidl and H. Niederreiter, Finite Fields. Encyclopedia of Mathematics and its Applications, v. 20, Addison-Wesley, Reading, 1983.Google Scholar
  8. 8.
    R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications, revised edition, Cambridge University Press, Cambridge, 1994.Google Scholar
  9. 9.
    A. J. Menezes, ed., Applications of Finite Fields, Kluwer, Boston, (1993).zbMATHGoogle Scholar
  10. 10.
    G. Myerson, Period polynomials and Gauss sums for finite fields. Acta Arith., [39], (1981), 251–264.MathSciNetzbMATHGoogle Scholar
  11. 11.
    R. Schoof, Elliptic curves over finite fields and the computation of square roots modp. Math. Comp. [44], (1985), pp. 483–494.MathSciNetGoogle Scholar
  12. 12.
    V. Shoup, New algorithms for finding irreducible polynomials over finite fields. Math. Comp. [54], (1990), pp. 435–447.MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    C. Small, Arithmetic of Finite Fields, Marcel Dekker, New York, (1991).zbMATHGoogle Scholar
  14. 14.
    G. Stein, Factoring cyclotornic polynomials over large finite fields. Finite Fields and Applications, London Mathematical Society Lecture Note Series #233, S. Cohen & R. Niederrieter, eds., Cambridge University Press, pp. 349–354 (1996).Google Scholar
  15. 15.
    G. Stein, Traces of roots of unity over finite fields. Finite fields: theory. applications, and algorithms (Waterloo, ON, 1997 ) 113–121, Contemp. Math. 225, Amer. Math Soc., Providence R.I 1999.Google Scholar
  16. 16.
    G. Stein Using the theory of cyclotomy to factor cyclotornic polynomials over finite fields. Math. Comp. [70] (2001), no. 235, 1237–1251.MathSciNetGoogle Scholar
  17. 17.
    T. Storer, Cyclotomy and Difference Sets, Markham, Chicago, 1967.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Greg Stein
    • 1
  1. 1.City University of New YorkBrooklynUSA

Personalised recommendations