Gabidulin, E. M. and Ourivski, A. V. and Honary, Bahram and Ammar, B. (2004) Reducible Rank Codes and Their Applications to Cryptography. IEEE Transactions on Information Theory, 49 (12). pp. 3289-3293. ISSN 0018-9448Full text not available from this repository.
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.
|Journal or Publication Title:||IEEE Transactions on Information Theory|
|Additional Information:||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|
|Uncontrolled Keywords:||DCS-publications-id ; art-724 ; DCS-publications-credits ; coding ; DCS-publications-personnel-id ; 1 ; 28|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Departments:||Faculty of Science and Technology > School of Computing & Communications|
|Deposited On:||27 Mar 2008 15:23|
|Last Modified:||20 Feb 2017 01:29|
Actions (login required)