原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
f cryptography has blossomed. Our understanding of the RSA cryptosystem has deepened, and
modern implementations use significant refinements of the basic techniques presented here. In addition, many new techniques have been developed for proving cryptosystems to be secure. For example, Goldwasser and Micali [190] show that randomization can be an effective tool in the design of secure public-key encryption schemes. For
signature schemes, Goldwasser, Micali, and Rivest [191] present a digital-signature schem
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea