Multi-Party Key Agreement Protocols using Conjugacy Search Problem in Five Dimensional Discrete Heisenberg Group

The secrete way of communicating information between entities is the science known as cryptography. In order to communicate the message through an insecure medium the communicating entities need a cryptographic keys. The process of getting a common shared key is the Key agreement Protocol. This paper proposes a multi party key agreement protocol which provides a common key between the communicating parties using conjugacy Search Problem (CSP). To implement this protocol a platform group is required. The five dimensional Discrete Heisenberg Group(DHG) is chosen as the platform group and the conjugacy search problem (CSP) taken from combinatorial group theory acts as the one way function. As a particular case a five party KAP with numerical computation is provided. In general, multiparty CSP with k communicating parties can get a common key in k-1 rounds.