In this discussion, you are thinking about what is necessary to attack an RSA encrypted message; small numbers are used for convenience but treat them like you would treat large, cumbersome numbers. You obtain the ciphertext y = 1141 by eavesdropping and the public key is (2623, 2111). (a) All variables except the plaintext x are known. Why cant you just solve the encryption formula for x? (b) In order to determine the private key d, you have to calculate d = e

1 modulo (n). There is

an efficient formula for calculating (n). Can we use this formula here? 8. Your archnemesis is setting up a communication network and chooses an RSA modulus n = 222333444555666777888999000111222333222111111000000000005768974359871589614785606006767465353. What steps would you take to try to factor this number? Please bear in mind that SageMathCell timed out when I used the factor(n) command.