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 Symposium on Networks, Computers and Communications (ISNCC)

Data Privacy and Security in the Quantum Era: A Comparative Evaluation between Classical and Post-Quantum Cryptography

Sérgio Mendonça, Valderi Reis Quietinho Leithardt, Paul Andrew Crocker

Published Sep 1, 2026• 1 citation
Publisher

Abstract

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.

DOI
10.1109/isncc70543.2026.11693868

Related papers

Quantum-Safe Cryptography: Securing the Post-Quantum Era through AI-Driven Innovations

Ravi Teja Avireneni, Sri Harsha Koneru, Naresh Kiran Kumar Reddy Yelkoti +1 more

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.

European Journal of Technology•Apr 17, 2024•0 citations

Post-Quantum Cryptography and Its Implementation

Asir Jebaraj, Suresh Chavhan

Cryptography has evolved from ancient substitution ciphers to modern mathematical algorithms including Rivest–Shamir–Adleman (RSA), elliptic curve cryptography (ECC), and advanced encryption standard (AES) that form the core of security systems, along with the major information security objectives: confidentiality, integrity, authenticity, availability, accountability, nonrepudiation, and privacy and their practical applications in protocols such as transport layer security (TLS), Internet Protocol Security (IPsec), and Secure/Multipurpose Internet Mail Extensions (S/MIME). The security of RSA, ECC, and symmetric-key ciphers has been threatened by quantum computers that exploit Shor’s and Grover’s algorithms. In response to this quantum threat, NIST has standardized post-quantum cryptographic PQC) algorithms: ML-KEM, a lattice-based key encapsulation mechanism and ML-DSA, a lattice-based digital signature scheme. This chapter surveys the development of cryptographic systems from transposition ciphers to post-quantum cryptography, examining their mathematical foundations, operational mechanisms, and respective security properties. In addition to these, the PQC algorithms have been implemented in TLS 1.3, and a comparative analysis has been performed. The study traces the history of cryptography while understanding post-quantum standards as the necessary foundation for long-term information security in the quantum era.

CRC Press eBooks•Oct 2, 2026•0 citations

Post-Quantum Cryptography Preparing for the Quantum Threat to Digital Security

Olatunji Olusola Ogundipe

The impressively fast development of quantum computing is a serious threat to classical public-key cryptography, and algorithms such as Shor's and Grover's will render RSA and elliptic curve systems essentially useless as soon as a cryptanalytically relevant quantum computer becomes available. Although it is still some way off before such machines are available, the harvest-now-encrypt-later threat highlights the need for proactive defense. In response, the National Institute of Standards and Technology (NIST) published the first post-quantum cryptography standards in 2024, including ML-KEM (Kyber) for key establishment, ML-DSA (Dilithium) for digital signatures and SLH-DSA (SPHINCS+) as a stateless hash-based alternative. This paper is a summary of the evolving post-quantum landscape, starting with the standards and their underlying security and then moving on to migration policies such as CNSA 2.0 and CISA, NSA and NIST guidance. It also looks at integration patterns for important protocols such as TLS, IPsec, SSH, and code signing. A performance, interoperability and overhead evaluation methodology is presented with results showing that hybrid deployment and crypto-agile architectures make PQC adoption a viable option. The paper concludes by providing a governance-oriented roadmap, where inventory, prioritization and pilot deployments are identified as near-term actions, with open questions remaining on performance optimization, implementation security and algorithm resilience over time.

Journal of Science Technology and Engineering Research•Sep 30, 2024•1 citation

A STUDY OF POST-QUANTUM CRYPTOGRAPHIC ALGORITHMS FOR SECURE COMMUNICATION

Preeti Sharma

This study reviews post-quantum cryptographic algorithms for secure communication, focusing on standardized lattice-based schemes and their practical deployment implications. Classical public-key systems such as RSA and elliptic curve cryptography remain central to secure communication, but their long-term security is threatened by quantum algorithms capable of solving factorization and discrete logarithm problems. The study adopts a hybrid approach combining literature-based review with dataset-driven performance analysis. The empirical evaluation compares ML-KEM and ML-DSA with RSA-4096 and ECDSA-P256 using CPU benchmarking and network simulation metrics. Results indicate that ML-KEM provides substantial computational advantages over RSA-4096, making it suitable for latency-sensitive key establishment. ML-DSA also demonstrates competitive performance, especially in verification, but introduces larger signature sizes than ECDSA-P256. The analysis shows that the main deployment challenge is not computational feasibility but increased communication overhead caused by larger keys, ciphertexts, and signatures. These findings suggest that post-quantum migration requires more than direct algorithm replacement. Effective deployment should involve protocol optimization, crypto-agility, hybrid transition strategies, and context-specific parameter selection. Although the dataset focuses mainly on lattice-based algorithms, the study confirms the practical relevance of standardized post-quantum schemes for future secure communication infrastructure and identifies directions for broader evaluation across additional PQC families, including code-based, hash-based, multivariate approaches, real-world networks, and implementation-level security testing in practice contexts.

IJRDO-Journal of Applied Science•Jan 1, 2026•0 citations

Survey on Quantum-Safe Cryptography for PostQuantum Internet Security

MURALI KRISHNA DARA

The threats are existential to the traditional cryptosystems of public keys, including RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), due to the rapid progress in quantum computing. Such algorithms as the Shor and Grover algorithms prove that as soon as large scale quantum computers are achieved, these classical cryptographic protocols will not provide any privacy and integrity to online communication. This has created an emergency to find post-quantum cryptography (PQC), or quantum-safe cryptography, which will resist attacks by both classical and quantum attackers. The paper is a review of the latest research and development in post-quantum cryptographic algorithms and their implementation in current security systems. We organize quantum-safe methods into significant organizations such as lattice-based, hash-based, multivariate polynomial-based and code-based encrypted communications. Each type has been evaluated critically based on computational efficiency, key sizes, speed of encryption/decryption and security proofs. The survey also examines the current standardization activities happening in the world and especially the U.S. National Institute of Standards and Technology (NIST) PQC competition, which lists candidate algorithms that have advanced to standard adoption. Besides this, the paper addresses hybrid cryptographic designs that use both classical and post-quantum bases in ensuring a seamless migration in the transition phase. Internet security protocols like TLS, VPNs and blockchain consensus as applications of PQC are examined in detail. Lastly, we pinpoint open research issues, which include creating lightweight PQC to support resource-constrained IoT devices, balancing performance and strong security assurances, and interoperability between the new PQC algorithms and existing infrastructures. Through detailed survey we inform the future of researchers, practitioners, and policymakers on the preparation of the post-quantum era of secure digital communications.

International Journal of Engineering Research and Science & Technology•Feb 6, 2024•0 citations

Benchmarking NIST Post-Quantum Standards: A Comparative Performance and Bandwidth Analysis of ML-KEM, ML-DSA, and RSA-3072

Y. Nagaraju, Manoj G C, Punith kumar +3 more

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 to$32 \times$relative to elliptic-curve counterpartsML-KEM-768 decapsulation is approximately$108 \times$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.

International Conference on Ambient Intelligence, Knowledge Informatics and Industrial Electronics (AIKIIE)•Aug 1, 2026•0 citations
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.
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.
Cryptography has evolved from ancient substitution ciphers to modern mathematical algorithms including Rivest–Shamir–Adleman (RSA), elliptic curve cryptography (ECC), and advanced encryption standard (AES) that form the core of security systems, along with the major information security objectives: confidentiality, integrity, authenticity, availability, accountability, nonrepudiation, and privacy and their practical applications in protocols such as transport layer security (TLS), Internet Protocol Security (IPsec), and Secure/Multipurpose Internet Mail Extensions (S/MIME). The security of RSA, ECC, and symmetric-key ciphers has been threatened by quantum computers that exploit Shor’s and Grover’s algorithms. In response to this quantum threat, NIST has standardized post-quantum cryptographic PQC) algorithms: ML-KEM, a lattice-based key encapsulation mechanism and ML-DSA, a lattice-based digital signature scheme. This chapter surveys the development of cryptographic systems from transposition ciphers to post-quantum cryptography, examining their mathematical foundations, operational mechanisms, and respective security properties. In addition to these, the PQC algorithms have been implemented in TLS 1.3, and a comparative analysis has been performed. The study traces the history of cryptography while understanding post-quantum standards as the necessary foundation for long-term information security in the quantum era.
The impressively fast development of quantum computing is a serious threat to classical public-key cryptography, and algorithms such as Shor's and Grover's will render RSA and elliptic curve systems essentially useless as soon as a cryptanalytically relevant quantum computer becomes available. Although it is still some way off before such machines are available, the harvest-now-encrypt-later threat highlights the need for proactive defense. In response, the National Institute of Standards and Technology (NIST) published the first post-quantum cryptography standards in 2024, including ML-KEM (Kyber) for key establishment, ML-DSA (Dilithium) for digital signatures and SLH-DSA (SPHINCS+) as a stateless hash-based alternative. This paper is a summary of the evolving post-quantum landscape, starting with the standards and their underlying security and then moving on to migration policies such as CNSA 2.0 and CISA, NSA and NIST guidance. It also looks at integration patterns for important protocols such as TLS, IPsec, SSH, and code signing. A performance, interoperability and overhead evaluation methodology is presented with results showing that hybrid deployment and crypto-agile architectures make PQC adoption a viable option. The paper concludes by providing a governance-oriented roadmap, where inventory, prioritization and pilot deployments are identified as near-term actions, with open questions remaining on performance optimization, implementation security and algorithm resilience over time.
This study reviews post-quantum cryptographic algorithms for secure communication, focusing on standardized lattice-based schemes and their practical deployment implications. Classical public-key systems such as RSA and elliptic curve cryptography remain central to secure communication, but their long-term security is threatened by quantum algorithms capable of solving factorization and discrete logarithm problems. The study adopts a hybrid approach combining literature-based review with dataset-driven performance analysis. The empirical evaluation compares ML-KEM and ML-DSA with RSA-4096 and ECDSA-P256 using CPU benchmarking and network simulation metrics. Results indicate that ML-KEM provides substantial computational advantages over RSA-4096, making it suitable for latency-sensitive key establishment. ML-DSA also demonstrates competitive performance, especially in verification, but introduces larger signature sizes than ECDSA-P256. The analysis shows that the main deployment challenge is not computational feasibility but increased communication overhead caused by larger keys, ciphertexts, and signatures. These findings suggest that post-quantum migration requires more than direct algorithm replacement. Effective deployment should involve protocol optimization, crypto-agility, hybrid transition strategies, and context-specific parameter selection. Although the dataset focuses mainly on lattice-based algorithms, the study confirms the practical relevance of standardized post-quantum schemes for future secure communication infrastructure and identifies directions for broader evaluation across additional PQC families, including code-based, hash-based, multivariate approaches, real-world networks, and implementation-level security testing in practice contexts.
The threats are existential to the traditional cryptosystems of public keys, including RSA, Diffie-Hellman, and elliptic curve cryptography (ECC), due to the rapid progress in quantum computing. Such algorithms as the Shor and Grover algorithms prove that as soon as large scale quantum computers are achieved, these classical cryptographic protocols will not provide any privacy and integrity to online communication. This has created an emergency to find post-quantum cryptography (PQC), or quantum-safe cryptography, which will resist attacks by both classical and quantum attackers. The paper is a review of the latest research and development in post-quantum cryptographic algorithms and their implementation in current security systems. We organize quantum-safe methods into significant organizations such as lattice-based, hash-based, multivariate polynomial-based and code-based encrypted communications. Each type has been evaluated critically based on computational efficiency, key sizes, speed of encryption/decryption and security proofs. The survey also examines the current standardization activities happening in the world and especially the U.S. National Institute of Standards and Technology (NIST) PQC competition, which lists candidate algorithms that have advanced to standard adoption. Besides this, the paper addresses hybrid cryptographic designs that use both classical and post-quantum bases in ensuring a seamless migration in the transition phase. Internet security protocols like TLS, VPNs and blockchain consensus as applications of PQC are examined in detail. Lastly, we pinpoint open research issues, which include creating lightweight PQC to support resource-constrained IoT devices, balancing performance and strong security assurances, and interoperability between the new PQC algorithms and existing infrastructures. Through detailed survey we inform the future of researchers, practitioners, and policymakers on the preparation of the post-quantum era of secure digital communications.
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×32 \times32×relative to elliptic-curve counterpartsML-KEM-768 decapsulation is approximately108×108 \times108×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.