ComSec作业3

1、为什么RSA算法加解密互逆？

$$\begin{array}{rl}m& =c^{d}modn\\ & =m^{ed}modn\\ & =m^{k\lambda (n)+1}modn\\ & \\ m^{k\lambda (n)+1}modp& =m^{k\ast l\ast (p-1)+1}modp\\ & =m^{k\ast l\ast (p-1)}\ast mmodp\\ & =mmodp\\ & \\ m^{k\lambda (n)+1}modq& =m^{k\ast l\ast (q-1)+1}modq\\ & =m^{k\ast l\ast (q-1)}\ast mmodq\\ & =mmodq\\ & \\ m^{k\lambda (n)+1}modn& =mmodpq\end{array}$$

2、对下列数据实现加密和解密

a.p = 3;q = 7,e = 5; M = 10

$$\begin{array}{rl}n& =pq=21\\ \varphi (n)& =(p-1)(q-1)=12\\ e& =5\\ ed& \equiv 1mod(\varphi (n))\\ 即5d& \equiv 1mod(12)\end{array}$$
用egcd算法有
$$\begin{gathered} \begin{array}{ccc}0& 1& 12\\ 1& 0& 5\\ -2& 1& 2\\ 5& -2& 1\end{array} \\ 5\times 5+(-2)\times 12=1 \\ 解得d=5\text{\hspace{1em}(1)} \end{gathered}$$
$$\begin{array}{r}C=M^{e}modn\\ \\ \\ \\ \\ \\ M\end{array}$$