This thesis explores the impact of quantum computing on the security of e-voting, using Estonia’s e-voting system as a case study. Chapters 1 and 2 provide insight into the development of quantum computing and why this threatens contemporary cryptography. Chapter 3 reviews the current e-voting protocol used in Estonia. Chapter 4 considers the challenges and urgency of migrating to post quantum e-voting. Then, chapters 5 and 6 explore potential quantum safe alternatives to contemporary cryptography, in particular exploring the use of lattice based hard problems. Chapters 7 and 8 provide insight into proposed post quantum solutions specific to e-voting and the current challenges faced with their implementations.
This thesis explores the impact of quantum computing on the security of e-voting, using Estonia’s e-voting system as a case study. Chapters 1 and 2 provide insight into the development of quantum computing and why this threatens contemporary cryptography. Chapter 3 reviews the current e-voting protocol used in Estonia. Chapter 4 considers the challenges and urgency of migrating to post quantum e-voting. Then, chapters 5 and 6 explore potential quantum safe alternatives to contemporary cryptography, in particular exploring the use of lattice based hard problems. Chapters 7 and 8 provide insight into proposed post quantum solutions specific to e-voting and the current challenges faced with their implementations.
As quantum computing progresses towards practical realization, the security of existing cryptographic protocols, such as RSA and Elliptic Curve Cryptography (ECC), faces unprecedented risks. Quantum algorithms like Shor's Algorithm threaten to undermine the security of these widely used encryption schemes, necessitating the development of quantum-resistant alternatives. This paper explores the vulnerabilities of current cryptographic protocols in the quantum era and investigates quantum-safe cryptographic techniques such as lattice-based, hash-based, and code-based cryptography. Additionally, we delve into Quantum Key Distribution (QKD), a method that leverages the principles of quantum mechanics to securely distribute cryptographic keys, ensuring secure communication even in the presence of quantum adversaries. The integration of QKD with post-quantum cryptographic algorithms is proposed as a robust approach to future-proofing cybersecurity. The paper concludes with a discussion of practical challenges in implementing quantum-safe systems and highlights future research directions to strengthen cryptographic resilience against quantum threats.
Ensuring the security and integrity of voting systems is crucial for maintaining democratic processes. With the rise of cyber threats targeting electronic voting, traditional cryptographic methods are proving inadequate in safeguarding against sophisticated attacks. Quantum cryptography, particularly Quantum Key Distribution (QKD), offers a promising solution to enhance the security of voting systems by leveraging the principles of quantum mechanics. This research explores the application of quantum cryptography in secure voting, highlighting its potential to address vulnerabilities in current systems. The study examines the technological, practical, and legal challenges of implementing quantum-based voting systems, including infrastructure requirements and public acceptance. Furthermore, it assesses how quantum cryptography ensures voter privacy, prevents tampering, and provides robust protection against future quantum computing threats. While significant hurdles remain, the integration of quantum cryptographic techniques presents a transformative opportunity to create more secure and transparent voting processes. This paper outlines the roadmap for adopting quantum cryptography in voting systems and its potential impact on electoral integrity.
The rise of quantum computing poses a significant threat to the security of such classical cryptographic systems, as they inherently depend on the computational difficulty of problems such as integer factorization and discrete logarithm. Examining Theoretical Foundations of Post-Quantum Cryptography: Challenges and Opportunities for Building Secure Cryptographic Protocols in the PostQuantum World This paper aims to explore how quantum computers will affect the current state of cryptography, contributing towards the ongoing discussion to upgrade our cryptographic systems' foundations in the face of potential quantum attacks and assessing the efforts for developing quantum-resilient algorithms. Quantum computers promise unprecedented computation power by harnessing the strange properties of quantum mechanics. While quantum algorithms still pose a significant threat to conventional cryptography, the emergence of post-quantum algorithms offer hope to secure our data in the quantum era
The increasing advancement in quantum computing threatens the security of traditional cryptographic systems that underpin much of the modern world’s data protection. These systems rely heavily on the computational difficulty of problems like integer factorization (RSA) and elliptic curve discrete logarithms (ECC), which quantum computers could solve in polynomial time. As a result, there is an urgent need for cryptographic systems that remain secure even in the presence of quantum capabilities. Post-Quantum Cryptography (PQC) is the emerging field that aims to develop cryptographic protocols resistant to quantum-based attacks. This paper discusses the need for PQC, explores various candidate algorithms, reviews standardization efforts, and looks at the current challenges and future directions in the field.
Quantum computing represents a paradigm shift in computational capability, threatening to undermine classical cryptographic systems that underpin modern application security.This paper analyzes vulnerabilities introduced by quantum algorithms such as Shor's and Grover's, which jeopardize widely used encryption standards like RSA, ECC, and AES.It evaluates post-quantum cryptography (PQC) solutions, including lattice-based and hash-based cryptosystems, and explores their integration into software development lifecycles.The study also assesses quantumenhanced security mechanisms like Quantum Key Distribution (QKD) and examines regulatory challenges in standardizing quantum-safe protocols.Synthesizing technical
Quantum computing is poised to revolutionize numerous fields, including cryptography. Traditional encryption algorithms that form the backbone of modern digital security, such as RSA and Elliptic Curve Cryptography (ECC), rely on computationally difficult problems—specifically, the factorization of large integers and the solving of discrete logarithms. However, quantum computers, leveraging the principles of quantum mechanics, present the potential to solve these problems in polynomial time through algorithms like Shor’s Algorithm, rendering these encryption methods insecure. The development of sufficiently powerful quantum computers could therefore undermine the confidentiality and integrity of sensitive digital information across the internet. This paper explores the threats posed by quantum computing to traditional cryptographic systems, with a focus on the impact of Shor’s Algorithm and Grover’s Algorithm. In addition, the paper reviews ongoing efforts to develop quantum-resistant cryptographic techniques, particularly in the area of post-quantum cryptography (PQC). It discusses the NIST Post-Quantum Cryptography Standardization project, the promising alternatives to current encryption schemes, and the potential for quantum key distribution (QKD) as a solution. The paper concludes with a reflection on the urgent need to prepare for quantum computing's eventual impact on digital security and the steps that can be taken to mitigate these risks in the transition to quantum-safe cryptography.