7 DiffieHellman Diffie Hellman in 1976 W Diffie

  • Slides: 18
Download presentation

7. Diffie-Hellman 密钥分配方案 公钥密码问世 Diffie & Hellman in 1976: 密钥交换的实际方法 公钥方案概念的提出 W Diffie, M

7. Diffie-Hellman 密钥分配方案 公钥密码问世 Diffie & Hellman in 1976: 密钥交换的实际方法 公钥方案概念的提出 W Diffie, M E Hellman, "New directions in Cryptography", IEEE Trans. Information Theory, IT-22, pp 644 -654, Nov 1976 James Ellis (UK CESG) 在案970年曾提出此概念

10. Diffie-Hellman 密钥交换 计算共享密钥: KAB = ax. A. x. B mod p = y.

10. Diffie-Hellman 密钥交换 计算共享密钥: KAB = ax. A. x. B mod p = y. Ax. B mod p (which B can compute) = y. Bx. A mod p (which A can compute) KAB 可以用于对称加密密钥

11. Diffie-Hellman 举例 选取素数 p=97 , 及本根 a=5 Alice 选取秘密 x. A=36 & 计算公钥

11. Diffie-Hellman 举例 选取素数 p=97 , 及本根 a=5 Alice 选取秘密 x. A=36 & 计算公钥 y. A=536=50 mod 97 Bob选取秘密 x. B=58 &计算公钥 y. B=558=44 mod 97 Alice and Bob 交换公钥 (50 & 44 respectively) Alice 计算公享秘密 K=4436=75 mod 97 Bob计算公享秘密 K=5058=75 mod 97

13. 快速模运算 Chivers (1984) 快速运算: given an integer A n-1 A = SUM ai.

13. 快速模运算 Chivers (1984) 快速运算: given an integer A n-1 A = SUM ai. bi i=0

练习 1. Illustrate the operation of the Diffie-Hellman public key exchange scheme, given the

练习 1. Illustrate the operation of the Diffie-Hellman public key exchange scheme, given the following public parameters: prime p=37 prim root a=5 Compute suitable public keys for users Alice and Bob, and illustrate the key exchange, verifying that the same shared session key is obtained. 2. Illustrate the operation of the Diffie-Hellman public key exchange scheme, given the following public parameters: prime p=59 prim root a=6 As above.

END!!

END!!