Problem 3 Let p≥ 3 be a prime and g € Z, a generator of Z. Consider the key-generation and encryption algorithms below:

[answerhappygod]

Problem 3 Let P 3 Be A Prime And G Z A Generator Of Z Consider The Key Generation And Encryption Algorithms Below 1 (43.79 KiB) Viewed 31 times

Problem 3 Let p≥ 3 be a prime and g € Z, a generator of Z. Consider the key-generation and encryption algorithms below: Alg K Alg E(X, M) x+Zp-1 if MZ; then return X← MOD-EXP(g, x,p) y Zp-1; Y ← MOD-EXP(g, y, p) return (X, x) Z← MOD-EXP(X, y, p); W← (Z. M) mod p return (Y, W) The message M must be in Z, meaning the message space is Z. We let k be the bit-length of p. Presenting the decryption algorithm D that makes AE = (K, E, D) a correct asymmetric encryption scheme was part of HW5. For this exercise, specify in pseudocode an O(k²)-time adversary A making one query to its Enc oracle and achieving Advint-txt (A) = 1.