Classic Cryptography

Key-Based Encryption
 
Symmetrical Key
  Assymetrical Key
  RSA
  IDEA, RC2 and RC4
  DES
  Pretty Good Privacy
   (PGP)

  How public key works
   mathematically


  Glossary
    Basic Concepts in Data Encryption:
Key-Based Encryption


ASSYMETRICAL KEY

Development of Asymmetrical Key Encryption

Fall of 1975, two researchers at Stanford University studying electrical engineering, Whitfield Diffie and Martin Hellman, wrote a paper called "Multi-User Cryptographic Techniques", which outlined a new key exchange system. The premise of the system was that it was possible to create a multi-user cryptography system in which a message could be encrypted with one key, and decrypted with another. What? You ask? Two keys, one to encrypt, one to decrypt. The Diffie-Hellman paper didn’t propose a workable system at the time, but was written for the National Computer Conference in 1976, and was sent to others working in the field. Now before we get into the mathematics, realize that we are leaving ciphers and encryption. These mathematics concern key exchange, and you might need to read it twice.

Donald Knuth, a colleague of Diffie’s and Hellman’s at the Stanford computer science department observed that it is easy to multiply a pair of prime numbers, but can be very difficult to factor the result, this approach was not used by Diffie, but found use later at MIT. John Gill, another Stanford colleague, also suggested that Diffie explore discrete exponentiation, or the calculating exponents of numbers in a modular arithmetic field, because the inverse problem, or taking discrete logarithms, was very difficult, Diffie decided to pursue a solution with Hellman.

May of 1976, Diffie received a call from Hellman who explained the idea of exponential key exchanged, which has since become known as the Diffie-Hellman key exchange. Their definitive paper was titled, "New Directions in Cryptography," and was published in the IEEE Transactions on Information Theory. For a brief explanation of this incredibly simple process, see How public key works mathematically.


Copyright ©1999 ThinkQuest Team 27158 — Developed for ThinkQuest 1999