Access the full text.
Sign up today, get DeepDyve free for 14 days.
[In this chapter, the use of QC-LDPC codes in public key cryptosystems inspired to the McEliece and Niederreiter systems is studied. Both the case in which the private and the public code are permutation equivalent and that in which such an equivalence is absent are considered. It is shown that the use of this kind of codes may expose the system to new attacks, which can be very dangerous if the system is not suitably designed. The countermeasures to be used against these attacks are described, and some practical instances of QC-LDPC code-based public key cryptosystems achieving some specific security levels are provided. The chance to use QC-LDPC codes also in digital signature schemes and symmetric cryptosystems is briefly discussed.]
Published: May 3, 2014
Keywords: QC-LDPC code-based cryptosystems; Permutation-equivalent codes; Cryptanalysis; Information set decoding; Key size; Complexity
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.