Home > Research > Publications & Outputs > Modified Niederreiter type of GPT cryptosystem ...
View graph of relations

Modified Niederreiter type of GPT cryptosystem based on reducible rank codes

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Modified Niederreiter type of GPT cryptosystem based on reducible rank codes. / Khan, Eraj; Gabidulin, E. M.; Honary, Bahram et al.
In: Designs Codes and Cryptography, Vol. 70, No. 1-2, 01.2014, p. 231-239.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Khan, E, Gabidulin, EM, Honary, B & Ahmed, H 2014, 'Modified Niederreiter type of GPT cryptosystem based on reducible rank codes', Designs Codes and Cryptography, vol. 70, no. 1-2, pp. 231-239. https://doi.org/10.1007/s10623-012-9757-4

APA

Vancouver

Khan E, Gabidulin EM, Honary B, Ahmed H. Modified Niederreiter type of GPT cryptosystem based on reducible rank codes. Designs Codes and Cryptography. 2014 Jan;70(1-2):231-239. Epub 2012 Nov 30. doi: 10.1007/s10623-012-9757-4

Author

Khan, Eraj ; Gabidulin, E. M. ; Honary, Bahram et al. / Modified Niederreiter type of GPT cryptosystem based on reducible rank codes. In: Designs Codes and Cryptography. 2014 ; Vol. 70, No. 1-2. pp. 231-239.

Bibtex

@article{e4536fc10d0f41f7ab5eec184d208ae7,
title = "Modified Niederreiter type of GPT cryptosystem based on reducible rank codes",
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.",
keywords = "GPT cryptosystem , Rank codes , Reducible rank codes, Column scrambler",
author = "Eraj Khan and Gabidulin, {E. M.} and Bahram Honary and Hassan Ahmed",
year = "2014",
month = jan,
doi = "10.1007/s10623-012-9757-4",
language = "English",
volume = "70",
pages = "231--239",
journal = "Designs Codes and Cryptography",
issn = "1573-7586",
publisher = "Springer Netherlands",
number = "1-2",

}

RIS

TY - JOUR

T1 - Modified Niederreiter type of GPT cryptosystem based on reducible rank codes

AU - Khan, Eraj

AU - Gabidulin, E. M.

AU - Honary, Bahram

AU - Ahmed, Hassan

PY - 2014/1

Y1 - 2014/1

N2 - 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.

AB - 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.

KW - GPT cryptosystem

KW - Rank codes

KW - Reducible rank codes

KW - Column scrambler

U2 - 10.1007/s10623-012-9757-4

DO - 10.1007/s10623-012-9757-4

M3 - Journal article

VL - 70

SP - 231

EP - 239

JO - Designs Codes and Cryptography

JF - Designs Codes and Cryptography

SN - 1573-7586

IS - 1-2

ER -