A question about a small step in the proof of RSA encryption

  • I
  • Thread starter Leo Liu
  • Start date
  • #1
318
141
1638205070973.png

From the paper https://people.csail.mit.edu/rivest/Rsapaper.pdf
Can someone explain the green highlight to me please? Sorry that I can't type much because this is the final week. Thanks.
 

Answers and Replies

  • #2
Gaussian97
Homework Helper
679
405
It should be evident from equation 5
 
  • #3
fresh_42
Mentor
Insights Author
2021 Award
15,952
14,421
From ##(5)## we have
\begin{align*}
ed\equiv 1 \mod \phi(n) &\Longleftrightarrow \phi(n)\,|\,(ed-1) \\
&\Longleftrightarrow \phi(n)\cdot k = ed-1 \text{ for some } k \in \mathbb{Z}\\
&\Longleftrightarrow \phi(n)\cdot k +1 = ed \text{ for some } k \in \mathbb{Z}\\
&\Longrightarrow M^{\phi(n)\cdot k +1} =M^{ed}
\end{align*}
 
Last edited:

Related Threads on A question about a small step in the proof of RSA encryption

  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
4
Views
1K
Replies
2
Views
2K
  • Last Post
Replies
7
Views
2K
Replies
22
Views
2K
Replies
751
Views
57K
  • Last Post
2
Replies
39
Views
9K
  • Last Post
Replies
1
Views
6K
Replies
7
Views
2K
Top