HW$5$: Asymmetric Encryption $($RSA$)-$ Due: Nov $17,2024$

Using the process of key generation, show the encryption process used by the RSA algorithm.

Note: Two prime numbers, $p=61$ and $q=53$ are used by Bob, answer the following questions $($scan and upload your work$)$

Q$1$: What is the value of modulus $N?$

Q$2.$ What is the value of Euler's Totient function used in the calculation above? Phi$($N$)$

Q$3$: Bob generates its public key $e=17$ & private key $d=2753$; Modulus N is also made available with the public key e $,$ and p