DiffieHellmanNotes - Diffie-Hellman Key Exchange Motivation...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Diffie-Hellman Key Exchange Motivation for Key Exchange Algorithm The fastest encryption schemes are symmetric encryption schemes. In order to use these, the two communicators (Alice & Bob) would have to meet in a secure location. BUT, this sort of defeats the purpose, because their whole goal is to communicate when securely when they aren't in the same place. A modern day example of why it would be useful to exchange a key without meeting deals with an online purchase. You are making the purchase online so that you DON'T have to go to the store to meet with the vendor. So, you don't really want to go to the store to just exchange a secret key either. You want to be able to do that from the comfort of your own home. Thus, that is the underlying problem: how do two users exchange a secret key without a secure communication channel? The first solution to this problem was the Diffie-Hellman Key Exchange. What's interesting about this algorithm is that neither user actually gets to choose the key. But, at the end of the algorithm, both users have calculated the same key, which is not easy for
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/04/2011 for the course CIS 3360 taught by Professor Guha during the Fall '06 term at University of Central Florida.

Page1 / 3

DiffieHellmanNotes - Diffie-Hellman Key Exchange Motivation...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online