Bibliography

  • [Tra76]
    Conference

    Algebraic factoring and rational function integration

    Barry M. Trager

    In Proc. SYMSAC '76pp. 196–2081976
  • [LLL82]
    Article

    Factoring polynomials with rational coefficients

    Arjen K. Lenstra, Hendrik W. Lenstra, László Lovász

    Mathematische AnnalenVol. 261pp. 515–5341982
  • [CGG89]
    Article

    GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation

    Bruce W. Char, Keith O. Geddes, Gaston H. Gonnet

    J. Symbolic Comp.Vol. 7(1)pp. 31–481989
  • [PZ89]
    Book

    Algorithmic Algebraic Number Theory

    Michael E. Pohst, Hans Zassenhaus

    Cambridge University Press1989
  • [GCL92]
    Book

    Algorithms for Computer Algebra

    Keith O. Geddes, Stephen R. Czapor, George Labahn

    Kluwer1992
  • [vzGS92]
    Article

    Computing Frobenius Maps And Factoring Polynomials

    Joachim von zur Gathen, Victor Shoup

    Computational ComplexityVol. 2pp. 187–2241992
  • [Coh93]
    Book

    A Course in Computational Algebraic Number Theory

    Henri Cohen

    SpringerVol. 1381993
  • [KS95]
    Conference

    Subquadratic-time factoring of polynomials over finite fields

    Erich Kaltofen, Victor Shoup

    In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computingpp. 398–4061995
  • [Sho95b]
    Article

    A New Polynomial Factorization Algorithm and its Implementation

    Victor Shoup

    J. Symbolic Comp.Vol. 20(4)pp. 363–3971995
  • [Cop96]
    Book Chapter

    Finding a small root of a univariate modular equation

    Don Coppersmith

    In Advances in Cryptology---EuroCrypt 1996Vol. 1070pp. 155–1651996
  • [Knu97]
    Book

    The Art of Computer Programming

    Donald E. Knuth

    Addison WesleyVol. 21997
  • [vzGG99]
    Book

    Modern Computer Algebra

    Joachim von zur Gathen, Jürgen Gerhard

    Cambridge University Press1999
  • [vH01]
    Conference

    Factoring Polynomials and 0-1 vectors

    Mark van Hoeij

    In Proceedings of the Cryptography and Lattices Conference (CaLC 2001), Brown University, Providence, RI, USA, March 29-30, 2001pp. 142–1462001
  • [vH02]
    Article

    Factoring Polynomials and the knapsack problem

    Mark van Hoeij

    J. Number Th.Vol. 95(2)pp. 167–1892002
  • [May03]
    PhD Thesis

    New RSA Vulnerabilities Using Lattice Reduction Methods

    Alexander May

    University of Paderborn2003
  • [Ste05]
    Article

    Conquering Inseparability: Primary Decomposition and Multivariate Factorization over Algebraic Function Fields of Positive Characteristic

    Allan Steel

    J. Symbolic Comp.Vol. 40(3)pp. 1053–10752005
  • [ACvHS17]
    Conference

    Functional Decomposition using Principal Subfields

    DOI

    Emilio Allem, Juliane Capaverde, Mark van Hoeij, Jonas Szutkoski

    In ISSAC '17, July 25-28, 2017, Kaiserslautern, Germany2017

    accepted