public-keyencryptionanddigitalsignatures-全文預(yù)覽
【正文】 ime numbers, p and q. ? 2. Calculate the product, n = p x q. ? 3. Calculate the Euler totient. –?(n) = (p 1) x (q 1). ? 4. Select integer e. – gcd(?(n) ,e) = 1。 1 e ?(n) RSA Algorithm Key Generation () ? 5. Calculate d. – de = mod ? (n) = 1. ? 6. Public Key is KU = {e,n}. ? 7. Private Key is KR= {d,n}. RSA Example ? Key Generation Example – 1. Select primes, p = 17 and q = 11. – 2. Calculate n = p x q = 17 x 11 = 187. – 3. Calculate ? (n) = (171) x (111)= 160. – 4. Select e. ? ?(n) = 32 x 5 = 25 x 5. ? Possible e’s: 3,7,11,..., ? (n) =160 ? Choose 7. RSA Example () ? Key Generation Example (cont.) – 5. Determine d. ? Solve (d x 7) mod 160 =1, where d 160. ? This means (d x 7) = (k x 160) + 1 for k an integer. ? d = 23, since 23 x 7 = 161
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號(hào)-1