Computer Science Department
School of Computer Science, Carnegie Mellon University


Factoring Polynomials Modulo Composites

Adam R. Klivans

May 1997

Submitted in partial fulfillment of the requirements for the degree of
Master of Science (Honors Degree Program)
Department of Mathematics, Carnegie Mellon University.

Keywords: Computational algebra, circuit complexity theory, factoring polynomials

Motivated by questions in circuit complexity, this paper characterizes all the factorizations of a polynomial with coefficients in the ring Zn where n is a composite number. We give algorithms to compute such factorizations along with the algebraic classifications.

38 pages

Return to: SCS Technical Report Collection
School of Computer Science homepage

This page maintained by