Given an Elgamal encryption scheme (given below) with public key… Given an Elgamal encryption scheme (given below) with public key tuple k

Given an Elgamal encryption scheme (given below) with public key… Given an Elgamal encryption scheme (given below) with public key tuple kpub = (p, ?, ?) and an unknown private key kpri = d. Due to an erroneous implementation of the random number generator of the encrypting party, the following relation holds for two temporary keys: kM, j+1 = (2·kM, j + 1) mod p. Given n consecutive ciphertexts (kE1, y1), (kE2, y2), …, (kEn, yn) to the plaintexts x1, x2, …, xn. Furthermore, the first plaintext x1 is known (e.g. header information of the message.) (Same condition as the previous question)Can an attacker compute the private key d from the given information? Give reasons for your answer. Computer Science Engineering & Technology Information Security CS CS6676 Share QuestionEmailCopy link