QUESTION 9 The integer pair (77,5) can be a public key in RSA. True False QUESTION 10 If (33,3) is a public key in RSA, then it encrypts 5 as 23. True False QUESTION 11 If (33,3) is a public key in RSA, then the private key is 7. O True False QUESTION 12 Breaking RSA is simple in theory but hard in practice when n is large. O True False QUESTION 13 It is very expensive computationally to evaluate an mod m if an, and m are really large. True False QUESTION 14 Let m and n be two positive integers. Then, the most efficient algorithm available to find gcd(m,n) is O(logn). True False QUESTION 15 The is no integer solution for the equation 412 x + 260y=5. True False QUESTION 16 The multiplicative inverse of 1235 mod 37 is 12. O True O False QUESTION 16 The multiplicative inverse of 1235 mod 37 is 12. True False QUESTION 17 If n is prime, then Va eZn^2+0,an-Imodn=1 True False QUESTION 18 Ifa ez, and a n-1 modn=1 then nis prime. True False QUESTION 19 1 If a n-1 mod n=1 for k different a E Zn then the probability of n being prime is 1- Note: ignore Carmichael numbers. 2k True False QUESTION 20 A pseudo prime number is prime mathematically. True False