Code-based cryptosystems using generalized concatenated codes
From MaRDI portal
Abstract: The security of public-key cryptosystems is mostly based on number theoretic problems like factorization and the discrete logarithm. There exists an algorithm which solves these problems in polynomial time using a quantum computer. Hence, these cryptosystems will be broken as soon as quantum computers emerge. Code-based cryptography is an alternative which resists quantum computers since its security is based on an NP-complete problem, namely decoding of random linear codes. The McEliece cryptosystem is the most prominent scheme to realize code-based cryptography. Many codeclasses were proposed for the McEliece cryptosystem, but most of them are broken by now. Sendrier suggested to use ordinary concatenated codes, however, he also presented an attack on such codes. This work investigates generalized concatenated codes to be used in the McEliece cryptosystem. We examine the application of Sendrier's attack on generalized concatenated codes and present alternative methods for both partly finding the code structure and recovering the plaintext from a cryptogram. Further, we discuss modifications of the cryptosystem making it resistant against these attacks.
Recommendations
Cites work
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 3485627 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A public-key cryptosystem based on binary Reed-Muller codes
- Class of constructive asymptotically good algebraic codes
- Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes
- Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
- Cryptanalysis of the Sidelnikov Cryptosystem
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- How to mask the structure of codes for a cryptographic use
- Information-set decoding for linear codes over F_q
- Matrix Representation of Finite Fields
- McEliece public key cryptosystems using algebraic-geometric codes
- New directions in cryptography
- On the concatenated structure of a linear code
- On the concatenated structures of a [49,18,12] binary abelian code
- On the edge-independence number and edge-covering number for regular graphs
- On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
- The complexity of information set decoding
Cited in
(7)- scientific article; zbMATH DE number 1866859 (Why is no real title available?)
- On new problems in asymmetric cryptography based on error-resistant coding
- On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes
- Code-based cryptography
- On the Berger-Loidreau cryptosystem on the tensor product of codes
- Quantum McEliece public-key cryptosystem
- McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks
This page was built for publication: Code-based cryptosystems using generalized concatenated codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4610024)
