Basic HTML version of Foils prepared May 30 99

Foil 11 Public Key Cryptography

From Basic Mathematics of Security Systems CPS714 Computational Science Information Track -- June 2 99. by Geoffrey C. Fox


1 This is much younger than other approaches and was first published in 1975. As we have discussed this has distinctive feature of only needing one key per individual/organization requiring encrypted authenticated messaging
2 It has nontrivial infrastructure to distribute the N public keys for N organizations but this is better than N2 keys for secret key cryptography
3 Roughly the public key is a very large number that is the product of two primes. The private key is (related to) one of these primes.
4 It is used differently in two cases which following foils do in detail
  • Transmission over insecure network where one encodes with public key of receiver (and receiver decodes with his or her private key)
  • Authentication where you encode your digital signature with your private key and receiver checks the signature with your public key -- only you can encode signature so it is correctly decoded with public key

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 May 30 1999