**A new key exchange protocol based on the decomposition problem**

*Vladimir Shpilrain and Alexander Ushakov*

**Abstract: **In this paper we present a new key establishment protocol based on the decomposition problem in non-commutative groups which is: given two elements w, w_1 of the platform group G and two subgroups A, B of G (not necessarily distinct), find elements a in A, b in B such that w_1 = a w b. Here we introduce two new ideas that improve the security of key establishment protocols based on the decomposition problem.
In particular, we conceal (i.e., do not publish explicitly) one of the subgroups A, B, thus introducing an additional computationally hard problem for the adversary, namely, finding the centralizer of a given
finitely generated subgroup.

**Category / Keywords: **public-key cryptography /

**Date: **received 8 Dec 2005

**Contact author: **shpil at groups sci ccny cuny edu

**Available format(s): **PDF | BibTeX Citation

**Version: **20051208:160406 (All versions of this report)

**Short URL: **ia.cr/2005/447

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]