CryptographyTU Board 2081
Why do we need discrete logarithm? Illustrate with an example. Consider a Diffie Hellman scheme with a common prime p = 13 between user A and user B. Suppose public key of A is 10 and public key of…
10Why do we need discrete logarithm? Illustrate with an example. Consider a Diffie-Hellman scheme with a common prime p = 13 between user A and user B. Suppose public key of A is 10 and public key of B is 8. Now determine their private keys and shared secret key. Select any valid primitive root of 13.
A worked answer is on its wayMeanwhile, read the Cryptography notes for this topic.
Discussion
Loading…
More Cryptography questions
Describe the Fiestel Cipher structure. Given the key 2B, 7E, 15, 16, 28, AE, D2, A6, AB, F7, 97, 66, 01, 02, 03, 04, compute the first 4 byte of next key…TU Board 208210Illustrate the man in middle attack in Diffie – Hellman key exchange protocol. Assume the prime number be 19 and 10 as its primitive root. Select 5 as private…TU Board 208210List the properties of hash function. Describe the algorithm for SHA 1.TU Board 208210Describe any three types of malicious logic.TU Board 20825Given the key "HELLOWORLD", encrypt the plaintext "TURINGTEST" using Play fair cipher.TU Board 20825Explain any two modes of block cipher encryption.TU Board 20825