Elena Cattelino
Code-Based Post-Quantum Cryptography: Analysis and Comparison of Classic McEliece and HQC.
Rel. Nadir Murru. Politecnico di Torino, Corso di laurea magistrale in Cybersecurity, 2026
|
Preview |
PDF (Tesi_di_laurea)
- Tesi
Licenza: Creative Commons Attribution Non-commercial No Derivatives. Download (4MB) | Preview |
Abstract
The advent of large-scale quantum computers threatens the security of classical public-key cryptography, as Shor's algorithm efficiently solves the integer factorization and discrete logarithm problems underlying RSA and elliptic-curve schemes. Code-based cryptography, whose security relies on the conjectured hardness of decoding random linear codes, is among the well-studied families of post-quantum alternatives. This thesis provides a comprehensive treatment of code-based public-key encryption and key encapsulation, combining theoretical foundations with practical evaluation. After introducing the necessary background in coding theory and in formal cryptographic security models, the thesis examines in detail two NIST-relevant code-based frameworks: the Classic McEliece cryptosystem, based on hiding the structure of a binary Goppa code, and HQC (Hamming Quasi-Cyclic), which instead exposes a public, efficiently decodable code and relies on the hardness of quasi-cyclic syndrome decoding.
Building on this theoretical foundation, the thesis presents an experimental benchmark of reference PQClean implementations of Classic McEliece and HQC across all NIST security levels, comparing key and ciphertext sizes, execution time, CPU-cycle counts, memory footprint, and measurement stability under a controlled experimental methodology designed to isolate real algorithmic effects from environmental noise
Relatori
Anno Accademico
Tipo di pubblicazione
Numero di pagine
Corso di laurea
Classe di laurea
Aziende collaboratrici
URI
![]() |
Modifica (riservato agli operatori) |
