Abstract :
The available key agreement schemes using number theoretic, elliptic curves etc are common for cryptanalysts
and associated security is vulnerable. This vulnerability further increases when we talk about modern efficient
computers. So there is a need of providing new mechanism for key agreement with different properties so intruders get surprised and communication scenarios becomes stronger than before. In this paper, we propose a key agreement protocol which works in a non commutative group. We prove that our protocol meets the desired security attributes under the assumption that Conjugacy Search Problem and Decomposition Problem are hard in non commutative groups.
Keyword :
Conjugacy Search Problem, Decomposition Problem, Key Agreement, Non Commutative Groups, Wireless Communication