![]() ![]() ![]() (b) If Alice now chooses a different value of k so that the encoding of m = 30 isĤ. The random integer k = 2, what is the ciphertext of m= 30? (a) If Bob has public key YB = 3 and to send Bob an encrypted message, Alice chose (4 points) Consider an EIGamal scheme with a common prime q = 71 and a primitive ![]() (c) If user B has public key/value YB 3, what is the secret key/value K sharedģ. (b) If user A has public key/value YA = 9, what is A’s private key/value X A? (a) Prove that g = 2 is a primitive root of 11 (3 points) Consider a Diffie-Hellman scheme with a common prime q = 11 and a You can find the definition of primitive root in our textbook. Not a prime number and the set in question thus only contains those numbers that are (4 points) Find all primitive roots (i.e., generators) of mod25. Results without any intermediate steps will leadġ. Give sufficient (but not excessive) details. Hand calculations, you may use help from a calculator, such as the ScientificĬalculator on MS Windows and an online calculator. The following questions must be answered by hand, unless specified otherwise. If a program is developed for the first task, I would like it in Python, please.Intermediate steps need to be shown and I would like it in a digital non-written format.3.2.1 Questions by hand (23 points) Need the questions regarding Diffie-Hellman and Elliptic curves answer. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |