Masters Theses

Date of Award

5-1991

Degree Type

Thesis

Degree Name

Master of Science

Major

Computer Science

Major Professor

David Straight

Abstract

In this thesis, some suggested improvements are made to the RSA scheme of Rivest, Shamir, and Adieman. In particular, it is suggested that the "primes", p , be selected using pseudoprimality testing with tests for small factors of p -1 and p + 1 as opposed to the Solovay-Strassen or Rabin Tests. This requires additional greatest common divisor tests. It is also suggested that the Euler function Φ(n) be replaced by the Carmichael function λ(n) (or its generalization L(n)) in the production of encryption and decryption keys. In addition, further greatest common divisor tests are proposed when encoding to increase security.

Files over 3MB may be slow to open. For best results, right-click and select "save as..."

Share

COinS