Factoring Polynomials over Finite Fields

[1]  Igor E. Shparlinski,et al.  Computational and Algorithmic Problems in Finite Fields , 1992 .

[2]  Victor Shoup,et al.  Smoothness and Factoring Polynomials Over Finite Fields , 1991, Inf. Process. Lett..

[3]  D. Wan,et al.  Factoring multivariate polynomials over large finite fields , 1990 .

[4]  Victor Shoup.  On the Deterministic Complexity of Factoring Polynomials over Finite Fields , 1990, Inf. Process. Lett..

[5]  Lajos Rónyai,et al.  Factoring polynomials modulo special primes , 1989, Comb..

[6]  Paul C. van Oorschot,et al.  A geometric approach to root finding in GF(qm) , 1989, IEEE Trans. Inf. Theory.

[7]  Ronald L. Rivest,et al.  A knapsack-type public key cryptosystem based on arithmetic in finite fields , 1988, IEEE Trans. Inf. Theory.

[8]  Alfred Menezes,et al.  Some Computational Aspects of Root Finding in GF(qm) , 1988, ISSAC.

[9]  Lajos Rónyai,et al.  Factoring polynomials over finite fields , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  Joachim von zur Gathen,et al.  Factoring Polynomials and Primitive Elements for Special Primes , 1987, Theor. Comput. Sci..

[11]  Ming-Deh A. Huang.  Riemann hypothesis and finding roots over finite fields , 1985, STOC '85.

[12]  Joachim von zur Gathen,et al.  Irreducibility of Multivariate Polynomials , 1985, J. Comput. Syst. Sci..

[13]  J. Gathen,et al.  Factorization of multivariate polynomials over finite fields , 1985 .

[14]  Arjen K. Lenstra,et al.  Factoring multivariate polynomials over finite fields , 1983, J. Comput. Syst. Sci..

[15]  Erich Kaltofen,et al.  Factoring Sparse Multivariate Polynomials , 1983, J. Comput. Syst. Sci..

[16]  Paul Camion.  Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials , 1983, IEEE Trans. Inf. Theory.

[17]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[18]  Michael Ben-Or,et al.  Probabilistic algorithms in finite fields , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[19]  D. Cantor,et al.  A new algorithm for factoring polynomials over finite fields , 1981 .

[20]  Michael O. Rabin,et al.  Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..

[21]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[22]  E. Berlekamp.  Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[23]  H. Zassenhaus.  On Hensel factorization, I , 1969 .

[24]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[25]  Elwyn R. Berlekamp,et al.  On the Solution of Algebraic Equations over Finite Fields , 1967, Inf. Control..