Home > Research > Publications & Outputs > On improving security of GPT cryptosystems

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

On improving security of GPT cryptosystems

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

On improving security of GPT cryptosystems. / Rashwan, Haitham; Honary, Bahram; Gabidulin, E. M.
Information Theory, 2009. ISIT 2009. IEEE International Symposium on. Seoul, Korea: IEEE, 2009. p. 1110–1114.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Rashwan, H, Honary, B & Gabidulin, EM 2009, On improving security of GPT cryptosystems. in Information Theory, 2009. ISIT 2009. IEEE International Symposium on. IEEE, Seoul, Korea, pp. 1110–1114. https://doi.org/10.1109/ISIT.2009.5206029

APA

Rashwan, H., Honary, B., & Gabidulin, E. M. (2009). On improving security of GPT cryptosystems. In Information Theory, 2009. ISIT 2009. IEEE International Symposium on (pp. 1110–1114). IEEE. https://doi.org/10.1109/ISIT.2009.5206029

Vancouver

Rashwan H, Honary B, Gabidulin EM. On improving security of GPT cryptosystems. In Information Theory, 2009. ISIT 2009. IEEE International Symposium on. Seoul, Korea: IEEE. 2009. p. 1110–1114 doi: 10.1109/ISIT.2009.5206029

Author

Rashwan, Haitham ; Honary, Bahram ; Gabidulin, E. M. / On improving security of GPT cryptosystems. Information Theory, 2009. ISIT 2009. IEEE International Symposium on. Seoul, Korea : IEEE, 2009. pp. 1110–1114

Bibtex

@inproceedings{8a1aa9518891460d85c685b6f8ab97c5,
title = "On improving security of GPT cryptosystems",
abstract = "The public key cryptosystem based on rank error correcting codes (the GPT cryptosystem) was proposed in 1991. Use of rank codes in cryptographic applications is advantageous since it is practically impossible to utilize combinatoric decoding. This enabled using public keys of a smaller size. Several attacks against this system were published, including Gibson's attacks and more recently Overbeck's attacks. A few modifications were proposed withstanding Gibson's attack but at least one of them was broken by the stronger attacks by Overbeck. A tool to prevent Overbeck's attack is presented in. In this paper, we apply this approach to other variants of the GPT cryptosystem.",
author = "Haitham Rashwan and Bahram Honary and Gabidulin, {E. M.}",
year = "2009",
month = jun,
doi = "10.1109/ISIT.2009.5206029",
language = "English",
isbn = "978-1-4244-4312-3",
pages = "1110–1114",
booktitle = "Information Theory, 2009. ISIT 2009. IEEE International Symposium on",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - On improving security of GPT cryptosystems

AU - Rashwan, Haitham

AU - Honary, Bahram

AU - Gabidulin, E. M.

PY - 2009/6

Y1 - 2009/6

N2 - The public key cryptosystem based on rank error correcting codes (the GPT cryptosystem) was proposed in 1991. Use of rank codes in cryptographic applications is advantageous since it is practically impossible to utilize combinatoric decoding. This enabled using public keys of a smaller size. Several attacks against this system were published, including Gibson's attacks and more recently Overbeck's attacks. A few modifications were proposed withstanding Gibson's attack but at least one of them was broken by the stronger attacks by Overbeck. A tool to prevent Overbeck's attack is presented in. In this paper, we apply this approach to other variants of the GPT cryptosystem.

AB - The public key cryptosystem based on rank error correcting codes (the GPT cryptosystem) was proposed in 1991. Use of rank codes in cryptographic applications is advantageous since it is practically impossible to utilize combinatoric decoding. This enabled using public keys of a smaller size. Several attacks against this system were published, including Gibson's attacks and more recently Overbeck's attacks. A few modifications were proposed withstanding Gibson's attack but at least one of them was broken by the stronger attacks by Overbeck. A tool to prevent Overbeck's attack is presented in. In this paper, we apply this approach to other variants of the GPT cryptosystem.

U2 - 10.1109/ISIT.2009.5206029

DO - 10.1109/ISIT.2009.5206029

M3 - Conference contribution/Paper

SN - 978-1-4244-4312-3

SP - 1110

EP - 1114

BT - Information Theory, 2009. ISIT 2009. IEEE International Symposium on

PB - IEEE

CY - Seoul, Korea

ER -