Question: DISCRETE LOGS DESCRIPTION (JAVA) (CRYPTOGRAPHY) CAN YOU PLEASE DO THIS ASAP Given Diffie-Hellman parameters: p=0x00fb2e8473c4990184d806e6b5df7f621b =2 kpriv, Alice =0x2ca50afea541f0d90f68e0efc85c2686 kpriv, Bob =0x6e146d3b2149f41450713e5c83d21e70 Assignment Write a

DISCRETE LOGS DESCRIPTION (JAVA) (CRYPTOGRAPHY)
CAN YOU PLEASE DO THIS ASAP
Given Diffie-Hellman parameters: p=0x00fb2e8473c4990184d806e6b5df7f621b =2 kpriv, Alice =0x2ca50afea541f0d90f68e0efc85c2686 kpriv, Bob =0x6e146d3b2149f41450713e5c83d21e70 Assignment Write a Java program using the BigInteger class that determines the number of bits in the prime p, AND that simulates how Alice and Bob each establish their shared key. Your program must print the following output: Bit count of p: 128 Shared key A : 587b4f3e8914f86063af504c3b427500 Shared key B : 587b4f3e8914f86c63af504c3b427500
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
