Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
QUESTION
Consider the following variant of the Diffie-Hellman key exchange protocol:?
Consider the following variant of the Diffie-Hellman key exchange protocol:?(1) Alice and Bob publicly choose a big prime p and a number 1 < r < p together.(2) Alice secretly chooses an integer 1 <= kA < p -1 and Bob secretly chooses an integer 1 <= kB < p -1.(3) Alice tells Bob kAr (mod p).(4) Bob tells Alice kBr (mod p).(5) The "secret" key is s ≡ kAkBr (mod p) which both Alice and Bob can easily compute.Show that Eve can now retrieve kA. How?
