DocumentCode :
3065974
Title :
A Smart approach for GPT cryptosystem based on rank codes
Author :
Rashwan, Haitham ; Gabidulin, Ernst M. ; Honary, Bahram
Author_Institution :
Dept. of Commun., Lancaster Univ., Lancaster, UK
fYear :
2010
fDate :
13-18 June 2010
Firstpage :
2463
Lastpage :
2467
Abstract :
The concept of Public-key cryptosystem was innovated by McEliece´s cryptosystem. The public key cryptosystem based on rank codes was presented in 1991 by Gabidulin -Paramonov-Trejtakov (GPT). The use of rank codes in cryptographic applications is advantageous since it is practically impossible to utilize combinatoric decoding. This has enabled using public keys of a smaller size. Respective structural attacks against this system were proposed by Gibson and recently by Overbeck. Overbeck´s attacks break many versions of the GPT cryptosystem and are turned out to be either polynomial or exponential depending on parameters of the cryptosystem. In this paper, we introduce a new approach, called the Smart approach, which is based on a proper choice of the distortion matrix X. The Smart approach allows for withstanding all known attacks even if the column scrambler matrix P over the base field Fq.
Keywords :
decoding; matrix algebra; public key cryptography; GPT cryptosystem smart approach; Gabidulin-Paramonov-Trejtakov cryptosystem; McEliece cryptosystem; column scrambler matrix; combinatoric decoding; distortion matrix; public-key cryptosystem; rank codes; respective structural attacks; Combinatorial mathematics; Decoding; Error correction codes; Physics; Polynomials; Proposals; Public key; Public key cryptography; Reed-Solomon codes; Robustness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
Type :
conf
DOI :
10.1109/ISIT.2010.5513549
Filename :
5513549
Link To Document :
بازگشت