The factorization of polynomials is a classical mathematical question. The quest of finding the factorization of a polynomial modulo a prime is of interest for problems in computer science, algebraic number theory and cryptology. For example, in computer science, it is used in analyzing in geometric optimization problems. In algebraic number theory, it determined the factorization of integers. In cryptology, it is used for computing key parameters of cryptosystems. With the advent of high speed computers, the twentieth century saw the development of various techniques for this task with the goal of accomplishing the factorization in a minimal amount of time and with maximal efficiency.
In this thesis, we first consider the factorization of the special polynomials, xn – 1. We establish results about the degrees and the number of irreducible factors. We then discuss some algorithms developed by Berlekamp, Zassenhaus, Shoup and others for factorizing arbitrary polynomials.
|School:||California State University, Long Beach|
|School Location:||United States -- California|
|Source:||MAI 51/01M(E), Masters Abstracts International|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be