原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
Applying a secret key requires O(β) modular multiplications, using O(β3) bit operations.
Theorem 31.36 (Correctness of RSA) The RSA equations (31.37) and (31.38) define inverse transformations of ℤn satisfying equations (31.35) and (31.36). Proof From equations (31.37) and (31.38), we have that for any M ∈ ℤn, P(S(M)) = S(P(M)) = Med (mod n). Since e and d are multiplicative inverses modulo ϕ(n) = (p – 1)(q – 1), ed = 1 + k(p – 1)(q – 1) for some integer k. But then, if M ≠ 0 (mod p), we have Med = M(Mp–1)k(q–1) (mod p) = M((M mod p)p–1)k(q–1) (mod p) = M
(1)k(q–1) (mod p) (by Theorem 31.31) = M (mod p) Also, Med = M (mod p) if M = 0 (mod p). T
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea