McEliece cryptosystem for post-quantum cryptography
This posts presents my semester project in the chair of Arithmetic (EPFL). We study the McEliece cryptosystem, a code-based cryptosystem known for its robustness against quantum computers.
Since the 70s, public-key encryption schemes such as RSA or Diffie-Hellman as well as more elaborate cryptosystems have relied on the hardness of underlying mathematical problems. These include factoring large composite numbers or finding discrete logarithms in finite fields. However, the current progress in computer science and quantum computing has raised concerns about the robustness of those cryptosystems. In such considerations, other cryptosystems believed to resist the computational power of quantum technologies have been studied increasingly. One of them is the McEliece cryptosystem, we study this cryptosystem here.
You can check out the full paper here.