Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem

In this paper, a new variant of the McEliece cryptosystem, based on quasi-cyclic low-density parity-check (QC-LDPC) codes, is studied. In principle, such codes can substitute Goppa codes, originally used by McEliece; their adoption, however, is subject to cryptanalytic evaluation to ensure sufficien...

Full description

Saved in:
Bibliographic Details
Published in2007 IEEE International Conference on Communications pp. 951 - 956
Main Authors Baldi, M., Chiaraluce, F., Garello, R., Mininni, F.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2007
Subjects
Artificial intelligence
Communications Society
Decoding
Error correction codes
Parity check codes
Public key
Public key cryptography
Quantum cascade lasers
Security
Telecommunications
Online AccessGet full text
ISBN9781424403530
1424403537
ISSN1550-3607
DOI10.1109/ICC.2007.161

Cover

More Information
Summary:In this paper, a new variant of the McEliece cryptosystem, based on quasi-cyclic low-density parity-check (QC-LDPC) codes, is studied. In principle, such codes can substitute Goppa codes, originally used by McEliece; their adoption, however, is subject to cryptanalytic evaluation to ensure sufficient system robustness. 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.
ISBN:9781424403530
1424403537
ISSN:1550-3607
DOI:10.1109/ICC.2007.161