Year: 2024
Type: dissertation
Abstract: The rapid advancement of quantum computing poses significant threats to current cryptographic systems, \nparticularly those relying on classical public-key algorithms such as RSA. This constitutes a serious problem \nfor modern digital communications, financial transactions, sensitive data, national security systems, \nhealthcare records, intellectual property... Post-quantum cryptography (PQC) seeks to develop cryptographic \nprotocols resistant to quantum attacks, ensuring data security in a quantum-enabled future. This \npaper presents an analysis of various PQC algorithms, including lattice-based, code-based, hash-based \nand multivariate polynomial. We analyze their theoretical foundations, security assumptions, and efficiency. \nAdditionally, we provide a comparative study of these algorithms, highlighting their strengths and \nweaknesses in practical implementations. With this, we will provide a complete and detailed view of the \ncurrent state of post-quantum cryptography.
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6980800836