1) If the message ( M=10, e=2, n=7 ) find the RSA cyphertext. In other words encrypt ( M ) using RSA. SHOW FORMULA and SHOW WORK 2) Use Euler's ( Phi(n) ) phifunction to find ( Phi(36) ) SHOW ALL WORK. 3) Use modular exponentiation to find ( 45^{4} mod 21 ) JUST SET UP JUST SHOW ONE STATEMENT DO NOT SHOW FURTHER recursion 4) In RSA to send a MESSAGE you encrypt using the recipient's (multiple choice 2 parts) a) secret key b) public key and the recipient decrypts using a) her secret key b) your publickey c) your secret key to decrypt message.

G 1) If the message M=10,e=2,n=7 find the RSA cyphertext. in other words encrypt M using RSA. SHOW FORMULA and SHOW WORK 2) Use Euler's (n) phifunction to find (36) SHOW ALL WORK. 3) Use modular exponentiation to find 454mod21 JUST SET UP JUST SHOW ONE STATEMENT DO NOT SHOW FURTHER recursion 4) In RSA to send a MESSAGE you encrypt using the recipient's (multiple choice 2 parts) a) secretkey b) publickey and the recipient decrypts using a) her secret key b) your publickey c) your secret key to decrypt message. 1) If the message M=10,e=2,n=7 find the ksom in other words encrypt M using RSA. SHOW FORMULA and SHOW WORK 2) Use Euler's (n) phifunction to find (36) SHOW ALL WORK. 3) Use modular exponentiation to find 454mod21 JUST SET UP JUST SHOW ONE STATEMENT DO NOT SHOW FURTHER recursion 45454545Mod21 4) In RSA to send a MESSAGE you encrypt using the recipient's (multiple choice 2 parts) secret key b) public key d the recipient decrypts using a) her secret key our publickey c) your secret key to decrypt message