第9章非对称密码体制(1).pptVIP

* Here walk through example using “trivial” sized numbers. Selecting primes requires the use of primality tests. Finding d as inverse of e mod ?(n) requires use of Inverse algorithm (see Ch4) * Rather than having to laborious repeatedly multiply, can use the square and multiply algorithm with modulo reductions to implement all exponentiations quickly and efficiently (see next). * * 费马大定理: 当整数n 2时，关于x, y, z的不定方程 x^n + y^n = z^n. 无正整数解 * * * * 计算 ?(n) 需要计算与n不互素的元素的个数 例如 ?(37) = 36 ?(14) = #{1,3,5,9,11,13}=6 对素数p， ?(p) = p-1 对 n=pq (p, q 是素数) ?(n) = (p-1)(q-1) 例如?(14) = (2–1)×(7–1) = 1×6 = 6