Abstract
Code-based cryptographic schemes are promising candidates for post-quantum cryptography since they are fast, require only basic arithmetic, and have a well understood security. While there is strong evidence that cryptosystems like McEliece and Niederreiter are secure, they have certain weaknesses when used without semantic conversions. Critical attacks generally can't be avoided by increasing the key size of several code-based cryptosystems. In this paper we present a survey on critical attacks in code-based cryptography and we propose a specific conversion with a smaller redundancy of data than Korara's et al. and which protects against CCA2. Our purpose is to evaluate three cryptosystems: McEliece, Niederreiter and HyMES. We analyse their security against several models such as: Broadcast, Known Partial plaintext, Message-resend, Related-message, Chosen ciphertext, Lunchtime, Reaction attack and Malleability. Our work follows a first work done by Imai and Kobara 2001 which does not cover the whole known attacks and does not deal with the HyMES scheme.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Information and Coding Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
