by Victor Shoup
Inform. Process. Lett
http://www.shoup.net/papers/detfac.ps.Z
Add To MetaCart
Abstract:
Abstract. We present a new deterministic algorithm for factoring polynomials over Z p of degree n. We show that the worst-case running time of our algorithm is O(p
Citations
|
2005
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
107
|
Factoring polynomials over large finite fields
– Berlekamp
- 1970
|
|
91
|
On fast multiplication of polynomials over arbitrary algebras
– Cantor, Kaltofen
- 1991
|
|
82
|
Computational Complexity of Algebraic and Numeric Problems
– Borodin, Munro
- 1975
|
|
73
|
A new algorithm for factoring polynomials over finite fields
– Cantor, Zassenhaus
- 1981
|
|
68
|
Probabilistic algorithms in finite fields
– RABIN
- 1980
|
|
40
|
Schnelle Multiplikation von Polynomen über Körpern der Charakteristik
– Schönhage
|
|
38
|
Probabilistic algorithms in finite fields
– BEN-OR
- 1981
|
|
23
|
Realistic analysis of some randomized algorithms
– Bach
- 1987
|
|
17
|
Analysis of a simple factorization algorithm
– Knuth, Pardo
- 1976
|
|
9
|
Factoring univariate integral polynomials in polynomial average time
– Collins
- 1979
|
|
6
|
Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
– Camion
- 1983
|
|
3
|
Matrix multiplication via Behrend's method
– Coppersmith, Winograd
- 1987
|
|
3
|
On the distribution of running times of certain integer factoring algorithms
– Hafner, McCurley
- 1987
|
|
2
|
Factoring polynomials using fewer random bits
– Bach, Shoup
- 1990
|
|
1
|
zur Gathen. "Factoring polynomials and primitive elements for special primes
– von
- 1987
|
|
1
|
Equations over Finite Fields, Springer-Verlag
– Schmidt
- 1976
|
