Modified Niederreiter type of GPT cryptosystem based on reducible rank codes

Khan, Eraj and Gabidulin, E. M. and Honary, Bahram and Ahmed, Hassan (2014) Modified Niederreiter type of GPT cryptosystem based on reducible rank codes. Designs Codes and Cryptography, 70 (1-2). pp. 231-239. ISSN 1573-7586

Full text not available from this repository.

Abstract

GPT public key cryptosystem was proposed by Gabidulin, Paramonov and Tretjakov in 1991. This cryptosystem is based on rank error correcting codes. The main advantage of using rank codes in cryptography is that, it has smaller key size as compared to other code based public key cryptosystems. Several attacks against this system were published and some modifications were also proposed withstanding these attacks. In this paper, we have proposed a modified Niederreiter type GPT cryptosystem based on reducible rank codes by properly choosing the column scrambler matrix to withstand these attacks. Although, the idea of choosing column scrambler matrix from extension field is not new but the approach proposed in this paper, provides more elements of column scrambler matrix from extension field as compared to any previous modifications which makes system more secure against attacks.

Item Type:
Journal Article
Journal or Publication Title:
Designs Codes and Cryptography
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1700/1706
Subjects:
ID Code:
60576
Deposited By:
Deposited On:
10 Dec 2012 13:19
Refereed?:
Yes
Published?:
Published
Last Modified:
16 Nov 2020 03:25