知识卡片
RSA密钥来自两个素数与逆元
RSA选不同大素数p、q,令n=pq,取与φ(n)=(p−1)(q−1)互素的e,再求d≡e⁻¹ mod φ(n)。
公开(e,n),保密(d,n)及用于求d的因子;公钥作M^e mod n,私钥作C^d mod n。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第31章 数论算法 · 查看原书依据
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
参考来源
- 位置:《算法导论(第4版)》第31章《数论算法》(OEBPS/chapter031.xhtml,文本字符[65000,70000))。
- 结论依据:原书第31.7–31.8节的公钥、RSA或素数定理推导,结合对应图式核对。
- 原始内容: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