Question 10 (1 point) Assuming an n-bit hash code, how many samples are required to find two distinct messages that produce the same hash codes with a 50% chance of success? O logn On? Ovan O On! Question 11 (1 point) ---- principle states that the security of a cryptosystem should depend only on keeping the key secret. Question 12 (1 point) Adding a message digest to a message is to achieve the __ of the message O Confidentiality O Integrity Authentication Availability Question 13 (5 points) In this question, you will encrypt a message using RSA for given parameters below. p = 3, q = 11, e = 7, M = 5 Use the Euclidean and the Extended Euclidean algorithms to show all the steps required to derive the private key, though you can easily find the private key for this case