. Naturally, decryption also relies on numerous results about modular arithmetic. [6 pts] Prove in prose by induction fo
Posted: Sun Jul 10, 2022 11:27 am
. Naturally, decryption also relies on numerous results aboutmodular arithmetic.
[6 pts] Prove in prose by induction for all positive integers π:if π, π, and π are integers with π > 1
andπβ‘π(modπ),thenππ β‘ππ (modπ).
[9 pts] Compute the private key for the public key (55,17), anddecrypt the cyphertext πΆ = 41.
[6 pts] Prove in prose by induction for all positive integers π:if π, π, and π are integers with π > 1
andπβ‘π(modπ),thenππ β‘ππ (modπ).
[9 pts] Compute the private key for the public key (55,17), anddecrypt the cyphertext πΆ = 41.