Home > Research > Publications & Outputs > A new family of rank codes and applications to ...
View graph of relations

A new family of rank codes and applications to cryptography

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Close
Publication date07/2002
Host publicationInformation Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Place of PublicationLausanne, Switzerland
PublisherIEEE
Pages268
Number of pages1
ISBN (Print)0-7803-7501-7
<mark>Original language</mark>English

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.