Basic & Public Key cryptographic Algorithm


Question 1: List some of the attacks on the Diffie-Hellman key exchange protocol we discussed in the lecture. Present your solution for avoiding such attacks.
Question 2: In the Diffie-Helman protocol, g=11, p=29, x=5, and y=7.
What is the value of the symmetric key?
What is the value of R1 and R2?

Question 3: In the Diffie-Helman protocol, what happens if x and y have the same value, that is, Alice and Bob accidentally chosen the same number? Are R1 and R2 same? Do the session key calculated by Alice and Bob have the same value? Explain what would adversary observe? Could she guess Alice’s and Bob’s private key? Use an example to prove your claims.
Question 4: Using RSA scheme, let p=23, q=31, d=457, calculate the public key e. Provide detailed description of all steps, explain what information will be published and what destroyed.
Optionally: Encrypt and decrypt simple message M1=100.
· Paper work should have 400 words
· Paper must have 3 Citing reference “Harvard Style:
· Referencing style should be generated from httpss://www.harvardgenerator.com/
Important: This assignment will be sent via TURNITIT system, original work is a must.


Previous ArticleNext Article

Leave a Reply

Your email address will not be published. Required fields are marked *