Bibliography
- [ACvHS17]Conference
Functional Decomposition using Principal Subfields.
In ISSAC '17, July 25-28, 2017, Kaiserslautern, Germany. ACM, 2017.accepted.
Cited in 1 page
- [CGG89]Article
GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation.
J. Symbolic Comp., 7(1):31–48, 1989. - [Coh93]Book
A Course in Computational Algebraic Number Theory, volume 138 of Graduate Texts in Mathematics.
Springer, Berlin–Heidelberg–New York, 1993. - [Cop96]Book Chapter
Finding a small root of a univariate modular equation.
In Advances in Cryptology—EuroCrypt 1996, volume 1070 of LNCS, pages 155–165. Springer, 1996.Cited in 1 page
- [GCL92]Book
Algorithms for Computer Algebra.
Kluwer, Boston/Dordrecht/London, 1992. - [Knu97]Book
The Art of Computer Programming, volume 2.
Addison Wesley, Reading, Massachusetts, 3rd edition, 1997.Cited in 1 page
- [KS95]Conference
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.Cited in 1 page
- [LLL82]Article
Factoring polynomials with rational coefficients.
Mathematische Annalen, 261:515–534, 1982.Cited in 2 pages
- [May03]PhD Thesis
New RSA Vulnerabilities Using Lattice Reduction Methods.
Dissertation, University of Paderborn, 2003.Cited in 1 page
- [PZ89]Book
Algorithmic Algebraic Number Theory.
Encyclopaedia of mathematics and its applications. Cambridge University Press, Cambridge, 1989. - [Sho95b]Article
A New Polynomial Factorization Algorithm and its Implementation.
J. Symbolic Comp., 20(4):363–397, 1995.Cited in 1 page
- [Ste05]Article
Conquering Inseparability: Primary Decomposition and Multivariate Factorization over Algebraic Function Fields of Positive Characteristic.
J. Symbolic Comp., 40(3):1053–1075, 2005.Cited in 1 page
- [Tra76]Conference
Algebraic factoring and rational function integration.
In R. D. Jenks, editor, Proc. SYMSAC '76, pages 196–208. ACM press, 1976.Cited in 1 page
- [vH01]Conference
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.Cited in 1 page
- [vH02]Article
Factoring Polynomials and the knapsack problem.
J. Number Th., 95(2):167–189, 2002.http://www.math.fsu.edu/~hoeij/paper/knapsack.ps.
Cited in 1 page
- [vzGG99]Book
Modern Computer Algebra.
Cambridge University Press, Cambridge, 1999. - [vzGS92]Article
Computing Frobenius Maps And Factoring Polynomials.
Computational Complexity, 2:187–224, 1992.Cited in 1 page