The Use of Prime Numbers as an Effective Method of Cryptology
With the increasing amount of information transmitted over networks, there is a need to be able to keep this information from falling into the wrong hands. The method that has been used for the past couple of decades is that of cryptography. This paper gives an explanation of cryptography, as well as different alogorithms that are used to solve the problem. One unique thing about a couple of the algorithms is that they use properties provided by prime numbers. In particular, the RSA model, invented by Rivest, Shamir and Adelman, is one model which utilizes the theory that it is hard to determine prime factors of large numbers. Even though RSA provides a high level of security, there are also methods which can be used to break it. There are also programming issues to consider when implementing the RSA model. Source code in C++ is provided.Project Title: "The Evolution of the Stock Market as a Financial Institution."
Flynn, Joshua, "The Use of Prime Numbers as an Effective Method of Cryptology" (1997). Honors Theses. 592.
This document is currently not available here.