# MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes

@article{Misoczki2013MDPCMcElieceNM,
title={MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes},
author={Rafael Misoczki and Jean-Pierre Tillich and Nicolas Sendrier and Paulo Barreto},
journal={2013 IEEE International Symposium on Information Theory},
year={2013},
pages={2069-2073}
}
• Published 7 July 2013
• Computer Science
• 2013 IEEE International Symposium on Information Theory
In this work, we propose two McEliece variants: one from Moderate Density Parity-Check (MDPC) codes and another from quasi-cyclic MDPC codes. MDPC codes are LDPC codes of higher density (and worse error-correction capability) than what is usually adopted for telecommunication applications. However, in cryptography we are not necessarily interested in correcting many errors, but only a number which ensures an adequate security level. By this approach, we reduce under certain hypotheses the…
318 Citations

## Tables from this paper

Using Non-Binary LDPC and MDPC Codes in the McEliece Cryptosystem
• Computer Science
2019 AEIT International Annual Conference (AEIT)
• 2019
It is shown that the non-binary schemes are potentially able to reach the same security levels of the binary ones, for equal or smaller key sizes, but with reduced decryption failure rate, the latter being a relevant parameter in view of countering statistical attacks.
Protograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems
• Computer Science
2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
• 2018
This paper proposes ensembles of quasi-cyclic moderate-density parity-check codes based on protographs that significantly improve the error correction capability of the regular MDPC code ensemble that are currently considered for post-quantum cryptosystems without increasing the public key size.
Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
• Computer Science
Des. Codes Cryptogr.
• 2016
We present a general purpose algorithm for finding low-weight codewords as well as for decoding a received codeword in any quasi-cyclic code whose length and dimension is a multiple of a power of 2.
Soft McEliece: MDPC code-based McEliece cryptosystems with very compact keys through real-valued intentional errors
• Computer Science
2016 IEEE International Symposium on Information Theory (ISIT)
• 2016
This work proposes to use real-valued errors instead of classical bit flipping intentional errors in the McEliece cryptosystem based on moderate-density parity-check (MDPC) codes, and shows that these new systems achieve the shortest public key sizes ever reached.
A p-ary MDPC scheme
• Computer Science
2016 IEEE International Symposium on Information Theory (ISIT)
• 2016
A non-binary version of QC-MDPC, where the errors in the new scheme are discrete Gaussian and the decryption involves a new type of iterative decoding with a non- binary alphabet.
On Decoding Schemes for the MDPC-McEliece Cryptosystem
• Computer Science
ArXiv
• 2018
The proposed decoding algorithms have an improved error-correction performance compared to existing hard-decision decoding schemes and can reduce the effectiveness of the GJS reaction-based attack for an appropriate choice of the algorithm’s parameters.
Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes
• Computer Science
2013 IEEE Symposium on Computers and Communications (ISCC)
• 2013
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.
Improved iterative decoding of QC-MDPC codes in the McEliece public key cryptosystem
• Computer Science
2019 IEEE International Symposium on Information Theory (ISIT)
• 2019
It is demonstrated an improved performance for the iterative decoding step in decryption, which allows to increase the resistance against recent attacks based on taking advantage of the somewhat large failure probability of the BF algorithm.
Optimizing Information Set Decoding Algorithms to Attack Cyclosymmetric MDPC Codes
The research presented here shows that information set decoding algorithms can be improved, by choosing the columns of the information set in a way that takes advantage of the added symmetry.
Ouroboros-E: An Efficient Lattice-based Key-Exchange Protocol
• Computer Science
2018 IEEE International Symposium on Information Theory (ISIT)
• 2018
A new protocol is obtained which competes with the recent NEWHOPE and Kyber proposals, and also with NTRU, which exploits the cyclicity of the error, and benefits from the security of the renowned SIS problem.

## References

SHOWING 1-10 OF 57 REFERENCES
Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem
• Computer Science
2007 IEEE International Conference on Communications
• 2007
The authors conclude that some families of QC-LDPC codes, based on circulant permutation matrices, are inapplicable in this context, due to security issues, whilst other codes,based on the "difference families" approach, can be able to ensure a good level of security against intrusions, even if very large lengths are needed.
Compact McEliece Keys from Goppa Codes
• Computer Science
IACR Cryptol. ePrint Arch.
• 2009
A simple way to reduce significantly the key size in McEliece and related cryptosystems using a subclass of Goppa codes, while also improving the efficiency of cryptographic operations to $\tilde{O}(n)$ time, and keeping the capability of correcting the full designed number of errors in the binary case is described.
Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes
• Computer Science
2007 IEEE International Symposium on Information Theory
• 2007
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
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• Computer Science
SCN
• 2008
A new variant of the McEliece cryptosystem based on QC-LDPC codes is improved and it is shown that a new attack has been discovered that can recover the private key with limited complexity can be avoided by changing the form of some constituent matrices.
Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes
• Computer Science
Math. Comput. Sci.
• 2010
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.
Reducing Key Length of the McEliece Cryptosystem
• Computer Science
AFRICACRYPT
• 2009
The result suggests that decoding attack against the variant has little chance to be better than the general one against the classical McEliece cryptosystem, and a new NP-complete decision problem called quasi-cyclic syndrome decoding is introduced.
On the Usage of Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem
• Computer Science
2006 First International Conference on Communications and Electronics
• 2006
We consider possible inclusion of quasi-cyclic low-density parity-check codes in the McEliece cryptosystem, in order to verify the joined security/error control action that this scheme can
How to Achieve a McEliece-Based Digital Signature Scheme
• Computer Science
ASIACRYPT
• 2001
This paper disproves the belief that code-based cryptosystems like McEliece do not allow practical digital signatures, and shows a way to build a practical signature scheme based on coding theory.
Moderate-Density Parity-Check Codes
• Computer Science
ArXiv
• 2009
Inspired by some recent iterative soft-input soft-output decoders used in a context of classical block codes, a low complexity, efficient, iterative decoder called Auto-Diversity (AD) decoder is proposed, based on belief propagation (BP) decoding and takes advantage of the fundamental property of automorphism group of the constructed cyclic code.
A Distinguisher for High-Rate McEliece Cryptosystems
• Computer Science, Mathematics
IEEE Transactions on Information Theory
• 2013
This work presents the first method allowing to distinguish alternant and Goppa codes over any field, and can solve the GD problem in polynomial time provided that the codes have sufficiently large rates.