On using primes for public key encryptio
โ
E.Dennis Huthnance; Joe Warndof
๐
Article
๐
1988
๐
Elsevier Science
๐
English
โ 221 KB
It is shown that the popular RSA public key encryption scheme does not require two primes but that probable primes may be used instead. A method for finding probable primes is given and the security of systems based on probable primes is discussed.