January 15, 2002
Practical Aspects of Modern Cryptography
Remaining RSA Basics
•
Why is
Y
X
mod PQ = Y
whenever
•
X mod (P-1)(Q-1) = 1
,
0
£
Y
<
PQ
,
•
and
P
and
Q
are distinct primes?
•
•
How can Alice can select integers
E
and
D
such that
E
•
D mod (P-1)(Q-1) = 1
?
