The crux of the proof that the RSA cipher words is that if (1) p and q are distinct large prime numbers, (2)
M
<
p
q
, (3) M is relatively prime numbers, (2)
M
<
p
q
.
(3) M is relatively prime to pq. (4) e is relatively prime to
(
p
−
1
)
(
q
−
1
)
, and (5) d is a positive inverse for e modulo
(
p
−
1
)
(
q
−
1
)
, then
M
=
_
_
_
_
_
_
.
To determine
To fill in the blanks provided.
Explanation
Calculation:
The crux of the proof that the RSA cipher works is that if (1) p and q are distinct large prime numbers. (2) M<pq (3) M is relatively prime to pq, (4) e is relatively prime to (p−1)(q<