Fill This Form To Receive Instant Help

Help in Homework
trustpilot ratings
google ratings


Homework answers / question archive / This question needs explaination upto distinction level step by step

This question needs explaination upto distinction level step by step

Computer Science

This question needs explaination upto distinction level step by step. it is related to discrete logarithms For the ElGamal cryptosystem, let the public key of Alice be (p, g, h), where p is a big prime, and g is a generator for mod p, and h=ga. The secret key for Alice is a. Bob wants to communicate with Alice, he will encrypt the messages m1m2m3 m4... in order as specified by ElGamal and send the ciphertexts c1c2c3c4... to Alice in ordere. Eve wants to attack this encrypted communication between Alice and Bob. Assume that Eve can have one plaintext m1,Show an attack that how Eve can recover all the encrypted c2c3c4... if Bob uses a broken random number generator that only outputs a constant value, say b = 2 And One step further, if the random number generator is not broken, but it is bad in the sense that it outputs b = 2 with probability 90%, then what is the probability that Eve can recover c2, can recover c3, and can recover c3c4

 

  •  Use the baby step, giant step method to solve 2k = 7 mod 13 

pur-new-sol

Purchase A New Answer

Custom new solution created by our subject matter experts

GET A QUOTE

Related Questions