The following Key Exchange Algorithm (KEA) was designed by the NSA of the US government. It is a variant of the Diffie-Hellman protocol. Each user P has a private key xP and public key g^xP mod p.
1: A → B: g^rA mod p
2: B → A: g^rB mod p
Shared Key K = g ^ rAxB + g ^ rBxA mod p
Does the KEA protocol provide the following security properties? Please justify your answer.
a) Key freshness
b) Key Authentication
c) Perfect Forward SecrecyAttachments