By Topic

A new family of rank codes and applications to cryptography

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Gabidulin, Ernst ; Moscow Inst. of Phys. & Technol., Russia ; Ourivski, A. ; Honary, B. ; Ammar, B.

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.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002