Home > Research > Publications & Outputs > Reducible Rank Codes and Their Applications to ...

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

Reducible Rank Codes and Their Applications to Cryptography.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Reducible Rank Codes and Their Applications to Cryptography. / Gabidulin, E. M.; Ourivski, A. V.; Honary, Bahram et al.
In: IEEE Transactions on Information Theory, Vol. 49, No. 12, 01.01.2004, p. 3289-3293.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Gabidulin, EM, Ourivski, AV, Honary, B & Ammar, B 2004, 'Reducible Rank Codes and Their Applications to Cryptography.', IEEE Transactions on Information Theory, vol. 49, no. 12, pp. 3289-3293. https://doi.org/10.1109/TIT.2003.820038

APA

Gabidulin, E. M., Ourivski, A. V., Honary, B., & Ammar, B. (2004). Reducible Rank Codes and Their Applications to Cryptography. IEEE Transactions on Information Theory, 49(12), 3289-3293. https://doi.org/10.1109/TIT.2003.820038

Vancouver

Gabidulin EM, Ourivski AV, Honary B, Ammar B. Reducible Rank Codes and Their Applications to Cryptography. IEEE Transactions on Information Theory. 2004 Jan 1;49(12):3289-3293. doi: 10.1109/TIT.2003.820038

Author

Gabidulin, E. M. ; Ourivski, A. V. ; Honary, Bahram et al. / Reducible Rank Codes and Their Applications to Cryptography. In: IEEE Transactions on Information Theory. 2004 ; Vol. 49, No. 12. pp. 3289-3293.

Bibtex

@article{c57c74d385de4c2eacfa1a9a0277fb46,
title = "Reducible Rank Codes and Their Applications to Cryptography.",
abstract = "We present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler {"}mixes{"} columns of a generator (parity-check) matrix of a code. It makes the system more resistant to structural attacks such as Gibson's attacks. Possible attacks on the system are thoroughly studied. The system is found to be secure against known attacks for public keys of about 16 kbits and greater.",
keywords = "DCS-publications-id, art-724, DCS-publications-credits, coding, DCS-publications-personnel-id, 1, 28",
author = "Gabidulin, {E. M.} and Ourivski, {A. V.} and Bahram Honary and B. Ammar",
note = "This collaborative work with the Moscow Institute of Physics and Technology, Russia, introduces a new class of Combined Coding and Encryption with application to the Public Key Crypto System with short Key size and low Complexity. This novel idea will play a big role in future wireless communication systems, (for example TETRA V2, this can be verified by Dr M. Noori, the Chairman of WG4-TETRA for ETSI). RAE_import_type : Journal article RAE_uoa_type : Electrical and Electronic Engineering",
year = "2004",
month = jan,
day = "1",
doi = "10.1109/TIT.2003.820038",
language = "English",
volume = "49",
pages = "3289--3293",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

RIS

TY - JOUR

T1 - Reducible Rank Codes and Their Applications to Cryptography.

AU - Gabidulin, E. M.

AU - Ourivski, A. V.

AU - Honary, Bahram

AU - Ammar, B.

N1 - This collaborative work with the Moscow Institute of Physics and Technology, Russia, introduces a new class of Combined Coding and Encryption with application to the Public Key Crypto System with short Key size and low Complexity. This novel idea will play a big role in future wireless communication systems, (for example TETRA V2, this can be verified by Dr M. Noori, the Chairman of WG4-TETRA for ETSI). RAE_import_type : Journal article RAE_uoa_type : Electrical and Electronic Engineering

PY - 2004/1/1

Y1 - 2004/1/1

N2 - We present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler "mixes" columns of a generator (parity-check) matrix of a code. It makes the system more resistant to structural attacks such as Gibson's attacks. Possible attacks on the system are thoroughly studied. The system is found to be secure against known attacks for public keys of about 16 kbits and greater.

AB - We present a new family of so-called reducible rank codes which are a generalization of rank product codes . This family includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. We give methods for encoding and decoding reducible rank codes. A public key cryptosystem based on these codes and on the idea of a column scrambler is proposed. The column scrambler "mixes" columns of a generator (parity-check) matrix of a code. It makes the system more resistant to structural attacks such as Gibson's attacks. Possible attacks on the system are thoroughly studied. The system is found to be secure against known attacks for public keys of about 16 kbits and greater.

KW - DCS-publications-id

KW - art-724

KW - DCS-publications-credits

KW - coding

KW - DCS-publications-personnel-id

KW - 1

KW - 28

U2 - 10.1109/TIT.2003.820038

DO - 10.1109/TIT.2003.820038

M3 - Journal article

VL - 49

SP - 3289

EP - 3293

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 12

ER -