public-keyencryptionanddigitalsignatures(編輯修改稿)
2025-06-06 19:22 本頁面
【文章內(nèi)容簡介】 on Algorithm – The RSA algorithm (1977) is widely used for publickey encryption. – Developed by Ron Rivest, Adi Shamir, and Len Adleman (MIT). – It is a block cipher, with plaintext and cipher text represented as integers from 0 to n1. The RSA Algorithm ? Encryption – Public Key is KU = {e,n}. – C = Me mod n, where M is the plaintext and C is the ciphertext (represented as integers). ? Decryption – Private Key is KR = {d,n}. – M = Cd mod n. Requirements for the RSA Algorithm ? 1. It is possible to find values of e,d, and n such that Med = M mod n for all integers M n. ? 2. It is relatively easy to calculate Me and Cd for all values of M n. ? 3. It is infeasible to determine d given e and n. RSA Algorithm Key Generation ? 1. Select two different pr
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號-1