Consider the Diffe-Hellman scheme with q = 11 and = 6.
(a) Show that 6 is a primitive root of 11.
(b) If A has the public key YA = 7, what is the private key XA.
Show all calculations.
(c) If B has the public key YB = 3, what is the private key XB.
Show all calculations.
(d) Show the calculation done by A to get the shared key KAB.
(e) Show the calculation done by B to get the shared key KAB.
Consider the Diffe-Hellman scheme with q = 11 and = 6. (a) Show that 6 is...
Question1: Alice and Bob use the Diffie–Hellman key exchange technique with a common prime q = 1 5 7 and a primitive root a = 5. a. If Alice has a private key XA = 15, find her public key YA. b. If Bob has a private key XB = 27, find his public key YB. c. What is the shared secret key between Alice and Bob? Question2: Alice and Bob use the Diffie-Hellman key exchange technique with a common...
I have to modify a server program and chat program to work as the following instructions but I am completely clueless as to where to start. I'd appreciate any help on how to atleast get started. This must be done in java. Diffie-Hellman Two parties use a key agreement protocol to generate identical secret keys for encryption without ever having to transmit the secret key. The protocol works by both parties agreeing on a set of values (a) and (q)....
In a Diffie-Hellman Key Exchange, Martha and John have chosen prime value q = 19 and primitive root a = 10. If Martha's secret key is 4 and John's secret key is 6, determine the following three values: The value Martha sends to John. The value John send to Martha The shared key they exchanged.
Diffie-Hellman Key Exchange: Alice and Bob wants to agree on a key. First, both agree on p = 23 and g = 5 which is public. Alice chooses her secret key xA = 8 and Bob xB = 14. (a) What will be the shared secret key? (b) DH Key exchange is vulnerable to the following attack. Adversary sits between Alice and Bob, intercepting all messages. Alice and Bob thinks they talk to each other while in fact both talking...
users A and B use the Diffie-Hellman key exchange technique with a common prime p=107 and a primitive root g=5. If user A has private key 112 and publick key 3 and user B has private key 146 and publick key 19 Find the following Ans If user C just joined the group and his private key is 6. what is the security key between A and C? what is the security key between B and C?
3. Alan and Bill agree (through a public exchange) on using the Diffie-Hellman algorithm to create a common secret key. They also agree on two public numbers: q (large prime number), (generator mod q): q = 13, = 3 Alan generates a random RA =11. Bill generates a random RB =13. (a) What is the SA Alan sends to Bill? (i.e. SA =? (3 points) (b) What is the SB Bill sends to Alan? (i.e. SB =? (3 points) (c)...
your answer. Refer to attack scenarios on mutual authentication protocols that were discussed during the Lecture-7 and Tutorial-7.] 5 Marks] Q5 (OpenSSL and IPFS) Assume that the School of Science of RMIT University is planning to use IPFS-based repository of sensitive files for sharing among staffs. An owner of a particular file, say Alice wants to share the file to her supervisor, say Bob. Therefore, Alice encrypts the file with Alice and Bob's shared AES secret key (KaB) using OpenSSL,...
5. Consider the RSA encryption scheme, Alice wants to send a message to Bob. Both Alice and Bob have p= 17,9 = 19. Alice has e=31 and Bob has e=29. a. What is the public key pair used in the transmission? 2 marks b. What is the secret key pair used in the transmission? 4 marks c. Encrypt the message m=111. 4 marks d. Decrypt the resulting ciphertext. 4 marks e. What's the security problem between Alice and Bob? How...
Question 1 (1.5 marks): Asymmetric Security (The RSA algorithm) Consider the last two pairs of two digits of your student ID. Select two prime numbers that are http://en.wikipedia.org/wiki/List of prime numbers#The first 500 prime numbers For example: Student ID 9001346 -1346 The closest prime number to 13 is itself 13 and the closest prime number to 46 is 47. a. Assuming that these two prime numbers are the variables P and Q, determine the private and public keys used by...
Consider the RSA algorithm. Let the two prime numbers, p=11 and q=41. You need to derive appropriate public key (e,n) and private key (d,n). Can we pick e=5? If yes, what will be the corresponding (d,n)? Can we pick e=17? If yes, what will be the corresponding (d,n)? (Calculation Reference is given in appendix) Use e=17, how to encrypt the number 3? You do not need to provide the encrypted value.