Basic HTML version of Foils prepared May 12 1996

Foil 6 RSA: Public Key Cryptosystem

From Lessons and Implementation -- RSA Factoring on the Web CRPC Annual Meeting -- May 14-17 1996. by Geoffrey Fox
1 RSA Security Systems built around numbers
2 RSA-N = Prime1 * Prime2
3 A Product of two large primes which are secret whereas "everybody" in principle is meant to be able to know public modulus RSAm which can be used by anybody to encrypt messages
4 Only the recipient is meant to be able to decrypt message using secret prime factor
5 Secrecy of the cryptosystem is that of the secret key
6 Secrecy of the secret key is no more than the factorization of the public modulus
in Table To:

© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Sun Dec 14 1997