Home > Research > Publications & Outputs > A new family of rank codes and applications to ...

Research

Associated organisational units

Links

Text available via DOI:

View graph of relations

A new family of rank codes and applications to cryptography

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

Published

Standard

A new family of rank codes and applications to cryptography. / Gabidulin, E. M.; Ourivski, A. V.; Honary, Bahram et al.
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on. Lausanne, Switzerland : IEEE, 2002. p. 268.

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

Harvard

Gabidulin, EM, Ourivski, AV, Honary, B & Ammar, B 2002, A new family of rank codes and applications to cryptography. in Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on. IEEE, Lausanne, Switzerland , pp. 268. https://doi.org/10.1109/ISIT.2002.1023540

APA

Gabidulin, E. M., Ourivski, A. V., Honary, B., & Ammar, B. (2002). A new family of rank codes and applications to cryptography. In Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on (pp. 268). IEEE. https://doi.org/10.1109/ISIT.2002.1023540

Vancouver

Gabidulin EM, Ourivski AV, Honary B, Ammar B. A new family of rank codes and applications to cryptography. In Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on. Lausanne, Switzerland : IEEE. 2002. p. 268 doi: 10.1109/ISIT.2002.1023540

Author

Gabidulin, E. M. ; Ourivski, A. V. ; Honary, Bahram et al. / A new family of rank codes and applications to cryptography. Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on. Lausanne, Switzerland : IEEE, 2002. pp. 268

Bibtex

@inproceedings{e52cd5986e3e468ea83bf0e03faa00aa,
title = "A new family of rank codes and applications to cryptography",
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.",
author = "Gabidulin, {E. M.} and Ourivski, {A. V.} and Bahram Honary and Bassem Ammar",
year = "2002",
month = jul,
doi = "10.1109/ISIT.2002.1023540",
language = "English",
isbn = "0-7803-7501-7",
pages = "268",
booktitle = "Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - A new family of rank codes and applications to cryptography

AU - Gabidulin, E. M.

AU - Ourivski, A. V.

AU - Honary, Bahram

AU - Ammar, Bassem

PY - 2002/7

Y1 - 2002/7

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

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

U2 - 10.1109/ISIT.2002.1023540

DO - 10.1109/ISIT.2002.1023540

M3 - Conference contribution/Paper

SN - 0-7803-7501-7

SP - 268

BT - Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

PB - IEEE

CY - Lausanne, Switzerland

ER -