Attacks and counter-attacks on the GPT public key cryptosystem
Designs, Codes and Cryptography
On improving security of GPT cryptosystems
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Extending gibson's attacks on the GPT cryptosystem
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
A new structural attack for GPT and variants
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Designing an efficient and secure public-key cryptosystem based on reducible rank codes
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Designing a rank metric based mceliece cryptosystem
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Asymptotic behaviour of codes in rank metric over finite fields
Designs, Codes and Cryptography
Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
Designs, Codes and Cryptography
| Hi-index | 754.84 |
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 nN in the field FN. 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.