网络安全基础第三章 Public Key－Mac(2010-2011-02).pptVIP

For n ? 1, let ?(n) denote the number of integers in the interval [1, n] which are relatively prime to n. The function ? is called the Euler phi function (or the Euler totient function). Fact 1. The Euler phi function is multiplicative. I.e. if gcd(m, n) = 1, then ?(mn) = ?(m) x ?(n). E.g. 91=7×13 ?(7) =6 ?(13)=12 ?(91) = ?(7) × ?(13) =6×12＝72 The Euler phi Function Euler’s Theorem Let n be a composite. Then b?(n) ＝1 (mod n) for any integer b which is relatively prime to n. E.g. b=3; n=10;  ?(10)=4 ? 34 ＝ 81 ＝ 1 (mod 10) E.g. b=2; n=11;  ?(11)=10 ? 210 ＝ 1024 ＝ 1 (mod 11) Eulers Theorem RSA Key Generation each user generates a public/private key pair by: selecting two large primes at random p, q computing their system modulus N=p.q note φ(N)=(p-1)(q-1) selecting at random the encryption key e where 1eφ(N), gcd(e,φ(N))=1 solve following equation to find decryption key d e.d=1 mod φ(N) and 0≤d≤N publish their public encryption key: KU={e,N} keep secret private decryption key: KR={d,N} RSA Example Select primes: p=17 q=11 Compute n = pq= 187 Compute φ(n)=(p–1)(q-1)=16×10=160 Select e : gcd(e,160)=1; choose e=7 Determine d: de=1 mod 160 and d 160 Value is d=23 since 23×7=161= 10×160+1 public key KU=(7,187) private key KR=(23,187) given message M = 88 ( 88187) encryption: C = 887 mod 187 = 11 decryption: M = 1123 mod 187 = 88 Why RSA Works because of Eulers Theorem: aφ(n)mod N = 1 where gcd(a,N)=1 in RSA have: N=p×q φ(N)=(p-1)(q-1) carefully chosen e d to be e×d=1 mod φ(N) hence e×d=1+k×φ(N) for some k hence :Cd = (Me)d = Me×d = M1+k×φ(N) = M1×Mk×φ(N) = M1×(Mφ(N))k = M1×(1)k = M1 = M mod N P Q PRIME N = P·Q E·D = 1 MOD φ(N) C = ME MOD N M = CD MOD N Why RSA Works This is true if M is relatively prime to N (according to Euler’s Generalization). What if M is not relatively prime to N? The Last Step of RSA Correctness Proof If gcd(M, N) ? 1, then M and N share e