DocumentCode :
2057414
Title :
A new family of rank codes and applications to cryptography
Author :
Gabidulin, Ernst ; Ourivski, Alexei ; Honary, Bahram ; Ammar, Bassem
Author_Institution :
Moscow Inst. of Phys. & Technol., Russia
fYear :
2002
fDate :
2002
Firstpage :
268
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.
Keywords :
codes; matrix algebra; public key cryptography; column scramblers; cryptography; distortion matrix; optimal codes; public key cryptosystem; reducible rank codes; row scramblers; structural attacks; Computer science; Conferences; Decoding; Information rates; Matrix decomposition; Physics; Public key; Public key cryptography;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
Type :
conf
DOI :
10.1109/ISIT.2002.1023540
Filename :
1023540
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2057414
بازگشت