Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note:

Slides:

Advertisements

Similar presentations

Diffie-Hellman Diffie-Hellman is a public key distribution scheme First public-key type scheme, proposed in 1976.

Advertisements

7. Asymmetric encryption-

Cryptography and Network Security Chapter 10

Public Key Algorithms …….. RAIT M. Chatterjee.

Cryptography1 CPSC 3730 Cryptography Chapter 10 Key Management.

Dr. Lo’ai Tawalbeh Fall 2005 Chapter 10 – Key Management; Other Public Key Cryptosystems Dr. Lo’ai Tawalbeh Computer Engineering Department Jordan University.

Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings.

Chapter3 Public-Key Cryptography and Message Authentication.

1 Pertemuan 08 Public Key Cryptography Matakuliah: H0242 / Keamanan Jaringan Tahun: 2006 Versi: 1.

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

Network Security Essentials Chapter 3

Computer Science Public Key Management Lecture 5.

Introduction to Public Key Cryptography

Public Key Model 8. Cryptography part 2.

1 CIS 5371 Cryptography 8. Asymmetric encryption-.

Information Security and Management 13. Digital Signatures and Authentication Protocols Chih-Hung Wang Fall

Page 1 Secure Communication Paul Krzyzanowski Distributed Systems Except as otherwise noted, the content of this presentation.

Lecture slides prepared for “Computer Security: Principles and Practice”, 2/e, by William Stallings and Lawrie Brown, Chapter 21 “Public-Key Cryptography.

Lecture 7b: The Diffie-Hellman Secret Sharing Scheme Wayne Patterson SYCS 653 Fall 2009.

J. Wang. Computer Network Security Theory and Practice. Springer 2008 Chapter 3 Public-Key Cryptography and Key Management.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

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.

Applied Cryptography (Public Key) RSA. Public Key Cryptography Every Egyptian received two names, which were known respectively as the true name and the.

Information Security Principles & Applications

Cyrtographic Security Identity-based Encryption 1Dennis Kafura – CS5204 – Operating Systems.

1 Lecture 9 Public Key Cryptography Public Key Algorithms CIS CIS 5357 Network Security.

Network Security Essentials Chapter 3 Fourth Edition by William Stallings (Based on Lecture slides by Lawrie Brown)

Chapter 21 Public-Key Cryptography and Message Authentication.

Private-Key Cryptography  traditional private/secret/single key cryptography uses one key  shared by both sender and receiver  if this key is disclosed.

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.

PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.

Chapter 3 (B) – Key Management; Other Public Key Cryptosystems.

Cryptography and Network Security Chapter 10

Cryptography and Network Security Key Management and Other Public Key Cryptosystems.

PUBLIC KEY CRYPTOGRAPHY ALGORITHM Concept and Example 1IT352 | Network Security |Najwa AlGhamdi.

ECE509 Cyber Security : Concept, Theory, and Practice Key Management Spring 2014.

Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.

1 Chapter 10: Key Management in Public key cryptosystems Fourth Edition by William Stallings Lecture slides by Lawrie Brown (Modified by Prof. M. Singhal,

Public Key Algorithms Lesson Introduction ●Modular arithmetic ●RSA ●Diffie-Hellman.

CS 4803 Fall 04 Public Key Algorithms. Modular Arithmetic n Public key algorithms are based on modular arithmetic. n Modular addition. n Modular multiplication.

Key Management Network Systems Security Mort Anvari.

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

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.

Lecture 9 Overview. Digital Signature Properties CS 450/650 Lecture 9: Digital Signatures 2 Unforgeable: Only the signer can produce his/her signature.

Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Lecture slides by Lawrie Brown.

1 Chapter 3-3 Key Distribution. 2 Key Management public-key encryption helps address key distribution problems have two aspects of this: –distribution.

CIM3681: PKI 02 - Key Management1 Key Management Ch 10 of Cryptography and Network Security Third Edition by William Stallings Modified from lecture slides.

1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.

Information Security and Management 10. Other Public-key Cryptosystems Chih-Hung Wang Fall

CST 312 Pablo Breuer.  First published public-key algorithm  A number of commercial products employ this key exchange technique  Purpose is to enable.

Cryptography and Network Security Chapter 10 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

Key Management public-key encryption helps address key distribution problems have two aspects of this: – distribution of public keys – use of public-key.

Cryptography and Network Security Chapter 13

Information Security Lab. Dept. of Computer Engineering 251/ 278 PART II Asymmetric Ciphers Key Management; Other CHAPTER 10 Key Management; Other Public.

Dr. Nermin Hamza.  “Encryption is easy. Key management is hard. Really hard.  The difficulty arises not from the complexity of keys and encryption schemes,

Chapter 10 – Key Management; Other Public Key Cryptosystems

Chapter 10: Key Management (Again) and other Public Key Systems

Public-Key Cryptography and Message Authentication

Diffie-Hellman Key Exchange

Key Management Network Systems Security

Cryptography and Network Security Chapter 10

CSCE 715: Network Systems Security

CSCE 715: Network Systems Security

Key Exchange, Man-in-the-Middle Attack

Diffie-Hellman Algorithm

Presentation transcript:

Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note: now know that Williamson (UK CESG) secretly proposed the concept in 1970 is a practical method for public exchange of a secret key used in a number of commercial products

Diffie-Hellman Key Exchange a public-key distribution scheme – cannot be used to exchange an arbitrary message – rather it can establish a common key – known only to the two participants value of key depends on the participants (and their private and public key information) based on exponentiation in a finite (Galois) field (modulo a prime or a polynomial) - easy security relies on the difficulty of computing discrete logarithms (similar to factoring) – hard

Diffie-Hellman Setup all users agree on global parameters: – large prime integer or polynomial q – a being a primitive root mod q each user (eg. A) generates their key – chooses a secret key (number): x A < q – compute their public key: y A = a x A mod q each user makes public that key y A

Diffie-Hellman Key Exchange shared session key for users A & B is K AB : K AB = a x A. x B mod q = y A x B mod q (which B can compute) = y B x A mod q (which A can compute) K AB is used as session key in private-key encryption scheme between Alice and Bob if Alice and Bob subsequently communicate, they will have the same key as before, unless they choose new public-keys attacker needs an x, must solve discrete log

Diffie-Hellman Example users Alice & Bob who wish to swap keys: agree on prime q=353 and a=3 select random secret keys: – A chooses x A =97, B chooses x B =233 compute respective public keys: – y A = 3 97 mod 353 = 40 (Alice) – y B = mod 353 = 248 (Bob) compute shared session key as: – K AB = y B x A mod 353 = = 160 (Alice) – K AB = y A x B mod 353 = = 160 (Bob)

Key Exchange Protocols users could create random private/public D-H keys each time they communicate users could create a known private/public D-H key and publish in a directory, then consulted and used to securely communicate with them both of these are vulnerable to a meet-in-the- Middle Attack authentication of the keys is needed

Man-in-the-Middle Attack 1.Darth prepares by creating two private / public keys 2.Alice transmits her public key to Bob 3.Darth intercepts this and transmits his first public key to Bob. Darth also calculates a shared key with Alice 4.Bob receives the public key and calculates the shared key (with Darth instead of Alice) 5.Bob transmits his public key to Alice 6.Darth intercepts this and transmits his second public key to Alice. Darth calculates a shared key with Bob 7.Alice receives the key and calculates the shared key (with Darth instead of Bob)  Darth can then intercept, decrypt, re-encrypt, forward all messages between Alice & Bob