A NEW MULTI PARTY KEY AGREEMENT PROTOCOL USING SEARCH PROBLEMS IN DISCRETE HEISENBERG GROUP.Multi-Party Key Agreement Protocol • February 24th, 2012
Contract Type FiledFebruary 24th, 2012In this paper we present a multi-party Key Agreement Protocol (KAP) using some of the search problems such as Factorization Search Problem , Decomposition Search Problem Conjugacy Search Problem and Twisted Conjugacy Problem. We have chosen Discrete Heisenberg group as our platform group in the above search problems.