Dissertation/Thesis Abstract

Factorization via the Chinese Remainder Theorem: Computational methods to enhance rapid key processing and decryption
by Hines, Steven T., M.S.C.S., California State University, Long Beach, 2012, 82; 1522231
Abstract (Summary)

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.

Indexing (document details)
Advisor: Englert, Burkhard
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
Subjects: Computer science
Publication Number: 1522231
ISBN: 978-1-267-97718-2
Copyright © 2021 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy