(+5) Find the appropriate value for the decrypting keys n and d in the RSA public key cryptology system based system based on the primes p = 7 and q = 19 and the encryption key e = 5 Find n and d

d = 7 n = 133 d = 37 n = 133 d = 65 n = 133 (= None of the above

(+5) Knowing the public keys to the RSA public-key encryption are n = 77 and e = 7, what is the value of the private key d .

41 43 7 None of the above

This is problem #50 in the chapter review on page 561

(+5) What is the time complexity of the problem of searching for a particular entry in a sorted list

Q(log2 n) B. Q(n) C. Q(n log2 n) D. Q(n2)

(+5) An unsolvable problem is a problem for which

no solution exists.

no one knows the solution.

no algorithm exists for finding the solution.

no one wants to known the solution.

(+5) If c = x mod n then c is guaranteed to be in which of the following sets

{ 1, 2, 3, n-1 } { 0, 1, 2, 3, . n-1 } { -(n-1), -(n-2), -(n-3), -2, -1 0 } { 1, 2, 3, . n }