The emergence of quantum computers poses a threat to classical cryptography. The existing digital security, which heavily relies on classical mathematical problems (like RSA or ECC) has been proven vulnerable to quantum computers. The National Institute of Standards and Technology (NIST) has spearheaded the efforts in the standardization of Module Lattice-Based Digital Signature Algorithm (ML-DSA) across three discrete security categories. In today's PKI, there is a need for mechanisms that provide digital signatures that are highly secure against quantum computers while remaining usable in resource-constrained environments, such as those encountered in the IoT domain. Therefore, it becomes necessary to study ML-DSA outside of the NIST parameter sets. We also evaluate the security performance of the standard and non-standard ML-DSA algorithms in terms of their hardness using the Primal uSVP attack model and the Lattice Estimator API, and the impact of the varying matrix ranks$(k \times l)$and error distributions$(\eta)$on bit-security strength and computational complexity. Our experimental results show the trade-off between security and performance in our evaluated configurations. The Lite configurations exhibit decreased computational and payload overhead but decreased security, whereas the Ultra configurations offer increased security hardness with increased computational overhead. Our findings reveal that the NIST standard ML-DSA-44 algorithm is a very strong and efficient alternative to the conventional digital signature schemes. However, our findings also reveal that any performance improvement beyond ML-DSA-44 implies a weakening of the security strength. These configurations may suit applications where low resources are involved, such as IoT applications, but the associated weakening of cryptographic strength should be taken into account.
The emergence of quantum computers poses a threat to classical cryptography. The existing digital security, which heavily relies on classical mathematical problems (like RSA or ECC) has been proven vulnerable to quantum computers. The National Institute of Standards and Technology (NIST) has spearheaded the efforts in the standardization of Module Lattice-Based Digital Signature Algorithm (ML-DSA) across three discrete security categories. In today's PKI, there is a need for mechanisms that provide digital signatures that are highly secure against quantum computers while remaining usable in resource-constrained environments, such as those encountered in the IoT domain. Therefore, it becomes necessary to study ML-DSA outside of the NIST parameter sets. We also evaluate the security performance of the standard and non-standard ML-DSA algorithms in terms of their hardness using the Primal uSVP attack model and the Lattice Estimator API, and the impact of the varying matrix ranks(k×l)and error distributions(η)on bit-security strength and computational complexity. Our experimental results show the trade-off between security and performance in our evaluated configurations. The Lite configurations exhibit decreased computational and payload overhead but decreased security, whereas the Ultra configurations offer increased security hardness with increased computational overhead. Our findings reveal that the NIST standard ML-DSA-44 algorithm is a very strong and efficient alternative to the conventional digital signature schemes. However, our findings also reveal that any performance improvement beyond ML-DSA-44 implies a weakening of the security strength. These configurations may suit applications where low resources are involved, such as IoT applications, but the associated weakening of cryptographic strength should be taken into account.
The rapid advancement of quantum computing poses a significant threat to classical cryptographic systems, particularly to widely used public-key schemes that rely on integer factorisation and the discrete logarithm problem. To ensure long-term data security against potential quantum adversaries, post-quantum cryptography (PQC) is currently standardised by the National Institute of Standards and Technology (NIST). This paper goes beyond a theoretical overview by employing a systematic methodology to evaluate the empirical performance trade-offs of the newly standardised algorithms (ML-KEM, ML-DSA, and SLH-DSA) and key finalists (FN-DSA and HQC). Based on a comprehensive review of fragmented performance data, the work presents a comparative analysis focusing on data overhead, computational latency, and resource efficiency. As a primary contribution, this study proposes a deployment-oriented taxonomy that explicitly maps these PQC standards to optimal practical use cases, considering diverse constraints across Internet of Things, cloud environments, and blockchain networks. Furthermore, the paper addresses critical real-world deployment challenges, such as vulnerabilities to side-channel attacks and hardware-level implementation constraints. Ultimately, this work systematises current knowledge into a unified decision-making framework, guiding system architects in complex migration towards a quantum-resilient digital ecosystem.
The emergence of quantum computing threatens the security of widely deployed public-key cryptographic systems such as RSA and elliptic curve cryptography. In response, the National Institute of Standards and Technology (NIST) standardized a new generation of post-quantum algorithms including ML-KEM and ML-DSA. This paper presents the Quantum Privacy Analyzer (QPA), a prototype designed to experimentally evaluate the performance impact of post-quantum cryptography in modern computing and networking environments. The system compares classical cryptographic algorithms (RSA-4096 and ECDSA-P256) with NIST standardized PQC algorithms. Experimental results reveal a significant shift in performance characteristics: while lattice-based key encapsulation mechanisms can outperform RSA in CPU efficiency, the large size of postquantum artifacts significantly increases network overhead and frequently exceeds the Ethernet MTU limit, forcing TCP segmentation.
Background: The imminent threat posed by cryptographically relevant quantum computers to classical public-key infrastructure specifically RSA and Elliptic-Curve Cryptography (ECC), whose security rests on the conjectured computational intractability of integer factorisation and the discrete logarithm problem respectively has propelled lattice-based cryptography to the centre of global post-quantum standardisation efforts. On 13 August 2024, the United States National Institute of Standards and Technology (NIST) published three landmark Federal Information Processing Standards (FIPS): FIPS 203 (ML-KEM, derived from CRYSTALS-Kyber), FIPS 204 (ML-DSA, derived from CRYSTALS-Dilithium), and FIPS 205 (SLH-DSA, derived from SPHINCS+), with FIPS 206 (FN-DSA, derived from FALCON) in advanced draft. The first three of these standards rest on algebraic structures intimately connected to classical number theory: polynomial rings over integer quotients, cyclotomic fields, and the algebraic geometry of ideal lattices in rings of integers of number fields. Objectives: This article provides: (1) a rigorous mathematical exposition of the lattice problems underpinning NIST’s post-quantum standards, specifically the Learning With Errors (LWE), Ring-LWE (RLWE), Module-LWE (MLWE), Short Integer Solution (SIS), and NTRU problems, and their connections to algebraic number theory; (2) a comparative performance analysis of NIST-standardised lattice-based algorithms against classical RSA and ECC benchmarks; (3) a security analysis examining known classical and quantum attacks on each hard problem; (4) a comparative evaluation of the four NIST-selected algorithms across key size, signature size, and computational benchmarks; and (5) a strategic assessment of the migration challenges facing deployed cryptographic infrastructure. Methods: The study synthesises peer-reviewed literature, NIST official standards documentation (FIPS 203, 204, 205, and draft FIPS 206), and independently published performance benchmarks published between June 2024 and June 2026. Mathematical security analysis is grounded in the worst-case to average-case reductions established by Regev (2005) for LWE and by Lyubashevsky, Peikert, and Regev (2013) [11, 18] for Ring-LWE. Performance data are drawn from Garani (2024) [8], the ARM Cortex-M0+ benchmarking study of Ratnayaka and Fischer (2026) [4], and the cross-platform evaluation by Alzahrani et al. (2025) [2]. Results: NIST’s three August 2024 standards establish a comprehensive lattice-based post-quantum portfolio. ML-KEM-768 produces a 1,184-byte public key and 1,088-byte ciphertext, achieving IND-CCA2 security under the MLWE assumption at NIST Level 3 (AES-192 equivalent). ML-DSA-65 produces 1,952-byte public keys and 3,309-byte signatures under the Module-LWE and Module-SIS assumptions at Level 3. FN-DSA-512 (FALCON, draft FIPS 206) produces 897-byte public keys and 666-byte signatures under the NTRU assumption, offering the most compact lattice-based signatures. Performance benchmarks on an Intel Core i7-12700K (3.6 GHz) confirm that ML-KEM key generation is orders of magnitude faster than RSA-3072 key generation. The algebraic structure of cyclotomic polynomial rings ∑₂ⁿ = Z[x]/(x^n + 1) is central to the efficiency of all three lattice-based NIST standards. Conclusion: Lattice-based cryptography, grounded in the algebraic number theory of ideal lattices over cyclotomic fields, provides the most comprehensive and mathematically well-founded response to the quantum computational threat. The August 2024 NIST standardisation of ML-KEM, ML-DSA, and SLH-DSA represents a landmark in cryptographic history, and the imminent finalisation of FN-DSA will complete the post-quantum toolbox. Organisations should prioritise immediate migration planning, leveraging hybrid classical-quantum schemes during transition, with full transition to NIST post-quantum standards recommended by 2030 per NSA and CISA guidance.
The advent of large-scale, fault-tolerant quantum computers threatens the mathematical foundations - namely integer factorization and discrete-logarithm hardness - on which today's public-key cryptography relies could be rendered insecure. This has shifted the need to move to Post-Quantum Cryptography (PQC) from a theoretical to an engineering priority. This work presents an extensive empirical comparison of the NIST standardized primitives used for key encapsulation (FIPS 203: ML-KEM) and digital signatures (FIPS 204: ML-DSA) with the standardised classical RSA-3072 primitives at similar security levels as defined by the NIST security level. This paper evaluates three fundamental performance metrics: (i) computational latency in CPU clock cycles; (ii) communication cost in bytes; and (iii) memory usage during the cryptographic operation, and combines them into a unified evaluation framework. Additionally, the paper discusses the mathematical principles of the standardized quantum-resistant schemes, namely Module Short Integer Solution (MSIS) and Module Learning With Errors (MLWE) focusing on their security principles. Benchmarking reveals that, despite lattice-based schemes incurring larger public key and signature sizes-up to32×relative to elliptic-curve counterpartsML-KEM-768 decapsulation is approximately108×faster than an RSA-3072 private-key operation, and ML-DSA-65 signing is approximately 19× faster than RSA-3072 signing. To support cryptographic agility during the post-quantum migration period, this paper proposes a modular hybrid architecture validated through a triple-hybrid (ECDH + Kyber + BB84 QKD) demonstration.
Alongside the growth of technology is the increasing demand for security of data and communication channels. As attacking power grows, devices become smaller and data expands, the security needs to be stronger yet less resource-consuming than ever before. Public key cryptography (PKC) is used in the majority of today's communications systems. The security of public-key cryptographic schemes, such as RSA and elliptic curve cryptography (ECC), is based on underlying mathematical problems such as factoring large integers or solving the discrete log problem. However, the discovery of Shor's Algorithm in 1994 insinuates that these schemes will be insecure when a full-scale quantum computer is developed, as these problems will be solvable in polynomial time. Therefore attention has moved towards post-quantum, or quantum-safe, cryptography (QSC). In 2016, the National Institute of Standards and Technology (NIST) announced the beginning of their efforts to migrate to QSC, a standardisation process which has involved the cryptographic community worldwide. There are five main types of QSC being considered for standardisation; lattice-based, code-based, multivariate-based, hash-based and isogeny-based. Lattice-based cryptography (LBC) offers a promising alternative to today's classical approaches. Hard problems based on lattices are believed to be unsolvable, even by a quantum-computer, in a feasible amount of time. In 1995, Ajtai showed that the average case complexity of these problems is at least as hard as solving the problems in the worst case. Furthermore, lattice-based schemes are the only remaining contender in the NIST process to provide the important primitives of encryption, key encapsulation and digital signature schemes (DSSs). A well-recognised open problem surrounding quantum-safe cryptography is its increase in bandwidth and computational complexity in comparison to existing cryptography. However, in comparison to other quantum-safe schemes, LBC has been shown to be relatively efficient. In this thesis, novel software designs of lattice-based schemes are presented and shown to be competitive with existing PKC. Additionally, physical attacks are considered and countermeasures are incorporated into the designs. DSSs are required for authentication, integrity and non-repudiation of data. This thesis provides an evaluation of three leading signature schemes, BLISS-B, Dilithium and \textsc{Falcon}, which vary in terms of their key features, such as the sampling processes used, and the structure of the lattices. Physical attacks on the three schemes are considered and the effect on performance of appropriate attack countermeasures is evaluated. A novel fault attack on the NIST candidate \textsc{Falcon} is also proposed. A further advantage of LBC is the ability to support cryptographic primitives with extended capabilities to facilitate certificate management and compute on encrypted data. The complexity of today's technology advances mean applications require more sophisticated primitives, which contrastingly are required to run on even smaller platforms. This thesis presents novel quantum-safe advanced cryptographic schemes, specifically lattice-based identity-based encryption (IBE) and hierarchical identity-based encryption (HIBE). IBE removes the need for certificate management, as a user's public key depends on their public identity. IBE is currently used in vital applications such as emergency services communication and so the development of a high-performance quantum-safe alternative is imperative. This thesis also introduces the first scalable HIBE scheme based on lattices. The first HIBE scheme based on structured lattices, Latte, was proposed by the National Centre for Cyber Security (NCSC) in 2017. However, the public key and ciphertext sizes increased with each delegation and hence it was not feasible to scale the algorithm. Skinny Latte, proposed in this thesis, remedies this issue by fixing the dimension of the lattice, thereby making public key and ciphertext sizes constant. This research also shows that it is practical for real-world deployment. Overall, this thesis demonstrates that lattice-based cryptography is practical for real-world applications. It considers both theoretical and physical attacks, and presents novel designs of advanced quantum-safe cryptographic primitives, which have only yet been realised by lattices.
In recent years, the advancement of quantum computing technology has posed potential security threats to RSA cryptography and elliptic curve cryptography. In response, the National Institute of Standards and Technology (NIST) published several Federal Information Processing Standards (FIPS) of post-quantum cryptography (PQC) in August 2024, including the Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM), Module-Lattice-Based Digital Signature Algorithm (ML-DSA), and Stateless Hash-Based Digital Signature Algorithm (SLH-DSA). Although these PQC algorithms are designed to resist quantum computing attacks, they may not provide adequate security in certain specialized application scenarios. To address this issue, this study proposes quantum random number generator (QRNG)-based PQC algorithms. These algorithms leverage quantum computing to generate random numbers, which serve as the foundation for key pair generation, key encapsulation, and digital signature generation. A generalized architecture of QRNG is proposed, along with the design of six QRNGs. Each generator is evaluated according to the statistical validation procedures outlined in NIST SP 800-90B, including tests for verification of entropy sources and independent and identically distributed (IID) outputs. Experimental results assess the computation time of the six QRNGs, as well as the performance of QRNG-based ML-KEM, QRNG-based ML-DSA, and QRNG-based SLH-DSA. These findings provide valuable reference data for future deployment of PQC-based Transport Layer Security in web systems.