The Anshel–Anshel–Goldfeld (AAG) key exchange protocol is based upon the multiple conjugacy problem for a finitely-presented group. The hardness in breaking this protocol relies on the supposed difficulty in solving the
corresponding equations for the conjugating element in the group. Two such protocols based on polycyclic groups as a platform were recently proposed and were shown to be resistant to length-based attack. In this article we propose a parallel evolutionary approach which runs on multicore high-performance architectures. The approach is shown to be more efficient than previous attempts to break these protocols, and also more successful. Comprehensive data of experiments run with a GAP implementation are provided and compared to the results of earlier length-based attacks.
These demonstrate that the proposed platform is not as secure as first thought and also show that existing measures of cryptographic complexity are not optimal. A more accurate alternative measure is suggested. Finally, a linear algebra attack for one of the protocols is introduced.
Garber D., Kaplan S., Teicher M., Tsaban B. and Vishne U.,
Length-based conjugacy search in the braid group,
Algebraic Methods in Cryptography,
Contemp. Math. 418,
American Mathematical Society, Providence (2006), 75–88.
Garside F. A.,
The braid group and other groups,
Quart. J. Math. Oxford 20 (1969), 235–254.
Kahrobaei D. and Lam H. T.,
Heisenberg groups as platform for the AAG key-exchange protocol,
Proceedings of the 22nd International Conference on Network Protocols (ICNP),
IEEE Press, Piscataway (2014), 660–664.
Ko K., Lee S., Cheon J., Han J., Kang J. and Park C.,
New public-key cryptosystem using braid groups,
Lecture Notes in Comput. Sci. 1880,
Springer Berlin (2000), 166–183.
Kotov M. and Ushakov A.,
Analysis of a certain polycyclic group-based cryptosystem,
J. Math. Cryptol. 9 (2015), 161–167.
Myasnikov A. D. and Ushakov A.,
Length based attack and braid groups: Cryptanalysis of Anshel–Anshel–Goldfeld key exchange protocol,
Public Key Cryptography,
Lecture Notes in Comput. Sci. 4450,
Springer, Berlin (2007), 76–88.
Myasnikov A. G. and Ushakov A.,
Random subgroups and analysis of the length-based and quotient attacks,
J. Math. Cryptol. 2 (2008), no. 1, 29–61.
Nikolaev A. and Blaney K. R.,
A PTIME solution to the restricted conjugacy problem in generalized heisenberg groups,
Groups Complex. Cryptol. 8 (2016), no. 1, 69–74.
Ruinskiy D., Shamir A. and Tsaban B.,
Length-based cryptanalysis: The case of Thompson’s group,
J. Math. Crypt. 1 (2007), 359–372.
Parallel evolutionary algorithms,
Handbook of Computational Intelligence,
Springer, Berlin (2015), 929–959.
Groups – Complexity – Cryptology is a journal for speedy publication of articles in the areas of combinatorial and computational group theory, computer algebra, complexity theory, and cryptology. GCC primarily publishes research papers, but comprehensive and timely survey articles on a topic inside the scope of the journal are also welcome.