原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
unctions PA() and SA() are efficiently computable given the corresponding keys PA and SA.
The public and secret keys for any participant are a “matched pair” in that they specify functions that are inverses of each other. That is, for any message M ∈ D. Transforming M with the two keys PA and SA successively, in either order, yields back the original message M. A public-key cryptosystem requires that Alice, and only Alice, be able to compute
the function SA() in any practical amount of time. This assumption is crucial to keeping
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea