Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Emerging Trends in Computer Science and Information Technology

Design and Evaluation of Quantum-Resilient Cryptographic Protocols for National Information Systems Security

Emmanuel Philip Nittala

Published Jan 1, 2024• 1 citation
Publisher

Abstract

The rapid progress of quantum computing now poses a substantial security risk to the information infrastructures of various nations, which are fundamentally reliant on classical cryptographic systems. Encryption algorithms such as RSA, ECC, and, notably, Satyamani’s, Shor, and Grover algorithms are vulnerable to quantum attacks; indeed, these algorithms can compromise code creation and encryption protocols within seconds when subjected to powerful quantum computing devices. In response to this emerging threat, this paper presents the design and evaluation of a quantum-resilient cryptographic protocol suite intended for national information systems security. The proposed version integrates lattice-based key exchange and hash-based digital signatures, rendering it post-quantum and compatible with the existing Public Key Infrastructure (PKI) and network protocol stack. Formal security analysis and performance evaluation were conducted using simulated nationwide network environments. Experimental results demonstrate that the proposed scheme achieves a computational latency reduction of up to 45% compared to baseline post-quantum algorithms, while maintaining high resilience against both classical and quantum adversaries. The scalability test indicates that quantum-resilient cryptography can be deployed across various government apparatuses, promoting national cybersecurity and digital autonomy, while maintaining security and interoperability

DOI
10.63282/3050-9246.ijetcsit-v5i2p114

Related papers

Quantum-resistant cryptographic protocols for securing cloud storage and data transmission in hybrid enterprise IT environments

Martha Masunda

The exponential growth of cloud computing and hybrid enterprise IT infrastructures has significantly transformed how organizations store, process, and transmit data. As reliance on distributed systems deepens, ensuring the confidentiality, integrity, and availability of sensitive information has become a paramount concern especially in the face of emerging quantum computing capabilities. Quantum computers, once fully realized, will render many current public-key cryptographic systems such as RSA, ECC, and DH obsolete due to their vulnerability to quantum algorithms like Shor’s and Grover’s. This looming threat demands a paradigm shift toward quantum-resistant cryptographic protocols that can safeguard digital assets across dynamic and heterogeneous environments. This study presents a comprehensive analysis of quantum-resistant cryptographic schemes, focusing on lattice-based, hash-based, multivariate polynomial, and code-based approaches. These protocols are critically evaluated in terms of computational efficiency, scalability, resistance to side-channel attacks, and adaptability to multi-tenant cloud architectures. Special emphasis is placed on their integration into hybrid enterprise IT ecosystems, which often comprise on-premises servers, private clouds, and public cloud services each with unique security and compliance requirements. Additionally, the research proposes a layered security model that leverages post-quantum encryption for data-at-rest, hybrid key exchange mechanisms for secure data-in-transit, and secure bootstrapping protocols for cross-domain identity verification. Through simulations and policy analysis, this work demonstrates how quantum-resilient cryptography can be effectively deployed without compromising system performance or interoperability. Ultimately, the findings aim to guide enterprises, cloud providers, and cybersecurity professionals in building forward-compatible, future-proof data protection strategies.

World Journal of Advanced Research and Reviews•Jun 30, 2022•2 citations

Quantum-Resistant Cryptography in Cyber Security

Bhargavgowda A.B., Chitra K.

The emergence of quantum computing presents both significant opportunities and critical challenges for modern cybersecurity. While quantum systems promise advances in science, engineering, and artificial intelligence, they also pose a substantial threat to classical cryptographic techniques such as RSA, ECC, and other widely deployed public-key mechanisms. Quantum algorithms including Shor’s and Grover’s are expected to compromise these systems, placing sensitive data, financial infrastructures, and national security at risk. This paper examines the growing field of quantum-resistant, or post-quantum, cryptography with a focus on identifying constructions capable of withstanding quantum attacks. It provides a systematic overview of major post-quantum cryptographic families, including lattice-based, hash-based, code-based, multivariate, and isogeny-related schemes, and evaluates their current security assumptions, practical efficiency, and readiness for real-world deployment. Beyond technical considerations, the paper highlights the organizational and workforce implications of transitioning to quantum-safe systems, emphasizing the need for coordinated global standards and sustained cybersecurity training. This study underscores that building a quantum-secure digital future requires not only adopting resilient algorithms but also strengthening collaborative, adaptive, and proactive security practices.

Journal of Innovation and Technology•Dec 1, 2025•0 citations

Leveraging Post-Quantum Cryptography in Digital Signatures for Enhanced Security in Quantum Computing Threat

Pavan Kurariya, Jahnavi Bodhankar, Santosh Pandey

The emergence of quantum computing introduces unprecedented risks to classical cryptographic schemes, particularly digital signatures that safeguard authentication, confidentiality, and data integrity across digital ecosystems. To address these concerns, this paper investigates the adoption of Post-Quantum Cryptography (PQC) within Public Key Infrastructure (PKI) frameworks, emphasizing its role in strengthening electronic signature (eSign) systems against quantum threats. Traditional PKI implementations rely on algorithms such as RSA and ECC in combination with Hardware Security Modules (HSMs) for secure key management; however, these methods are vulnerable to quantum algorithms like Shor's. We examine how quantum-resistant alternatives-including lattice-based, hash-based, and multivariate polynomial-based schemes standardized by NIST-can be integrated into PKI without compromising interoperability and compliance. A comparative evaluation highlights trade-offs in performance, storage, and computational complexity while demonstrating the feasibility of embedding PQC into existing eSign infrastructures. Our findings underscore the urgency of transitioning towards quantum-safe digital signatures to ensure resilience, regulatory alignment, and long-term trust in national-scale digital services.

IEEE International Conference on Blockchain and Distributed Systems Security (ICBDS)•Oct 30, 2025•0 citations

QUANTUM-RESILIENT CRYPTOGRAPHIC PROTOCOLS FOR SECURE MULTI-PARTY COMPUTATION IN POST-QUANTUM NETWORKS

Dr.S. Venkatesan, Dr.M. Poonguzhali, V. Ramesh +2 more

The advent of quantum computing presents a paradigm shift in modern cybersecurity, threatening the foundations of classical cryptographic systems such as RSA, ECC, and Diffie–Hellman key exchange. Quantum algorithms like Shor’s and Grover’s can efficiently break these schemes, rendering existing encryption mechanisms vulnerable and obsolete. This growing risk necessitates the development of quantum-resilient or post-quantum cryptographic (PQC) solutions that can safeguard data and computation in the era of quantum networks. Secure Multi-Party Computation (SMPC), a cornerstone of privacy-preserving computation, enables multiple entities to jointly compute a function over their private inputs without revealing them. However, its traditional security assumptions are also undermined by quantum threats. This research aims to explore and evaluate quantum-safe cryptographic protocols for integrating PQC into SMPC frameworks, thereby ensuring both confidentiality and correctness even in the presence of quantum-capable adversaries. The study focuses on lattice-based, hash-based, and code-based cryptographic primitives, analyzing their resilience, efficiency, and scalability when applied to distributed systems. A comparative framework is proposed to assess the performance and security trade-offs of different post-quantum SMPC implementations under realistic network conditions. The findings are expected to contribute to the design of a new class of cryptographic protocols capable of resisting quantum attacks, supporting the secure functioning of next-generation networks, and guiding policymakers and technologists toward practical post-quantum standardization. Ultimately, this research strengthens the bridge between theoretical cryptography and real-world cybersecurity readiness in the post-quantum era.

Lex localis - Journal of Local Self-Government•Oct 16, 2025•0 citations

Evaluating the Impact of Quantum Algorithms on Modern Cybersecurity Mechanisms

Mallu Shiva Rama Krishna, Patwari KrishnaRao, Manumula Srinubabu

Abstract—The emergence of quantum computing represents a fundamental challenge to contemporary cryptographic infras- tructures, mandating immediate adoption of quantum-resistant cryptographic standards to ensure long-term security. This paper analyzes how Shor’s algorithm renders RSA , ECC vulnerable by solving integer factorization and discrete alogarithm problems in polynomial time, while Grover’s algorithm weakens symmetric encryption through quadratic speedup attacks. Through compre- hensive cryptanalysis, we evaluate the vulnerabilities of current public-key infrastructures, symmetric ciphers, and hash functions against quantum threats. Our research systematically examines post-quantum cryptographic candidates, including lattice-based, hash-based, and multivariate polynomial schemes under NIST standardization, assessing their security guarantees and imple- mentation challenges. Furthermore, we investigate the broader implications for secure communications, blockchain networks, and authentication protocols in a post-quantum world. Based on our findings, we propose a practical transition framework featuring hybrid cryptographic systems, protocol enhancements, and policy updates to facilitate seamless migration. This work provides critical insights and actionable strategies for securing digital infrastructure against quantum threats while maintaining operational efficiency during the transition period. Index Terms—Cryptographic vulnerability, Grover’s algo- rithm, Post-quantum cryptography, Quantum computing, Quan- tum key distribution, Shor’s algorithm, Cybersecurity

INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT•Jun 13, 2025•1 citation

Quantum Resilience: Lattice-Based Cryptography for the Post-RSA Era

Revista, Zen, MATH, 10

The advent of quantum computing poses a significant existential threat to current public-key cryptographic standards, particularly RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security. Shor's algorithm, if implemented on a sufficiently powerful quantum computer, can efficiently break these foundational schemes, rendering vast amounts of encrypted data vulnerable. This paper investigates lattice-based cryptography as a robust and promising candidate for post-quantum security. We provide a comprehensive analysis of its theoretical underpinnings, focusing on hard problems like the Shortest Vector Problem (SVP) and Learning With Errors (LWE), which are believed to be intractable even for quantum adversaries. Through a detailed literature review and methodological exposition, we examine the construction principles of prominent lattice-based Key Encapsulation Mechanisms (KEMs) and digital signature schemes, such as Kyber and Dilithium, highlighting their inherent security properties and performance characteristics. Our results demonstrate that lattice-based schemes offer competitive efficiency, compact key sizes, and strong security guarantees against both classical and quantum attacks, positioning them as essential building blocks for the post-RSA cryptographic landscape. The discussion elaborates on the practical implications, standardization efforts by NIST, and the challenges associated with the transition to quantum-resilient cryptographic infrastructure. We conclude that lattice-based cryptography is a cornerstone of quantum resilience, critical for securing future digital communications and data integrity.

•Dec 6, 2025•0 citations
The rapid progress of quantum computing now poses a substantial security risk to the information infrastructures of various nations, which are fundamentally reliant on classical cryptographic systems. Encryption algorithms such as RSA, ECC, and, notably, Satyamani’s, Shor, and Grover algorithms are vulnerable to quantum attacks; indeed, these algorithms can compromise code creation and encryption protocols within seconds when subjected to powerful quantum computing devices. In response to this emerging threat, this paper presents the design and evaluation of a quantum-resilient cryptographic protocol suite intended for national information systems security. The proposed version integrates lattice-based key exchange and hash-based digital signatures, rendering it post-quantum and compatible with the existing Public Key Infrastructure (PKI) and network protocol stack. Formal security analysis and performance evaluation were conducted using simulated nationwide network environments. Experimental results demonstrate that the proposed scheme achieves a computational latency reduction of up to 45% compared to baseline post-quantum algorithms, while maintaining high resilience against both classical and quantum adversaries. The scalability test indicates that quantum-resilient cryptography can be deployed across various government apparatuses, promoting national cybersecurity and digital autonomy, while maintaining security and interoperability
The exponential growth of cloud computing and hybrid enterprise IT infrastructures has significantly transformed how organizations store, process, and transmit data. As reliance on distributed systems deepens, ensuring the confidentiality, integrity, and availability of sensitive information has become a paramount concern especially in the face of emerging quantum computing capabilities. Quantum computers, once fully realized, will render many current public-key cryptographic systems such as RSA, ECC, and DH obsolete due to their vulnerability to quantum algorithms like Shor’s and Grover’s. This looming threat demands a paradigm shift toward quantum-resistant cryptographic protocols that can safeguard digital assets across dynamic and heterogeneous environments. This study presents a comprehensive analysis of quantum-resistant cryptographic schemes, focusing on lattice-based, hash-based, multivariate polynomial, and code-based approaches. These protocols are critically evaluated in terms of computational efficiency, scalability, resistance to side-channel attacks, and adaptability to multi-tenant cloud architectures. Special emphasis is placed on their integration into hybrid enterprise IT ecosystems, which often comprise on-premises servers, private clouds, and public cloud services each with unique security and compliance requirements. Additionally, the research proposes a layered security model that leverages post-quantum encryption for data-at-rest, hybrid key exchange mechanisms for secure data-in-transit, and secure bootstrapping protocols for cross-domain identity verification. Through simulations and policy analysis, this work demonstrates how quantum-resilient cryptography can be effectively deployed without compromising system performance or interoperability. Ultimately, the findings aim to guide enterprises, cloud providers, and cybersecurity professionals in building forward-compatible, future-proof data protection strategies.
The emergence of quantum computing presents both significant opportunities and critical challenges for modern cybersecurity. While quantum systems promise advances in science, engineering, and artificial intelligence, they also pose a substantial threat to classical cryptographic techniques such as RSA, ECC, and other widely deployed public-key mechanisms. Quantum algorithms including Shor’s and Grover’s are expected to compromise these systems, placing sensitive data, financial infrastructures, and national security at risk. This paper examines the growing field of quantum-resistant, or post-quantum, cryptography with a focus on identifying constructions capable of withstanding quantum attacks. It provides a systematic overview of major post-quantum cryptographic families, including lattice-based, hash-based, code-based, multivariate, and isogeny-related schemes, and evaluates their current security assumptions, practical efficiency, and readiness for real-world deployment. Beyond technical considerations, the paper highlights the organizational and workforce implications of transitioning to quantum-safe systems, emphasizing the need for coordinated global standards and sustained cybersecurity training. This study underscores that building a quantum-secure digital future requires not only adopting resilient algorithms but also strengthening collaborative, adaptive, and proactive security practices.
The emergence of quantum computing introduces unprecedented risks to classical cryptographic schemes, particularly digital signatures that safeguard authentication, confidentiality, and data integrity across digital ecosystems. To address these concerns, this paper investigates the adoption of Post-Quantum Cryptography (PQC) within Public Key Infrastructure (PKI) frameworks, emphasizing its role in strengthening electronic signature (eSign) systems against quantum threats. Traditional PKI implementations rely on algorithms such as RSA and ECC in combination with Hardware Security Modules (HSMs) for secure key management; however, these methods are vulnerable to quantum algorithms like Shor's. We examine how quantum-resistant alternatives-including lattice-based, hash-based, and multivariate polynomial-based schemes standardized by NIST-can be integrated into PKI without compromising interoperability and compliance. A comparative evaluation highlights trade-offs in performance, storage, and computational complexity while demonstrating the feasibility of embedding PQC into existing eSign infrastructures. Our findings underscore the urgency of transitioning towards quantum-safe digital signatures to ensure resilience, regulatory alignment, and long-term trust in national-scale digital services.
The advent of quantum computing presents a paradigm shift in modern cybersecurity, threatening the foundations of classical cryptographic systems such as RSA, ECC, and Diffie–Hellman key exchange. Quantum algorithms like Shor’s and Grover’s can efficiently break these schemes, rendering existing encryption mechanisms vulnerable and obsolete. This growing risk necessitates the development of quantum-resilient or post-quantum cryptographic (PQC) solutions that can safeguard data and computation in the era of quantum networks. Secure Multi-Party Computation (SMPC), a cornerstone of privacy-preserving computation, enables multiple entities to jointly compute a function over their private inputs without revealing them. However, its traditional security assumptions are also undermined by quantum threats. This research aims to explore and evaluate quantum-safe cryptographic protocols for integrating PQC into SMPC frameworks, thereby ensuring both confidentiality and correctness even in the presence of quantum-capable adversaries. The study focuses on lattice-based, hash-based, and code-based cryptographic primitives, analyzing their resilience, efficiency, and scalability when applied to distributed systems. A comparative framework is proposed to assess the performance and security trade-offs of different post-quantum SMPC implementations under realistic network conditions. The findings are expected to contribute to the design of a new class of cryptographic protocols capable of resisting quantum attacks, supporting the secure functioning of next-generation networks, and guiding policymakers and technologists toward practical post-quantum standardization. Ultimately, this research strengthens the bridge between theoretical cryptography and real-world cybersecurity readiness in the post-quantum era.
Abstract—The emergence of quantum computing represents a fundamental challenge to contemporary cryptographic infras- tructures, mandating immediate adoption of quantum-resistant cryptographic standards to ensure long-term security. This paper analyzes how Shor’s algorithm renders RSA , ECC vulnerable by solving integer factorization and discrete alogarithm problems in polynomial time, while Grover’s algorithm weakens symmetric encryption through quadratic speedup attacks. Through compre- hensive cryptanalysis, we evaluate the vulnerabilities of current public-key infrastructures, symmetric ciphers, and hash functions against quantum threats. Our research systematically examines post-quantum cryptographic candidates, including lattice-based, hash-based, and multivariate polynomial schemes under NIST standardization, assessing their security guarantees and imple- mentation challenges. Furthermore, we investigate the broader implications for secure communications, blockchain networks, and authentication protocols in a post-quantum world. Based on our findings, we propose a practical transition framework featuring hybrid cryptographic systems, protocol enhancements, and policy updates to facilitate seamless migration. This work provides critical insights and actionable strategies for securing digital infrastructure against quantum threats while maintaining operational efficiency during the transition period. Index Terms—Cryptographic vulnerability, Grover’s algo- rithm, Post-quantum cryptography, Quantum computing, Quan- tum key distribution, Shor’s algorithm, Cybersecurity
The advent of quantum computing poses a significant existential threat to current public-key cryptographic standards, particularly RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security. Shor's algorithm, if implemented on a sufficiently powerful quantum computer, can efficiently break these foundational schemes, rendering vast amounts of encrypted data vulnerable. This paper investigates lattice-based cryptography as a robust and promising candidate for post-quantum security. We provide a comprehensive analysis of its theoretical underpinnings, focusing on hard problems like the Shortest Vector Problem (SVP) and Learning With Errors (LWE), which are believed to be intractable even for quantum adversaries. Through a detailed literature review and methodological exposition, we examine the construction principles of prominent lattice-based Key Encapsulation Mechanisms (KEMs) and digital signature schemes, such as Kyber and Dilithium, highlighting their inherent security properties and performance characteristics. Our results demonstrate that lattice-based schemes offer competitive efficiency, compact key sizes, and strong security guarantees against both classical and quantum attacks, positioning them as essential building blocks for the post-RSA cryptographic landscape. The discussion elaborates on the practical implications, standardization efforts by NIST, and the challenges associated with the transition to quantum-resilient cryptographic infrastructure. We conclude that lattice-based cryptography is a cornerstone of quantum resilience, critical for securing future digital communications and data integrity.