A new key exchange protocol based on the decomposition problem

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 \subseteq 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.

[1]  Vladimir Shpilrain,et al.  Combinatorial Group Theory and Public Key Cryptography , 2004, Applicable Algebra in Engineering, Communication and Computing.

[2]  J. González-Meneses,et al.  Computation of Centralizers in Braid groups and Garside groups , 2002, math/0201243.

[3]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

[4]  Vladimir Shpilrain,et al.  Thompson's Group and Public Key Cryptography , 2005, ACNS.

[5]  Robert R. Alfano,et al.  Recent Advances in the Uses of Light in Physics, Chemistry, Engineering, and Medicine: 19-21 June 1991, the City College of New York , 1992 .

[6]  V. Shpilrain,et al.  USING THE SUBGROUP MEMBERSHIP SEARCH PROBLEM IN PUBLIC KEY CRYPTOGRAPHY , 2005 .

[7]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[8]  Allen R. Tannenbaum,et al.  Length-Based Attacks for Certain Group Based Encryption Rewriting Systems , 2003, IACR Cryptol. ePrint Arch..

[9]  D. Goldfeld,et al.  An algebraic method for public-key cryptography , 1999 .

[10]  Dima Grigoriev,et al.  Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits , 2003, Applicable Algebra in Engineering, Communication and Computing.

[11]  David Garber,et al.  Probabilistic Solutions of Equations in the Braid Group , 2005, Adv. Appl. Math..

[12]  J. Birman.  Braids, Links, and Mapping Class Groups. , 1975 .

[13]  Rosario Gennaro,et al.  Cryptanalysis of a Pseudorandom Generator Based on Braid Groups , 2002, EUROCRYPT.

[14]  Alexei G. Myasnikov,et al.  A Practical Attack on a Braid Group Based Cryptographic Protocol , 2005, CRYPTO.

[15]  Jung Hee Cheon,et al.  An Efficient Implementation of Braid Groups , 2001, ASIACRYPT.

[16]  Scott H. Murray,et al.  Generating random elements of a finite group , 1995 .

[17]  Joan S. Birman,et al.  A new approach to the word and conjugacy problems in the braid groups , 1997 .

[18]  Dennis Hofheinz,et al.  A Practical Attack on Some Braid Group Based Cryptographic Primitives , 2003, Public Key Cryptography.

[19]  Jung Hee Cheon,et al.  New Public-Key Cryptosystem Using Braid Groups , 2000, CRYPTO.