Security of GPT-like public-key cryptosystems based on linear rank codes

Recent structural attacks on the GPT cryptosystem and variants are reviewed. The equivalency of different forms of cryptosystems is shown and the general form for the purpose of cryptanalysis is stated. The published structural attacks are turned out to be either polynomial, or exponential, depending on parameters of the cryptosystem. The secure choice of parameters is suggested for avoiding polynomial attacks.