Security and complexity of the McEliece cryptosystem based on QC-LDPC codes

Details Security and complexity of the McEliece cryptosystem based on QC-LDPC codes Security and complexity of the McEliece cryptosystem based on QC-LDPC codes

2011-09-27

arxiv.org/abs/1109.5827v2

Computer Science

Cryptography and Security

18 pages, 1 figure

Scientific paper

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-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.

Affiliated with

Also associated with

No associations

Rating

Security and complexity of the McEliece cryptosystem based on QC-LDPC codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Security and complexity of the McEliece cryptosystem based on QC-LDPC codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Security and complexity of the McEliece cryptosystem based on QC-LDPC codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-62355