1、为什么RSA算法加解密互逆？
m = c d m o d n = m e d m o d n = m k λ ( n ) + 1 m o d n m k λ ( n ) + 1 m o d p = m k ∗ l ∗ ( p − 1 ) + 1 m o d p = m k ∗ l ∗ ( p − 1 ) ∗ m m o d p = m m o d p m k λ ( n ) + 1 m o d q = m k ∗ l ∗ ( q − 1 ) + 1 m o d q = m k ∗ l ∗ ( q − 1 ) ∗ m m o d q = m m o d q m k λ ( n ) + 1 m o d n = m m o d p q \begin{aligned} m&=c^dmod\:n\\ &=m^{ed}mod\:n\\ &=m^{k\lambda(n)+1}mod\:n\\ \\ m^{k\lambda(n)+1}mod\:p&=m^{k*l*(p-1)+1}mod\:p\\ &=m^{k*l*(p-1)}*m\:mod\:p\\ &=m\:mod\:p\\ \\ m^{k\lambda(n)+1}mod\:q&=m^{k*l*(q-1)+1}mod\:q\\ &=m^{k*l*(q-1)}*m\:mod\:q\\ &=m\:mod\:q\\ \\ m^{k\lambda(n)+1}mod\:n&=m\:mod\>pq \end{aligned} mmkλ(n)+1modpmkλ(n)+1modqmkλ(n)+1modn=cdmodn=medmodn=mkλ(n)+1modn=mk∗l∗(p−1)+1modp=mk∗l∗(p−1)∗mmodp=mmodp=mk∗l∗(q−1)+1modq=mk∗l∗(q−1)∗mmodq=mmodq=mmodpq
2、对下列数据实现加密和解密
a.p = 3;q = 7,e = 5; M = 10
n = p q = 21 ϕ ( n ) = ( p − 1 ) ( q − 1 ) = 12 e = 5 e d ≡ 1 m o d ( ϕ ( n ) ) 即 5 d ≡ 1 m o d ( 12 ) \begin{aligned} n&=pq=21\\ \phi(n)&=(p-1)(q-1)=12\\ e&=5\\ ed&\equiv1mod(\phi(n))\\ 即5d&\equiv1mod(12) \end{aligned} nϕ(n)eed即5d=pq=21=(p−1)(q−1)=12=5≡1mod(ϕ(n))≡1mod(12)
用egcd算法有
0 1 12 1 0 5 − 2 1 2 5 − 2 1 5 × 5 + ( − 2 ) × 12 = 1 解得 d = 5 (1) \begin{matrix} 0 & 1 & 12\\ 1 & 0 & 5 \\ -2 & 1 & 2\\ 5 & -2 & 1\\ \end{matrix} \tag{1}\\ 5\times5+(-2)\times12=1\\ 解得d=5 01−25101−2125215×5+(−2)×12=1解得d=5(1)
C = M e m o d n = 1 0 5 m o d 21 = 10 × 1 0 4 m o d 21 = ( 10 m o d 21 × 1 0 4 m o d 21 ) m o d 21 = ( 10 × 4 ) m o d 21 = 19 M = C d m o d n = 1 9 5 m o d 21 = 19 × 1 9 4 m o d 21 = ( 19 m o d 21 × 1 9 4 m o d 21 ) m o d 21 = ( 19 m o d 21 × ( − 2 ) 4 m o d 21 ) m o d 21 = ( 19 × 16 ) m o d 21 = 10 \begin{aligned} C=M^emodn&=10^5mod21\\ &=10\times10^4mod21\\ &=(10mod21\times10^4mod21)mod21\\ &=(10\times4)mod21\\ &=19\\ \\ M=C^dmodn&=19^5mod21\\ &=19\times19^4mod21\\ &=(19mod21\times19^4mod21)mod21\\ &=(19mod21\times(-2)^4mod21)mod21\\ &=(19\times16)mod21\\ &=10\\ \end{aligned} C=MemodnM
最低0.47元/天 解锁文章
873
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
