Bibliography

ACvHS17
Emilio Allem, Juliane Capaverde, Mark van Hoeij, and Jonas Szutkoski.
Functional Decomposition using Principal Subfields.
In ISSAC '17, July 25-28, 2017, Kaiserslautern, Germany. ACM, 2017.
accepted.

CGG89
Bruce W. Char, Keith O. Geddes, and Gaston H. Gonnet.
GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation.
J. Symbolic Comp., 7(1):31--48, 1989.

Coh93
Henri Cohen.
A Course in Computational Algebraic Number Theory, volume 138 of Graduate Texts in Mathematics.
Springer, Berlin--Heidelberg--New York, 1993.

Cop96
Don Coppersmith.
Finding a small root of a univariate modular equation.
In Advances in Cryptology---EuroCrypt 1996, volume 1070 of LNCS, pages 155--165. Springer, 1996.

GCL92
Keith O. Geddes, Stephen R. Czapor, and George Labahn.
Algorithms for Computer Algebra.
Kluwer, Boston/Dordrecht/London, 1992.

Knu97
Donald E. Knuth.
The Art of Computer Programming, volume 2.
Addison Wesley, Reading, Massachusetts, 3rd edition, 1997.

KS95
Erich Kaltofen and Victor Shoup.
Subquadratic-time factoring of polynomials over finite fields.
In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, pages 398--406. ACM, 1995.

LLL82
Arjen K. Lenstra, Hendrik W. Lenstra, and László Lovász.
Factoring polynomials with rational coefficients.
Mathematische Annalen, 261:515--534, 1982.

May03
Alexander May.
New RSA Vulnerabilities Using Lattice Reduction Methods.
Dissertation, University of Paderborn, 2003.

PZ89
Michael E. Pohst and Hans Zassenhaus.
Algorithmic Algebraic Number Theory.
Encyclopaedia of mathematics and its applications. Cambridge University Press, Cambridge, 1989.

Sho95
Victor Shoup.
A New Polynomial Factorization Algorithm and its Im-ple-men-ta-tion.
J. Symbolic Comp., 20(4):363--397, 1995.

Ste05
Allan Steel.
Conquering Inseparability: Primary Decomposition and Multivariate Factorization over Algebraic Function Fields of Positive Characteristic.
J. Symbolic Comp., 40(3):1053--1075, 2005.

Tra76
Barry M. Trager.
Algebraic factoring and rational function integration.
In R.D. Jenks, editor, Proc. SYMSAC '76, pages 196--208. ACM press, 1976.

vH01
Mark van Hoeij.
Factoring Polynomials and 0-1 vectors.
In Proceedings of the Cryptography and Lattices Conference (CaLC 2001), Brown University, Providence, RI, USA, March 29-30, 2001, pages 142--146. Springer, 2001.

vH02
Mark van Hoeij.
Factoring Polynomials and the knapsack problem.
J. Number Th., 95(2):167--189, 2002.
http://www.math.fsu.edu/~hoeij/paper/knapsack.ps.

vzGG99
Joachim von zur Gathen and Jürgen Gerhard.
Modern Computer Algebra.
Cambridge University Press, Cambridge, 1999.

vzGS92
Joachim von zur Gathen and Victor Shoup.
Computing Frobenius Maps And Factoring Polynomials.
Computational Complexity, 2:187--224, 1992.

V2.28, 13 July 2023