A New Key Agreement Scheme Based on the Triple Decomposition Problem
Yesem Kurt-Peker · International journal of network security · 2014
A new key agreement scheme based on the triple de-composition problem over non-commutative platforms is presented. A realization of the new scheme over braid groups is provided and the strengths of it over earlier systems that rely on similar decomposition problems are discussed. The new scheme improves over the earlier systems over braid groups by countering the linear algebra and length based attacks to the decomposition problem in braid groups.