The rapid advancements in quantum technologies have introduced significant threats to the security of conventional cryptographic systems. In particular, the evaluation of quantum resource requirements—measured in terms of circuit depth and qubit count—has become essential for analyzing the resilience of widely used schemes such as AES and RSA, as well as cryptographic hash functions like SHA-2. At the same time, the widespread adoption of Internet of Things (IoT) applications has increased the exposure to cybersecurity risks, which are further exacerbated by the emerging capabilities of quantum adversaries. To address these challenges, the U.S. National Institute of Standards and Technology (NIST) launched a competition to standardize lightweight hash functions and defined five quantum security levels to assess their robustness. In this work, we conduct a resource analysis of the NIST Lightweight Hash Function finalists against the Grover search algorithm, providing detailed insights into their quantum resistance. The findings contribute to a more comprehensive understanding of the security strength of lightweight hash functions in the post-quantum era.
The rapid advancements in quantum technologies have introduced significant threats to the security of conventional cryptographic systems. In particular, the evaluation of quantum resource requirements—measured in terms of circuit depth and qubit count—has become essential for analyzing the resilience of widely used schemes such as AES and RSA, as well as cryptographic hash functions like SHA-2. At the same time, the widespread adoption of Internet of Things (IoT) applications has increased the exposure to cybersecurity risks, which are further exacerbated by the emerging capabilities of quantum adversaries. To address these challenges, the U.S. National Institute of Standards and Technology (NIST) launched a competition to standardize lightweight hash functions and defined five quantum security levels to assess their robustness. In this work, we conduct a resource analysis of the NIST Lightweight Hash Function finalists against the Grover search algorithm, providing detailed insights into their quantum resistance. The findings contribute to a more comprehensive understanding of the security strength of lightweight hash functions in the post-quantum era.
Quantum computers have the potential to solve a number of hard problems that are believed to be almost impossible to solve by classical computers. This observation has sparked a surge of research to apply quantum algorithms against the cryptographic systems to evaluate its quantum resistance. In assessing the security strength of the cryptographic algorithms against the upcoming quantum threats, it is crucial to precisely estimate the quantum resource requirement (generally in terms of circuit depth and quantum bit count). The National Institute of Standards and Technology by the US government specified five quantum security levels so that the relative quantum strength of a given cipher can be compared to the standard ones. There have been some progress in the NIST-specified quantum security levels for the odd levels (i.e., 1, 3 and 5), following the work of Jaques et al. (Eurocrypt’20). However, levels 2 and 4, which correspond to the quantum collision finding attacks for the SHA-2 and SHA-3 hash functions, quantum attack complexities are arguably not well-studied. This is where our article fits in. In this article, we present novel techniques for optimizing the quantum circuit implementations for SHA-2 and SHA-3 algorithms in all the categories specified by NIST. After that, we evaluate the quantum circuits of target cryptographic hash functions for quantum collision search. Finally, we define the quantum attack complexity for levels 2 and 4, and comment on the security strength of the extended level. We present new concepts to optimize the quantum circuits at the component level and the architecture level.
The rapid advancement of quantum computing technology presents a significant challenge to the field of cryptography, particularly affecting the security of hash functions that form the foundation of many cryptographic protocols. Hash functions are widely used to ensure data integrity, generate digital signatures, and securely store passwords. However, the emergence of quantum algorithms—such as Grover’s algorithm—threatens to undermine the security assumptions on which these hash functions are based by significantly reducing their effective security levels. This paper aims to provide a comprehensive analysis of the vulnerabilities introduced by quantum computing to traditional hash functions, detailing how these weaknesses can be exploited by quantum adversaries. We explore the fundamental properties of hash functions, including pre-image resistance, second pre-image resistance, and collision resistance, and assess how these properties are affected in a quantum context. Furthermore, we examine the implications of these vulnerabilities for existing cryptographic systems and emphasize the urgent need for the development of post-quantum cryptographic standards. In response to these challenges, we review ongoing research efforts focused on designing hash functions that are resilient to quantum attacks. We evaluate several promising candidates for post-quantum hash functions, considering their security properties, performance metrics, and practical applicability. The findings of this paper highlight the necessity of transitioning to post-quantum cryptographic solutions to safeguard sensitive information in an increasingly quantum-capable world. Ultimately, we advocate for proactive measures within the cryptographic community to adopt and implement these new standards, thereby ensuring robust data security in the age of quantum computing.
The advent of quantum computing poses a significant threat to current cryptographic systems, particularly public-key algorithms such as RSA and ECC, which are vulnerable to quantum attacks like Shor's algorithm. Post-Quantum Cryptography (PQC) aims to develop and standardize quantum-resistant cryptographic algorithms to secure digital communications in the quantum era. This paper examines the current landscape of PQC, focusing on the evaluation and standardization efforts led by organizations such as the National Institute of Standards and Technology (NIST). We analyze the major families of quantum-resistant algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptography, discussing their security guarantees, performance trade-offs, and implementation challenges. Furthermore, we review NIST's PQC standardization process, highlighting selected finalists and alternate candidates, and explore the ongoing transition challenges in adopting these algorithms across industries. Finally, we discuss future directions for PQC research, including hybrid cryptographic systems and the need for continued cryptanalysis to ensure long-term security. This work provides a comprehensive overview of the progress and challenges in deploying quantum-resistant cryptography to safeguard against emerging quantum threats.
The increasing ubiquity of Internet of Things (IoT) devices has necessitated robust security measures, especially with the impending threat of quantum computing to conventional cryptographic protocols.In this study, we address the imperative of selecting an optimized post-quantum cryptographic algorithm tailored for implementation on resource-constrained IoT devices while ensuring compliance with stringent security standards.This research employs a comprehensive evaluation framework that considers the unique constraints of IoT devices, including limited computational capabilities and memory resources.Furthermore, our assessment accounts for the diverse security requirements stipulated by prevailing standards to guarantee resilience against both classical and quantum threats.Through a systematic analysis of various post-quantum cryptographic algorithms, encompassing factors such as computational efficiency and resistance to quantum attacks, this study identifies a select set of algorithms that exhibit promising suitability for IoT device deployment.The evaluation considers renowned standards, including NIST's Post-Quantum Cryptography Standardization initiative to align with industry best practices and interoperability.The findings presented in this study offer guidance to IoT device manufacturers, system architects, and security practitioners in making informed decisions regarding the adoption of post-quantum cryptographic algorithms.The selected algorithms not only demonstrate adeptness in mitigating quantum threats but also address resource constraints inherent in IoT environments, ensuring a secure foundation for the rapidly expanding ecosystem of interconnected devices.
In the realm of cybersecurity, the emergence of quantum computing poses a significant threat to traditional cryptographic methods. Quantum algorithms such as Shor's algorithm challenge the security of widely used cryptographic schemes like ECC. As quantum computers advance, there is an urgent need to develop quantum-resistant cryptographic techniques. This research project aims to address this need by focusing on the development of lightweight quantum-resistant cryptography. The project aims to develop a National Institute of Standards and Technology (NIST) Approved lightweight quantum-resistant cryptographic algorithm that aligns with the resource constraints inherent in diverse applications and devices. By navigating the quantum era, the project seeks to provide practical, efficient, and deployable cryptographic solutions aligned with the resource constraints of diverse applications and devices.
Purpose: The purpose of this paper is to examine the emerging threat that large-scale quantum computing poses to classical public-key cryptographic systems, particularly RSA and Elliptic Curve Cryptography (ECC), which form the backbone of contemporary digital security infrastructures. In response to this threat, the study aims to analyze post-quantum cryptography (PQC) as a viable long-term solution capable of resisting both classical and quantum adversaries. The paper further seeks to assess the urgency of PQC adoption in light of the “harvest now, decrypt later” threat model and to evaluate the practical readiness of quantum-safe cryptographic algorithms currently under consideration by the National Institute of Standards and Technology (NIST). Materials and Methods: This study employs a qualitative and analytical research methodology grounded in an extensive review of authoritative sources, including NIST’s post-quantum cryptography standardization documents, recent academic literature, industry white papers, and policy reports from organizations such as RAND Corporation and Cloudflare. The analysis systematically surveys major families of post-quantum cryptographic algorithms namely lattice-based, code-based, and hash-based schemes and evaluates them based on security assumptions, computational efficiency, implementation complexity, and standardization maturity. Findings: The analysis indicates that Lattice-based cryptographic schemes demonstrate the highest maturity and practical readiness, evidenced by their selection in NIST’s PQC process. Code- and hash-based methods provide strong security but face key size and performance challenges. The lack of scalable quantum computers does not reduce urgency, as data harvesting persists. Artificial intelligence emerges as a key enabler for accelerating PQC adoption. Unique Contribution to Theory, Practice and Policy: The paper recommends a proactive, phased post-quantum migration using hybrid cryptographic architectures. Organizations should conduct inventories, benchmarking, and pilot deployments aligned with NIST standards. AI-driven tools are advised to improve key management and reduce complexity. Continued interdisciplinary research and policy support are encouraged to ensure a secure, scalable transition to quantum-resistant security systems.