Abstract
dc:descriptionThe rapid advancements in Quantum Computing threaten the security foundations of classical cryptographic systems, necessitating the creation and the development of post-quantum cryptographic algorithms. This thesis explores the theoretical underpinnings, practical implementations, and performance evaluations of post-quantum cryptographic algorithms designed to withstand the capabilities of quantum devices. Our research encompasses a diverse array of cryptographic primitives with a particular focus on lattice-based algorithms, empahasing on their security, efficiency, and applicability in real-world scenarios. The initial sections of the thesis provide a comprehensive review of the mathematical foundations of post-quantum cryptography, detailing the vulnerabilities of current systems such as RSA under quantum attacks, particularly those facilitated by Shor’s algorithm. We analyze the fundamental hardness assumptions that underpin post-quantum algorithms, such as the hardness of lattice problem establishing a robust theoretical basis for their security. The core of the thesis is dedicated to the description and evaluation of specific postquantum cryptographic algorithms based on latttices. This thesis delves into the theoretical foundations, practical implementations, and performance optimizations of lattice-based cryptographic schemes, with a particular emphasis on their applicability in a post-quantum world. The research encompasses a comprehensive analysis of the mathematical constructs underlying lattice problems, the development of robust cryptographic primitives, and the evaluation of their efficiency and security. We examine the design and implementation of public-key encryption schemes, such as the GGH, NTRU, LWE and Ring-LWE cryptosystem, highlighting their security properties and practical performance. Learning With Errors (LWE) has garnered significant attention due to its strong security proofs and versatility in constructing cryptographic primitives. Additionally, this dissertation explores the theoretical foundations and practical implementations of cryptographic schemes based on the LWE problem. In the second and main part of this thesis, we develop a novel cryptographic primitive based on LWE, including key exchange protocol and a public-key encryption scheme. Our primitive is rigorously analyzed for security and efficiency, with a focus on its applicability. We introduce a optimization of LWE, constructing a more complex cryptographic protocol for one-to-one encryption and our scheme is a LWE-based system applicable on modern computing platform which use encryption. These applications illustrate the versatility and potential of LWE as a foundational tool in the broader landscape of cryptographic research. This dissertation contributes to the advancement of lattice-based cryptography by providing theoretical insights, practical implementations, and an innovative optimized cryptosystem of the Learning With Errors problem. Our findings support the adoption of LWE-based cryptographic systems as a cornerstone of secure communication in the post-quantum era.
Degree
thesis:*- Grantor dc:publisher
- University of Thessaly (UTH)
- Year dc:date
- 2024
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Sampani, Maria
- Σαμπάνη, Μαρία
Subjects
dc:subject × 15Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/57529