In this paper, a new key-agreement scheme is proposed and analyzed. In
addition to being provably secure in shared secret key indistinguishability
model, the scheme has an interesting feature: while using exponentiation over a
cyclic subgroup to establish the key-agreement, the generator of that subgroup
is hidden to secure the scheme against adversaries that are capable of solving
the Discrete Logarithm Problem, which means that the scheme might be candidate
as a post-quantum key exchange scheme.

By admin