Master-thesis; Author: Radu-Cristian Dobre, Supervised by: Peter Kieseberg, Paul Lackner
In present, there are many options to encrypt data between two endpoints: RSA, AES, 3DES are some examples, but using quantum computers it has been proven the possibility of breaking most of these asymmetric encryptions. Quantum computers will soon be available for public use and can even be rented online. The demand will be high for their capabilities. Now it seems impossible to own a quantum computer in a home, but as history proved, even computers and smartphones were thought impossible until they were widely available to the public, and they became cheaper and smaller with each iteration. There are a vast majority of researches comparing the differences between existing encryptions that are used and how they will fall with the rise of quantum computers. The focus should also be on the future of cryptography and algorithms that are capable to withstand quantum computers computational power, more specifically the ones that are developed as of writing this thesis. Different algorithms that are developed and tested nowadays to future-proof our encryption systems and also analyzing the proposed and now chosen algorithms by NIST. This thesis proposes to analyze the differences and capabilities of popular algorithms that show promise today as well as the crypto families they are based on. Explanation of why today’s encryption like RSA is not good enough and how AES is still able to withstand the coming of quantum computers. Towards the end of the thesis Lattice space family is presented and its capabilities that made it so popular among the candidates in NIST rounds.
@mastersthesis{dobre2025pqc-lattice,
title={Post quantum cryptography, analysis of modern encryption - Deep dive into quantum algorithms and PQC families},
author={Radu-Cristian Dobre},
school={UAS St. Pölten},
year={2025}
}
Published: 2025-09-25