Gabidulin, E. M. and Ourivski, A. V. and Honary, Bahram and Ammar, Bassem (2002) A new family of rank codes and applications to cryptography. In: Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on. IEEE, Lausanne, Switzerland, p. 268. ISBN 0-7803-7501-7
Full text not available from this repository.Abstract
We present a new family of so called reducible rank codes. For lengths n that are multiples of N the family contains optimal codes over FN. A public key cryptosystem using these codes is proposed. To make the system resistant to structural attacks, row and column scramblers are used, as well as a special form of distortion matrix. A preliminary analysis shows that the system is secure against known attacks for keys greater than 20 Kbits.