Deterministic versus probabilistic factorization of integral polynomials

  • Jacques Calmet
  • Rüdiger Loos
4. Algorithms II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 144)


We have shown that the Cantor-Zassenhaus probabilistic step to find a factor over GF(p) of a polynomial being the product of equal degree factors takes O(n3L2(p)Lβ(p)2) units of time. This is, using classical arithmetic, the cost in Rabin's algorithm to find a root of an irreducible factor of degree d in the extension field GF(pd). The constants involved in Rabin's algorithm seem to be higher than in the simple Cantor-Zassenhaus test, which is the most promising candidate of a probabilistic algorithmic to be compared with the deterministic Berlekamp-Hensel algorithm. A careful analysis, backed up by measurements using current technology in computer algebra, demonstrates that the time has not yet come to beat Berlekamp-Hensel. This is mainly due to the cost of exponentiation both in Berlekamp's Q-matrix and in the probabilistic test of Cantor-Zassenhaus which makes both algorithms for large primes intractable. In contradistinction : the restriction of the Berlekamp-Hensel algorithm to small primes is computationally its greatest strength.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [1]
    S. SCHWARZ, Quart. J. Math., Oxford (2) 7 (1956), 110–124Google Scholar
  2. [2]
    E.R. BERLEKAMP, Bell System Technical J. 46 (1967), 1853–59Google Scholar
  3. [3]
    M. RABIN, SIAM J. Computing 9 (1980), 227–280CrossRefGoogle Scholar
  4. [4]
    D.G. CANTOR and H. ZASSENHAUS, Math. Comp., 36 (1981) 587–592Google Scholar
  5. [5]
    G.E. COLLINS, Springer Lecture Notes in Comp. Science, 33 (Berlin 1975), 134–183Google Scholar
  6. [6]
    D. ARNON, PhD Thesis, Madison 1981Google Scholar
  7. [7]
    D.E. KNUTH, The Art of Computer Programming, vol. 2, Second Edition, Addison Wesley, 1981Google Scholar
  8. [8]
    P. CAMION, C.R. Acad. Sc. Paris, t. 291 (20 octobre 1980), Série A-479-482Google Scholar
  9. [9]
    D.R. MUSSER, JACM 22 (1975), 291–308CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Jacques Calmet
    • 1
  • Rüdiger Loos
    • 2
  1. 1.IMAG GrenobleFrance
  2. 2.Universität KarlsruheGermany

Personalised recommendations