Ideals over a non-commutative ring and their application in cryptology

Authors:
E. M. Gabidulin;A. V. Paramonov;O. V. Tretjakov
Affiliations:
Moscow Institute of Physics and Technology, Moscow Region, USSR;Moscow Institute of Physics and Technology, Moscow Region, USSR;Moscow Institute of Physics and Technology, Moscow Region, USSR
Venue:
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Year:
1991

Citing 3
Cited 12

An observation on the security of McEliece's public-key cryptosystem

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Perfect local randomness in pseudo-random sequences

CRYPTO '89 Proceedings on Advances in cryptology
Security-Related Comments Regarding McEliece's Public-Key Cryptosystem

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology

Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Constant-rank codes and their connection to constant-dimension codes

IEEE Transactions on Information Theory
A welch–berlekamp like algorithm for decoding gabidulin codes

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
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
Algebraic cryptanalysis of mceliece variants with compact keys

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Designing a rank metric based mceliece cryptosystem

PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Research note: A secret-key cipher based on a non-linear structured code

Computer Communications
Rank subcodes in multicomponent network coding

Problems of Information Transmission
Information security in a random network coding network

Problems of Information Transmission
Modified Niederreiter type of GPT cryptosystem based on reducible rank codes

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.06

Visualization

Abstract

A new modification of the McEliece public-key cryptosystem is proposed that employs the so-called maximum-rank-distance (MRD) codes in place of Goppa codes and that hides the generator matrix of the MRD code by addition of a randomly-chosen matrix. A short review of the mathematical background required for the construction of MRD codes is given. The cryptanalytic work function for the modified McEliece system is shown to be much greater than that of the original system. Extensions of the rank metric are also considered.