Scribd
Upload
60 views2 pages

Crypto Assignment 4

The document outlines 10 assignments related to cryptography topics such as proving properties of cryptosystems, explaining signature schemes, and analyzing attacks. Students must complete assignments on proving properties of cryptographic problems, analyzing security of signature schemes, and demonstrating attacks that exploit weaknesses in cryptographic primitives.

Uploaded by

wowiliv258
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views2 pages

Crypto Assignment 4

The document outlines 10 assignments related to cryptography topics such as proving properties of cryptosystems, explaining signature schemes, and analyzing attacks. Students must complete assignments on proving properties of cryptographic problems, analyzing security of signature schemes, and demonstrating attacks that exploit weaknesses in cryptographic primitives.

Uploaded by

wowiliv258
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment IV - B.

Tech VIthSemester
Cryptography
last date for submission - will be announced in class

five students can submit one assignment

1. (i) Prove formally that hardness of CDH problem relative to cyclic group G implies
hardness of discrete logarithm problem relative to G.
(ii) Prove formally that hardness of DDH problem relative to G implies hardness of CDH
problem relative to G.

2. Prove that text-ElGamal is not semantically secure (IND-CPA).

3. Prove that modified ElGamal is semantically secure (IND-CPA) if the DDH assumption
holds. But modified ElGamal is not IND-CCA secure.

4. Explain RSA signature scheme. In RSA digital signature,suppose signatures of Alice for
the messages 5 and 9 are respectively 6 and 24. Given the public keys, can you find the
signature of Alice for message 405. Explain. Assume n = 13 * 17.

5. Define existential forgery. Show that RSA signature scheme is vulnerable for existential
forgery under known message attack.Write two method to prevent existential forgery.

6. Define selective forgery. Show that RSA signature scheme is vulnerable for selective
forgery under chosen message attack.

7. Suppose Alice wants to sign a message x. She first constructs the message digest z =
h(x), and then computes the signature on z,namely, y = sigK (z). Then she transmits
the ordered pair(x,y) over the channel.Suppose hash function is not secondary image
resistant.Then show that Adversary can make selective forgery using chosen message
attack.

8. Suppose Alice wants to sign a message x. She first constructs the message digest z =
h(x),and then computes the signature on z,namely, y = sigK (z). Then she transmits
the ordered pair(x,y) over the channel. Suppose hash function is not secondary image
resistant. Then show that Adversary can make existential forgery using known message
attack.

9. Suppose Alice wants to sign a message x. She first constructs the message digest z =
h(x), and then computes the signature on z,namely, y = sigK (z). Then she transmits
the ordered pair(x,y) over the channel. Suppose hash function is not collision resistant.
Then show that Adversary can make existential forgery using chosen message attack.
10. Users Alice and Bob use the Diffie-Hellman key exchange protocol with common prime
p = 23 and a primitive root g = 7. Alice has private key 3 and Bob has private key 5.
Find the shared symmetric key. Can you make man in middle attack on Diffie- Hellman
key exchange protocol with one private key and the corresponding public key.

You might also like