How to Mask the Structure of Codes for a Cryptographic Use

Authors:
Thierry P. Berger;Pierre Loidreau
Affiliations:
LACO, Département de Mathématiques, Université de Limoges, France;Unite de Mathématiques, Appliquées, National Institute of Advanced Technologies (ENSTA), France
Venue:
Designs, Codes and Cryptography
Year:
2005

Citing 8
Cited 13

On generator matrices of MDS codes

IEEE Transactions on Information Theory
The automorphism groups of Reed-Solomon codes

Journal of Combinatorial Theory Series A
An observation on the security of McEliece's public-key cryptosystem

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Severely denting the Gabidulin version of the McEliece public key cryptosystem

Designs, Codes and Cryptography
The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
The security of the Gabidulin public key cryptosystem

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

IEEE Transactions on Information Theory
Weak keys in the McEliece public-key cryptosystem

IEEE Transactions on Information Theory

Erasure Decoding for Gabidulin Codes

Journal of Mathematical Modelling and Algorithms
A new structural attack for GPT and variants

Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Algebraic cryptanalysis of mceliece variants with compact keys

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Cryptanalysis of the niederreiter public key scheme based on GRS subcodes

PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Information-set decoding for linear codes over Fq

PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Designing a rank metric based mceliece cryptosystem

PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
An attack on a modified niederreiter encryption scheme

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Wild mceliece incognito

PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Efficient implementation of a CCA2-Secure variant of mceliece using generalized srivastava codes

PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Solutions for the storage problem of mceliece public and private keys on memory-constrained platforms

ISC'12 Proceedings of the 15th international conference on Information Security
The non-gap sequence of a subcode of a generalized Reed---Solomon code

Designs, Codes and Cryptography
On the unique representation of very strong algebraic geometry codes

Designs, Codes and Cryptography
Computational aspects of retrieving a representation of an algebraic geometry code

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show how to strengthen public-key cryptosystems against known attacks, together with the reduction of the public-key. We use properties of subcodes to mask the structure of the codes used by the conceiver of the system. We propose new parameters for the cryptosystems and even a modified Niederreiter cryptosystem in the case of Gabidulin codes, with a public-key size of less than 4000 bits.