原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
ncrypts M using K, obtaining ciphertext C, where C is as long as M, but K is quite short.
Then she encrypts K using Bob’s public RSA key. Since K is short, computing PB(K) is fast (much faster than computing PB(M)). She then transmits (C, PB(K)) to Bob, who decrypts PB(K) to obtain K and then uses K to decrypt C, obtaining M. A similar hybrid approach creates digital signatures efficiently. This approach combines RSA with a public collision-resistant hash function
h—a function that is easy to compute but for which it is computationally infeasible to fi
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea