NETWORK SECURITY TACTICS
Diffie-Hellman key exchange
Mike Chapple, CISSP
01.23.2003
Rating: -4.00- (out of 5)
|
If you've had any experience choosing a cryptographic algorithm, you've probably faced a common dilemma at one time or another: should you use an asymmetric (public key) or symmetric (private key) algorithm?
From a key exchange point-of-view, public key algorithms are much simpler to administer. Users may freely share their public keys over insecure transmission channels without fear of compromising the cryptosystem. In order for pure private key systems to remain truly secure, offline key exchange techniques (such as a floppy diskette) must be used. On the other hand, symmetric algorithms generally operate much faster than their asymmetric counterparts.
Diffie-Hellman key exchange offers the best of both worlds -- it uses public key techniques to allow the exchange of a private encryption key! Let's take a look at how the protocol works, from the perspective of Alice and Bob, two users who wish to establish secure communications. We can assume that Alice and Bob know nothing about each other but are in contact. Here are the nine steps of the process:
- Communicating in the clear, Alice and Bob agree on two large positive integers, n and g, with the stipulation that n is a prime number and g is a generator of n.
- Alice randomly chooses another large positive integer, XA, which is smaller than n. XA will serve as Alice's private key.
- Bob similarly chooses his own private key, XB.
- Alice computes her public key, YA, using the formula YA = (g^XA) mod n.
- Bob similarly computes his public key, YB, using the formula YB = (g^XB) mod n.
- Alice and Bob exchange public keys over the insecure circuit.
- Alice computes the shared secret key, k, using the formula k = (YB ^XA) mod n.
- Bob computes the same shared secret key, k, using the formula k = (YA ^XB) mod n.
- Alice and Bob communicate using the symmetric algorithm of their choice and the shared secret key, k, which was never transmitted over the insecure circuit.
Pretty nifty, eh? Diffie-Hellman key exchange is actually nothing new. It's been around since Whitfield Diffie and Martin Hellman published it in their 1976 paper, "New Directions in Cryptography." However, the recent surge of interest in cryptography and secure communications have increased awareness of the protocol. In fact, you've probably unknowingly used the Diffie-Hellman protocol on a daily basis. It's used by popular protocols like SSL and SSH.
About the author
Mike Chapple, CISSP, currently serves as Chief Information Officer of the
Brand Institute, a Miami-based marketing consultancy. He previously worked
as an information security researcher for the U.S. National Security Agency.
His publishing credits include the TICSA Training Guide from Que Publishing,
the CISSP Study Guide from Sybex and the upcoming SANS GSEC Prep Guide from
John Wiley. He's also the About.com Guide to Databases.
|
|
Rate this Tip
|
To rate tips, you must be a member of SearchSecurity.com.
Register now
to start rating these tips. Log in if you are already a member.
|
Submit a Tip
|
DISCLAIMER: Our Tips Exchange is a forum for you to share technical advice and expertise with your peers and to learn from other enterprise IT professionals. TechTarget provides the infrastructure to facilitate this sharing of information. However, we cannot guarantee the accuracy or validity of the material submitted. You agree that your use of the Ask The Expert services and your reliance on any questions, answers, information or other materials received through this Web site is at your own risk.
|
|
|
|
|
|
|
