A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes

  title={A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes},
  author={Marco Baldi and Marco Bodrato and Franco Chiaraluce},
We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem, based on Goppa codes, is still unbroken up to now, but has two major drawbacks: long key and low transmission rate. Our variant is based on QC-LDPC codes and is able to overcome such drawbacks, while avoiding the known attacks. Recently, however, a new attack has been discovered that can recover the private key with limited complexity. We show that such attack can be… 
Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes
The framework of the McEliece cryptos system based on low-density parity-check (LDPC) codes is considered, which is a promising post-quantum alternative to classical public key cryptosystems and the possible use of irregular transformation matrices is investigated, which increases the efficiency of the system, especially in regard to the public key size.
Design of McEliece Cryptosystem Based on QC-MDPC Codes
  • Guangfu Wu, Rui Yang, Ziheng Dai
  • Computer Science
    2020 IEEE 3rd International Conference on Electronic Information and Communication Technology (ICEICT)
  • 2020
This paper uses QC-MDPC codes instead of Goppa codes to reduce the key sizes and improve the decoding algorithm, which can resist all kinds of attacks.
LDPC Codes in the McEliece Cryptosystem: Attacks and Countermeasures
  • M. Baldi
  • Computer Science
    Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes
  • 2009
It is shown that the new QC-LDPC codes-based McEliece cryptosystem scales favorably with the key length, and their ability to counter all the currently known attacks is discussed.
Simple Power Analysis Attack on the QC-LDPC McEliece Cryptosystem
This paper considers a naive implementation of the decryption algorithm in the QC-LDPC McEliece cryptosystem and demonstrates that this implementation leaks information about positions of ones in the secret matrix Q, which allows an attacker to completely recover the matrix Q.
QC-LDPC Code-Based Cryptosystems
In this chapter, the use of QC-LDPC codes in public key cryptosystems inspired to the McEliece and Niederreiter systems is studied and it is shown that theUse of this kind of codes may expose the system to new attacks, which can be very dangerous if the system is not suitably designed.
Implementing QC-MDPC McEliece Encryption
It is concluded that McEliece encryption in combination with QC-MDPC codes not only enables high-performance implementations but also allows for lightweight designs on a wide range of different platforms.
A New variant of the McEliece cryptosystem based on the Smith form of convolutional codes
A new version of the McEliece cryptosystem based on the Smith form of convolutional codes is proposed, which has a small public key size compared to the originalMcEliece scheme and resists the unique decoding attack against convolutionAL structure.
Algebraic Cryptanalysis of McEliece Variants with Compact Keys
It is proved that the private key of the McEliece cryptosystem satisfies a system of bi-homogeneous polynomial equations, which is due to the particular class of codes considered which are alternant codes.
A Reaction Attack on the QC-LDPC McEliece Cryptosystem
A reaction attack against the QC-MDPC McEliece cryptosystem is presented which exploits a dependence between the secret matrix H and the failure probability of the bit-flipping algorithm to reveal the matrix H which constitutes the private key in the cryptos system.
An Improved McEliece Cryptosystem Based on QC-LDPC Codes
The original algorithm is improved and the Q-decoder is used, which utilizes the correlation between the error pattern e and the matrix Q, making decoding performance much better and the security of the improved cryptosystem has a higher security level.


Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes
We adopt a class of quasi-cyclic low-density parity-check codes that allow to overcome the main limitations of the original McEliece cryptosystem based on Goppa codes, that are large key size and low
LDPC Codes in the McEliece Cryptosystem
This paper considers a previous LDPC-based instance of the McEliece cryptosystem and develops a thorough cryptanalysis to quantify the risk level of attacks, and proposes a new instances of the system that is immune to all the considere attacks and can achieve the prefixed objectives with limited complexity.
Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes
It is shown that with high probability a parity-check matrix of a punctured version of the secret code can be recovered with time complexity O(n3) where n is the length of the considered code.
An Observation on the Security of McEliece's Public-Key Cryptosystem
A systematic method of checking is suggested, and a generalized version of the cryptanalytic attack which reduces the work factor sigdicantly is described, which can be viewed as generalized probabilistic decoding algorithms for any linear error correcting codes.
Advances in Cryptology — EUROCRYPT ’88
Two protocols are presented that accomplish the same goal as the original Diffie-Hellman protocol, namely, to establish a common secret key using only public messages. They are based on n-fold
Generic GF(2) Arithmetic in Software and Its Application to ECC
This work presents algorithms that are especially suited to high-performance devices like large-scaled server computers and shows how to perform an efficient field multiplication for operands of arbitrary size, and how to achieve efficient field reduction for dense polynomials.
Using low density parity check codes in the McEliece cryptosystem
The implications of using a low density parity check code (LDPCC) in place of the usual Goppa code in McEliece's cryptosystem allows for larger block lengths and the possibility of a combined error correction/encryption protocol.
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
An algorithm for finding minimum-weight words in large linear codes is developed. It improves all previous attacks on the public-key cryptosystems based on codes and it notably points out some
Efficient encoding of low-density parity-check codes
It is shown how to exploit the sparseness of the parity-check matrix to obtain efficient encoders and it is shown that "optimized" codes actually admit linear time encoding.
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
It is shown that McEliece's and Niederreiter's public-key cryptosystems are equivalent when set up for corresponding choices of parameters. A security analysis for the two systems based on this