A key agreement protocol based on group actions

Abstract

The key agreement scheme is an important part of the cryptography theory. The first study in this field belongs to Diffie–Hellman and Merkle. We present a new key agreement scheme using a group action of special orthogonal group of 2 × 2 matrices with real entries on the complex projective line.

Quantum Circuit Optimization for Solving Discrete Logarithm of Binary Elliptic Curves Obeying the Nearest-Neighbor Constrained

“…It seems more difficult to deal with the problem for solving discrete logarithm in than in . The key agreement represents the protocol in which two or more parties together generate a secret key using a public channel [ 1 , 2 , 3 ]. For instance, better security can be achieved in Diffie–Hellman Key exchange by choosing a suitable elliptic curve in than in when p has 512 bits.…”