The Pseudo-RSA scheme : a suggested improvement to the RSA cryptography scheme

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.