Diffie-Hellman Key Exchange Color Mixing Example

Slides:



Advertisements
Similar presentations
The Diffie-Hellman Algorithm
Advertisements

Diffie-Hellman Diffie-Hellman is a public key distribution scheme First public-key type scheme, proposed in 1976.
Public Key Cryptography Nick Feamster CS 6262 Spring 2009.
1 390-Elliptic Curves and Elliptic Curve Cryptography Michael Karls.
What is Elliptic Curve Cryptography?
Public Key Algorithms …….. RAIT M. Chatterjee.
Elliptic Curve Cryptography (ECC) Mustafa Demirhan Bhaskar Anepu Ajit Kunjal.
Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.
CSE331: Introduction to Networks and Security Lecture 20 Fall 2002.
The Diffie-Hellman Algorithm Riley Lochridge April 11, 2003.
Srineeja Patlolla CS-555.  Discovered by Whitfield Diffie and Martin Hellman  “New Directions in Cryptography”
Cryptography and Network Security Chapter 10. Chapter 10 – Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture.
Diffie-Hellman Key Exchange
Public Key Model 8. Cryptography part 2.
Lecture 7b: The Diffie-Hellman Secret Sharing Scheme Wayne Patterson SYCS 653 Fall 2009.
Key Management and Diffie- Hellman Dr. Monther Aldwairi New York Institute of Technology- Amman Campus 12/3/2009 INCS 741: Cryptography 12/3/20091Dr. Monther.
1 Lecture 9 Public Key Cryptography Public Key Algorithms CIS CIS 5357 Network Security.
Cryptography and Network Security (CS435) Part Eight (Key Management)
Cryptography and Network Security Chapter 10 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Public Key Cryptography. symmetric key crypto requires sender, receiver know shared secret key Q: how to agree on key in first place (particularly if.
Key Exchange Methods Diffie-Hellman and RSA CPE 701 Research Case Study Derek Eiler | April 2012.
Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.
ECE509 Cyber Security : Concept, Theory, and Practice Key Management Spring 2014.
1 Chapter 10: Key Management in Public key cryptosystems Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Modified by Prof. M. Singhal,
Diffie-Hellman Key Exchange Color Mixing Example Rick Stroud 21 September 2015 CSCE 522.
Cryptography issues – elliptic curves Presented by Tom Nykiel.
Key Management Network Systems Security Mort Anvari.
1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.
CSCE 715: Network Systems Security Chin-Tser Huang University of South Carolina.
Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.
Introduction to Pubic Key Encryption CSCI 5857: Encoding and Encryption.
Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note:
Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.
Elgamal Public Key Encryption CSCI 5857: Encoding and Encryption.
Key Exchange in Systems VPN usually has two phases –Handshake protocol: key exchange between parties sets symmetric keys –Traffic protocol: communication.
Diffie-Hellman-Merkle Ramki Thurimella. 2 Key Exchange Protocol Establishing secret keys for N people Requires N(N-1)/2 separate keys This is a quadratic.
Public Key Cryptography
최신정보보호기술 경일대학교 사이버보안학과 김 현성.
Lesson 2-18 AP Computer Science Principles
CS480 Cryptography and Information Security
Asymmetric-Key Cryptography
Hash Functions Which of these problems is easier to solve:
CSCE 715: Network Systems Security
Key Exchange References: Applied Cryptography, Bruce Schneier
Networked Applications Lecture 5: The Key Problem & Asymmetric Cyphers
Public-Key Cryptography and RSA
RSA A public Key Algorithm.
Big Numbers: Mathematics and Internet Commerce
Group theory exercise.
Public Key Infrastructure
Diffie-Hellman Secure Key Exchange 1976.
Diffie-Hellman Key-Exchange Algorithm
Chapter 10: Key Management (Again) and other Public Key Systems
MSIT 543 Cryptography Concepts and Techniques Symmetric Key Encryption
Chapter 4 Cryptography / Encryption
Key Management Network Systems Security
Appendix 5: Cryptography p
CS 115: COMPUTING FOR The Socio-Techno Web
El Gamal and Diffie Hellman
Cryptography and Network Security Chapter 10
Diffie-Hellman key exchange/agreement algorithm
CSCE 715: Network Systems Security
El Gamal and Diffie Hellman
Introduction to Elliptic Curve Cryptography
CSCE 715: Network Systems Security
Asymmetric Cryptographic Algorithms
CSCE 715: Network Systems Security
Secure Diffie-Hellman Algorithm
Diffie-Hellman Algorithm
Campbell R. Harvey Duke University and NBER
Presentation transcript:

Diffie-Hellman Key Exchange Color Mixing Example Rick Stroud 21 September 2015 CSCE 522

The Problem of Key Exchange One of the main problems of symmetric key encryption is it requires a secure & reliable channel for the shared key exchange. The Diffie-Hellman Key Exchange protocol offers a way in which a public channel can be used to create a confidential shared key.

Modular what? In practice the shared encryption key relies on such complex concepts as Modular Exponentiation, Primitive Roots and Discrete Logarithm Problems. Let’s see though is we can explain the Diffie-Hellman algorithm with no complex mathematics.

A Difficult One-Way Problem The first thing we require is a simple real-world operation that is easy to Do but hard to Undo. You can ring a bell but not unring one. Toothpaste is easy to squeeze out of a tube but famously hard to put back in. In our example we will use Mixing Colors. Easy to mix 2 colors, hard to unmix

Alice & Bob with Eve listening wish to make a secret shared color

Step 1 - Both publicly agree to a shared color In step 1 Alice & Bob publicly agree on a shared color. Notice as this is public that Eve is privy to the information as well. In our example we will select Yellow as the shared color.

Step 2 - Each picks a secret color In step 2 each Alice & Bob select a secret color. Neither knows of the other’s secret color as it is not shared. Because they are not shared Eve has no opportunity to learn either’s secret color. In our example Alice selects Orange for her secret color & Bob selects Teal for his secret color.

Step 3 - Each adds their secret color to the shared color In step 3 each takes their secret color and mixes it with the shared color. In our example, to the shared Yellow: Alice mixes her secret Orange to produce a Peach Bob mixes his secret Teal to produce a Light blue

Step 4 - Each sends the other their new mixed color In step 4 each shares their mixture with the other. Notice because the channel for sharing is not secure that Eve now knows the mixtures of each Alice & Bob. Eve also knows the previously shared component of each mixture, Yellow, but not the secret color added by each.

Each combines the shared color from the other with their own secret color And finally in step 5 the magic happens. Each Alice & Bob combine the mixture received from the other with their own secret color. This produces a new and identical mixture for each. Notice without access to the secret color of either Alice or Bob that Eve is unable to perform this step.

Alice & Bob have agreed to a shared color unknown to Eve How is it that Alice & Bob’s final mixtures are identical? Alice mixed [(Yellow + Teal) from Bob] + Orange Bob mixed [(Yellow + Orange) from Alice] + Teal Alice & Bob only performed the easy & trivial task of mixing colors. Eve has no knowledge of the secret colors used by each Alice & Bob. Eve is left with the difficult problem of unmixing colors.

Alice & Bob have agreed to a shared color unknown to Eve How is it that Alice & Bob’s final mixture is secret? Eve never has knowledge of the secret colors of either Alice or Bob Unmixing a color into its component colors is a hard problem

Alice & Bob have agreed to a shared color unknown to Eve How is it that Alice & Bob’s final mixture is secret? Eve never has knowledge of the secret colors of either Alice or Bob Unmixing a color into its component colors is a hard problem