Abstract
With the advancement of NIST PQC standardization, three of the four candidates in Round 4 are code-based schemes, namely Classic McEliece, HQC and BIKE. Currently, one of the most important tasks is to further analyze their security levels for the suggested parameter sets. At PKC 2022, Esser and Bellini restated the major information set decoding (ISD) algorithms by using nearest neighbor technique and then applied these ISD algorithms to estimate the bit security of Classic McEliece, HQC and BIKE under the suggested parameter sets. However, all major ISD algorithms consume a large amount of memory, which in turn affects their time complexities. In this paper, we theoretically reestimate the security levels of the parameter sets suggested by these three schemes in low memory by applying K-list sum algorithms to ISD framework. Compared with Esser–Bellini’s algorithms, our results achieve the best gains for Classic McEliece, HQC, and BIKE, with reductions in security levels of 11.09, 12.64, and 12.19 bits, respectively.
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 callDisclaimer: 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.
