The webpage is dedicated to decoding challenges inspired by the McEliece Cryptosytem. The purpose of the challenge is to understand the hardness of the problems that underlie the security of the modern versions of the McEliece Cryptosystems like Classic McEliece.
Note that you may view the instances for each track by visiting the Leaderboard tab and clicking on the number in the left column. Then, after May 23rd, you may then submit to the relevant track through the blue submission button near the top of the page.
The McEliece cryptosystem remains, despite significant cryptanalytic efforts, a secure scheme since its invention in 1978. Further, it counts as post-quantum secure, i.e., there are no efficient quantum algorithms known that solve the underlying hard problems. These two facts led to the McEliece scheme being a fourth-round candidate of the current NIST PQC standardization effort for post-quantum secure schemes, in the form of the Classic McEliece submission.
In order to ensure a precise understanding of the security with respect to today’s computational resources and algorithmic advancements, we launched the TII McEliece Challenges. This challenge aims at covering all aspects of McEliece security, especially also those, which have received less attention in the past years. Before detailing the precise challenges and choices, let us outline a simplified version of the McEliece scheme.
Awards:- $75,000
Deadline:- 09-05-2024
