Linear decomposition attack on public key exchange protocols using semidirect products of (semi)groups

We show that a linear decomposition attack based on the decomposition method introduced by the author works by finding the exchanged secret keys in all main protocols using semidirect products of (semi)grops proposed by Kahrobaei, Shpilrain, Habeeb, Koupparis and Lam.

[1]  Vitaly Roman'kov.  A polynomial algorithm for the braid double shielded public key cryptosystems , 2014 .

[2]  Vladimir Shpilrain,et al.  A new key exchange protocol based on the decomposition problem , 2005, IACR Cryptol. ePrint Arch..

[3]  José-Francisco Vicent,et al.  A matricial public key cryptosystem with digital signature , 2008 .

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

[5]  Eberhard Stickel,et al.  A New Method for Exchanging Secret Keys , 2005, Third International Conference on Information Technology and Applications (ICITA'05).

[6]  Ha T. Lam,et al.  Public key exchange using extensions by endomorphisms and matrices over a Galois field , 2014 .

[7]  Zhenfu Cao,et al.  New Constructions of Public-Key Encryption Schemes from Conjugacy Search Problems , 2010, Inscrypt.

[8]  S. K. Rososhek.  Cryptosystems in automorphism groups of group rings of Abelian groups , 2008 .

[9]  Alexei G. Myasnikov,et al.  A linear decomposition attack , 2014, Groups Complex. Cryptol..

[10]  Xiaofeng Wang,et al.  Double shielded Public Key Cryptosystems , 2014, IACR Cryptol. ePrint Arch..

[11]  V. A. Romankov.  Cryptanalysis of some schemes applying automorphisms , 2013 .

[12]  Delaram Kahrobaei,et al.  Public Key Exchange Using Semidirect Product of (Semi)Groups , 2013, ACNS.

[13]  Ayan Mahalanobis,et al.  The Diffie-Hellman key exchange protocol and non-abelian nilpotent groups , 2006, IACR Cryptol. ePrint Arch..