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

Authors:
Marco Baldi;Marco Bodrato;Franco Chiaraluce
Affiliations:
DEIT, Università Politecnica delle Marche, Ancona, Italy;Centro Vito Volterra, Università di Roma Tor Vergata, Roma, Italy;DEIT, Università Politecnica delle Marche, Ancona, Italy
Venue:
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Year:
2008

Citing 12
Cited 3

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

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
On arithmetical algorithms over finite fields

Journal of Combinatorial Theory Series A
An algorithm for exact division

Journal of Symbolic Computation
A method for finding codewords of small weight

Proceedings of the 3rd International Colloquium on Coding Theory and Applications
Integer and polynomial multiplication: towards optimal toom-cook matrices

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

Computational Complexity
Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0

WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Generic GF(2m) arithmetic in software and its application to ECC

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Faster multiplication in GF(2)[x]

ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
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
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Efficient encoding of low-density parity-check codes

IEEE Transactions on Information Theory

Algebraic cryptanalysis of mceliece variants with compact keys

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Smaller keys for code-based cryptography: QC-MDPC mceliece implementations on embedded devices

CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Computational aspects of retrieving a representation of an algebraic geometry code

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 avoided by changing the form of some constituent matrices, without altering the remaining system parameters. We also propose another variant that exhibits an overall increased security level. We analyze the complexity of the encryption and decryption stages by adopting efficient algorithms for processing large circulant matrices. The Toom-Cook algorithm and the short Winograd convolution are considered, that give a significant speed-up in the cryptosystem operations.