In this thesis we present the elements of factoring multiple-precision integers, implemented in the C programming language. We investigate two methods of factorization, Fermat factorization and Pollard's rho method. We explore the Chinese Remainder Theorem to understand how modular arithmetic is used, and relate this to the utilization of threads in parallel processing for factorization, and further relate these to operating systems threading principles to demonstrate the advantageous utilization of concurrent threads. In particular we utilize the Portable Operating Systems Interface for Unix (POSIX) pthreads Application Programming Interface (API) to illustrate parallel processing and thread control, which are applicable to the factorization of multiple-precision integers. We finally relate these computational methods developed to encryption and decryption processes involved in Rivest-Shamir-Adleman (RSA) cryptography.
|Commitee:||Ebert, Todd, Konig, Verne|
|School:||California State University, Long Beach|
|Department:||Computer Engineering and Computer Science|
|School Location:||United States -- California|
|Source:||MAI 51/05M(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