Honors Theses

Date of Award

2007

Document Type

Undergraduate Thesis

Department

English

First Advisor

Kathryn McKee

Relational Format

Dissertation/Thesis

Abstract

In this paper we present the mathematical methods necessary to utilize the Rivest. Shamir, and Adleman (RSA) cryptosystem. Beginning witn the Divi sion Theorem and an introduction to modular arithmetic we then delve brieflv into group theory, leading up to our presentation of LaGrange’s Theorem. Next we prove Fermat’s Little Theorem, Wilson's Theorem, and Euler's Theorem. arriving at a definition and explanation of the RSA method. We conclude this paper with a short discussion of prime generating techniques, focusing our attention on Pocklington’s prime determination method.

Accessibility Status

Searchable text

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.