计算机网络安全双语chapter 非对称.pptVIP

Chapter 3 Public-key Cryptography Introduction 1976, proposed by Diffie and Hellman The first truly revolutionary advance in encryption Public-key cryptography is also known as asymmetric-key cryptography [?si’metrik]不对称的 public-key cryptography does not make obsolete the traditional symmetric-key cryptography. six ingredients Plaintext, Encryption algorithm, Public key, private key, Ciphertext, Decryption algorithm example A person has two keys: Private key (k1) Public key (k2) Someone else want to send him a secret a message M Ek2(M) Dk1(C) He want to sign a message M Ek1(M) Dk2(C) Confidentiality and authentication RSA Prime Numbers RSA Prime Numbers素数 An integer [‘intid??]整数 is prime if it has exactly two distinct [dis‘ti?kt]截然不同的 divisors [di’vaiz?]约数, the integer 1 and itself. two integers, m and n, being relatively prime to each other if and only if gcd(m, n) = 1. 4 and 9 ? 9 and 9 ? the number 1 is coprime to every integer. greatest common divisor RSA Ron Rives, Adi Shamir and Len Adleman at MIT, in 1977 RSA is a block cipher The most widely implemented theoretical basis: 因式分解问题(NP-Hard) 给定一个整数n，找出它的素数因子(prime factors) Assumption！ RSA加密解密过程 Plaintext: Mn Public key {e, n}， Private key {d,n} ed mod t =1 ( t is large) Encryption: C = Me (mod n) Decryption: M = Cd (mod n) Cd= (Me)d mod n (Me)d mod n= Med mod n Med mod n =M (Euler定理) 条件：ed= kφ(n)+1 密钥生成过程 Select two prime numbers p, q Calculate n = p * q Calculate ф(n)=(p-1) (q-1) Select integer e Calculate d ed mod ф(n) =1 Public Key KU = {e,n} Private key KR = {d,n} greatest common divisor 练习 P=17 q=3 n = 17 × 3 = 51 Φ(n) = 16 × 2 = 32 e d: e and Φ(n) are coprime. try e = 5 ed mod ф(n) =1 ? ed-1= kф(n) d=13 M=3 C=? excel Diffie-Hellman K = a XA XB mod q 目标 Man In The Middle中间人攻击 如何防止中间人攻击？ Other methods Elliptic-Curve Cryptography (ECC) Good for smaller bit size Low confidence level, compared with RSA Very complex …… * * Symmetric enc