Key agreement protocol securer than DLOG

摘要

Our goal is to propose a key agreement protocol that is secure even if the discrete logarithm problem can be efficiently solved in the underlying abelian group. The protocol is defined over a non-cyclic finite abelian group whereas the Diffie-Hellman protocol is defined over a cyclic finite abelian group. We analyze the generic reductions of breaking the proposed protocol to the discrete logarithm problem and show that a large number of queries to the discrete logarithm oracle are required to break the proposed protocol in the generic algorithm model.