Group-based cryptography: Age of Innocence. A linear decomposition attack

We prove that schemes of the group-based cryptography based on the conjugacy search problem and other discrete logarithm-type problems in matrix (semi)groups are tractable in many known cases.