January 15, 2002
Practical Aspects of Modern Cryptography
Proof of RSA
•
We have shown …
•
Y
P
mod P = Y
whenever
0
≤ Y < P
•
and
P
is
prime
!
•
•
You will show …
•
Y
K(P-1)(Q-1)+1
mod PQ = Y
when
0
≤ Y < PQ
•
P
and
Q
are distinct primes and
K ≥ 0
.
