Next:
The Diffie-Hellman key exchange
Up:
Notes on Cryptography
Previous:
Proof of Theorem 5
Encryption techniques based on powers and congruences
The Diffie-Hellman key exchange procedure
The Rivest-Shamir-Adleman public key system
A public key system as hard as factoring
Computing square roots modulo a prime
Translated from LaTeX by Scott Sutherland
1998-03-15
