← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

31 第31章 数论算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.761Z

side a paper envelope that is opened only by the intended recipient. The RSA cryptosystem

In the RSA public-key cryptosystem, a participant creates a public key and a secret key with the following procedure: Select at random two large prime numbers p and q such that p ≠ q. The primes p and q might be, say, 1024 bits each. Compute n = pq. Select a small odd integer e that is relatively prime to ϕ(n), which, by equation (31.21), equals (p – 1)(q – 1). Compute d as the multiplicative inverse of e, modulo ϕ(n). (Corollary 31.26 guarantees that d exists and is uniquely defined. You can use the technique of Section 31.4 to compute d, given e and ϕ(n).) Publish the pair P

= (e, n) as the participant’s RSA public key. Keep secret the pair S = (d, n) as the part

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea