Security and complexity of the McEliece cryptosystem based on QC-LDPC codes
Abstract
In the context of public key cryptography, the McEliece cryptosystem represents a very smart solution based on the hardness of the decoding problem, which is believed to be able to resist the advent of quantum computers. Despite this, the original McEliece cryptosystem, based on Goppa codes, has encountered limited interest in practical applications, partly because of some constraints imposed by this very special class of codes. We have recently introduced a variant of the McEliece cryptosystem including low-density parity-check codes, that are state-of-the-art codes, now used in many telecommunication standards and applications. In this paper, we discuss the possible use of a bit-flipping decoder in this context, which gives a significant advantage in terms of complexity. We also provide theoretical arguments and practical tools for estimating the trade-off between security and complexity, in such a way to give a simple procedure for the system design.
Keywords
Cite
@article{arxiv.1109.5827,
title = {Security and complexity of the McEliece cryptosystem based on QC-LDPC codes},
author = {Marco Baldi and Marco Bianchi and Franco Chiaraluce},
journal= {arXiv preprint arXiv:1109.5827},
year = {2013}
}
Comments
22 pages, 1 figure. This paper is a preprint of a paper accepted by IET Information Security and is subject to Institution of Engineering and Technology Copyright. When the final version is published, the copy of record will be available at IET Digital Library