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

arXiv:2605.17061

quantum-safe: Bridging the Post-Quantum Production Gap with a Hybrid-by-Default Python Cryptography Library

Animesh Shaw

cs.CRquant-phSubmitted May 16, 2026• Announced May 19, 2026• Revised Oct 6, 2026 (v2)
v1 · May 16, 2026v2 · Oct 6, 2026
arXivHTMLPDF

Abstract

FIPS 203, 204 and 205 closed the algorithmic gap in post-quantum cryptography (PQC); the production gap -- hybrid combiners, conformance evidence, migration tooling, stateful signing, protocol helpers -- remains open. A methodology that scores it must not choose its own dimensions, so we anchor nine to external requirements (CNSA 2.0, CMVP, the TNO CADI survey, the IETF hybrid draft). We present quantum-safe, a hybrid-by-default Python library built against this rubric, and an audit of nine PQC libraries (September 2026). The exercise can lower our own score, and it does. Hybrid combiners exist in three of six verifiable libraries, not the one a March-2026 snapshot found. Discovery and inventory tooling is the sharper gap: none of seven audited libraries has it; quantum-safe adds a CycloneDX CBOM. Only Bouncy Castle holds a CMVP FIPS 140-3 certificate; quantum-safe reports 225/225 runnable ACVP known-answer cases, which is conformance evidence, not validation. Bouncy Castle also supports LMS and XMSS where quantum-safe has LMS only, and quantum-safe's defaults sit below the CNSA 2.0 parameter sets; we score both against ourselves. Every benchmark figure is computed from archived raw runs (bootstrap intervals over 15 runs). A full X25519 + ML-KEM-768 handshake takes a median of 231 microseconds under Docker/Linux (95% interval 218-250), 5.3x an X25519-only handshake and 0.46-2.3% of a typical TLS 1.3 budget. Throughput is flat from 100 to 5,000 threads but below the single-thread rate: threads do not speed up the hybrid path, although liboqs does release the GIL in longer calls (ML-DSA-65 signing scales 2.6x on four threads). Timing side channels are treated in a companion paper.

Comments
11 pages, 3 figures, 10 tables. v2 corrects v1: decapsulation was timed on the implicit-rejection path; tables used the fastest of 3 runs and ignored --iterations; the GIL inference was unsupported. Benchmarks re-run (15 runs, raw data archived): handshake 231 us (v1: 243). CoV is now a stability metric. Code: quantum-safe-py 0.3.2, doi:10.5281/zenodo.23008259

Related papers

Quantum-Safe Code Auditing: LLM-Assisted Static Analysis and Quantum-Aware Risk Scoring for Post-Quantum Cryptography Migration

Animesh Shaw

The impending arrival of cryptographically relevant quantum computers (CRQCs) threatens the security foundations of modern software: Shor's algorithm breaks RSA, ECDSA, ECDH, and Diffie-Hellman, while Grover's algorithm reduces the effective security of symmetric and hash-based schemes. Despite NIST standardising post-quantum cryptography (PQC) in 2024 (FIPS 203 ML-KEM, FIPS 204 ML-DSA, FIPS 205 SLH-DSA), most codebases lack automated tooling to inventory classical cryptographic usage and prioritise migration based on quantum risk. We present Quantum-Safe Code Auditor, a quantum-aware static analysis framework that combines (i) regex-based detection of 15 classes of quantum-vulnerable primitives, (ii) LLM-assisted contextual enrichment to classify usage and severity, and (iii) risk scoring via a Variational Quantum Eigensolver (VQE) model implemented in Qiskit 2.x, incorporating qubit-cost estimates to prioritise findings. We evaluate the system across five open-source libraries -- python-rsa, python-ecdsa, python-jose, node-jsonwebtoken, and Bouncy Castle Java -- covering 5,775 findings. On a stratified sample of 602 labelled instances, we achieve 71.98% precision, 100% recall, and an F1 score of 83.71%. All code, data, and reproduction scripts are released as open-source.

cs.CRCross-listedarXiv:2604.00560•Apr 2, 2026

Post-Quantum Cryptography Migration in Communication Networks: A Systematic Review of Protocol Integration, Performance Trade-Offs, and Transition Readiness

Merve Güllü, Esra Söğüt

The prospect of a cryptographically relevant quantum computer (CRQC) undermines the public-key primitives that secure virtually every layer of modern communication networks, from subscriber authentication in cellular cores to transport-layer key exchange. Adversaries already following a harvest-now, decrypt-later (HNDL) strategy make this threat actionable today for any traffic whose confidentiality must outlast a decade. Following NIST’s finalisation of the first post-quantum cryptography (PQC) standards, ML-KEM (FIPS 203), ML-DSA (FIPS 204), and SLH-DSA (FIPS 205) in August 2024, and the selection of HQC as a fourth key-encapsulation candidate in March 2025, research has shifted from algorithm design to network-level integration. This paper reports a PRISMA-2020-compliant systematic literature review of PQC migration in communication networks, structured around five research questions covering protocol and scenario coverage, quantitative performance impact, hybrid cryptography strategies, transition barriers, and open research gaps. Six databases (IEEE Xplore, Scopus, Web of Science, ACM Digital Library, SpringerLink, and MDPI) were searched (3229 records identified); after deduplication, title-keyword screening, full-text eligibility assessment, and a pre-specified quality appraisal (Q1–Q6, threshold ≥3/6) applied to 310 eligible studies, a final synthesis corpus of 141 studies (68 journal articles, 68 conference papers, 4 conference-derived book chapters, 1 workshop paper) was screened, quality-appraised, and synthesised narratively with supporting evidence tables. The review finds that transport-layer protocols (TLS 1.3, QUIC, DTLS 1.3) dominate the literature, that lattice-based ML-KEM/ML-DSA offer the most favourable latency–bandwidth–energy trade-off among standardised families, and that classical–PQC hybrid schemes are the de facto transition strategy across 5G/6G, IoT, VPN, and automotive scenarios, at the cost of 10–100× larger keys/signatures and 8–40% handshake latency overhead. Persistent barriers include constrained-device resource limits, immature hardware acceleration, incomplete IETF/3GPP standardisation, and public-key-infrastructure scaling. We propose a five-level PQC transition-readiness maturity model and identify large-scale field validation, PQC–QKD integration, and lightweight signature schemes as priority directions for future work.

Electronics•Oct 11, 2026•0 citations

Quantum Safe Backend: Design and Implementation of a Post-Quantum Cryptographic Secure Storage and Communication Platform

Sujith B

The accelerating development of large-scale quantum computers poses an existential threat to the public-key cryptographic infrastructure that underpins modern digital communication. Algorithms such as RSA and Elliptic Curve Cryptography (ECC), which currently secure internet traffic, digital signatures, and data-at-rest, are vulnerable to Shor's algorithm running on a sufficiently powerful quantum processor. In response, the U.S. National Institute of Standards and Technology (NIST) finalized the first post-quantum cryptography (PQC) standards in August 2024—FIPS 203 (ML-KEM/Kyber), FIPS 204 (ML-DSA/Dilithium), and FIPS 205 (SLH-DSA/SPHINCS+)—marking the beginning of a global migration toward quantum-resistant cryptography. This paper presents a hybrid C++/Python secure storage and communication platform (source code available at https://github.com/Sujithb128989/Quantum-Safe-Backend) that implements NIST-selected PQC algorithms in a production-oriented architecture. The backend employs CRYSTALS-Dilithium5 for quantum-resistant transport authentication, Kyber for key encapsulation, and AES-256-GCM for symmetric encryption-at-rest, delivered through a dual-stack gRPC/HTTP architecture containerized with Docker. We describe the system's design rationale, detail the cryptographic pipeline from certificate generation to atomic key rotation, and discuss the engineering challenges of integrating post-quantum primitives into real-world software systems.

•Mar 14, 2026•0 citations

AH-KEM: Adaptive Hybrid Key Encapsulation Mechanism for Post-Quantum Secure Cloud Communication

Dvvit Patel, Krish Patel, Aaryan Lunis +1 more

Classical public-key cryptography (RSA-2048, ECDH) is vulnerable to Shor's algorithm on quantum computers, with harvest-now-decrypt-later threats already targeting archived cloud traffic for future decryption. While NIST's 2024 ML-KEM (FIPS 203) and ML-DSA (FIPS 204) standards provide quantumresistant primitives, uniform PQC deployment across diverse cloud workloads remains computationally inefficient and lacks validated hybrid security and scalability. This paper introduces AH-KEM, an adaptive hybrid key encapsulation mechanism for TLS 1.3-compatible cloud communication. The AH-KEM algorithm determines a risk rating for each session from three dimensions-sensitivity of the data, expected length of the session, and network exposure-and then uses a deterministic method to choose among four modes of cryptography, which include Classical-only (X25519/ECDSA), Parallel-Hybrid (X25519/ML-KEM-512/ML-DSA-44), PQC-Dominant(ML-KEM-768/ML-DSA-65), and Full-Hybrid (X25519/ML-KEM-1024/ML-DSA-87). The safe dual-PRF combiner combines the classical and post-quantum shared keys to obtain a single session key that is secure in the Quantum Random Oracle Model if either KEM used is secure. Implemented in Python with FIPS-compliant software stubs on a Lenovo LOQ 15APH8 (AMD Ryzen 7 7840HS), AH-KEM demonstrates that, when both are generated fresh per session to satisfy forward secrecy, ML-KEM-768 key generation is over 11, 000× faster than RSA-2048 (0.004 ms vs. 44.335 ms); note RSA keys are not conventionally regenerated per session in deployed TLS, so this comparison isolates the cost of per-session ephemeral generation rather than RSA's typical amortized cost. Full-Hybrid end-to-end handshake latency is 0.514 ms (a sub-millisecond overhead); servers sustain zero errors at 250 concurrent clients; and risk classification achieves 100.0% accuracy over 10,000 sessions.

IEEE International Conference on Public Key Infrastructure and its Applications (PKIA)•Sep 1, 2026•0 citations

Post-Quantum Migration for Secure Protocols: Building a Quantum-Safe Internet

Sachin Ware, Shalini Wankhade, Chudaman Devidasrao Sukte +3 more

The short boom of quantum computing is a critical threat to traditional cryptographic requirements like RSA & ECC. this means we need to replace to post-Quantum Cryptography proper away. This research presents an elaborate, enterprise-level migration process for PQC based on a hybrid TLS model that provides backwards compatibility and utilizes quantum-resistant algorithms. This model enables the transition process from the identification of cryptographic assets, risk assessment through indicators, to the gradual deployment of infrastructure. To verify the applicability of such a model in practice, experiments were carried out on an Intel Core i7-powered platform using the OQS library. The hybrid handshake model, which combines X25519 with ML-KEM-768, only adds a latency overhead of 1.2 to 1.5 milliseconds and increases the CPU usage from 3% to 7%. This indicates that the process can be carried out without the need to entirely restructure the existing infrastructure, as evidenced by the stability benchmarks provided in this research paper. Based on these observations, the research concludes that hybrid cryptography presents an effective approach to mitigating quantum computing risks, with negligible overhead costs and high machine performance.

International Conference on Advancements in Smart, Secure and Intelligent Computing (ASSIC)•Aug 1, 2026•0 citations

Quantum Safe Public Key Infrastructure: Hybrid Classical PQC Certificate Chains and Migration Framework for Enterprise TLS

Pavan Navandar

The imminent threat of cryptographically relevant quantum computers (CRQCs) to RSA and elliptic curve cryptography — combined with the 'harvest now, decrypt later' attack paradigm — necessitates an urgent enterprise PKI migration to post quantum cryptographic (PQC) algorithms. This paper presents a comprehensive hybrid PKI framework enabling phased, backward compatible migration from classical to post quantum certificate chains. The framework embeds dual signatures (ECDSA + CRYSTALS Dilithium3) within X.509v3 certificates following the emerging RFC 9480 composite certificate standard. We provide Algorithm 2 (HybridCertIssue) specifying the complete certificate generation and verification protocol, and a migration roadmap structured across five phases from 2021 to 2035+. Experimental evaluation on a 10,000 node enterprise PKI demonstrates: TLS handshake overhead of +4.6 KB, latency increase of +38ms (LAN p50), and Dilithium3 signing throughput of 800 ops/sec on FIPS 140 3 HSMs. Security proofs establish that the hybrid scheme is secure if either the classical or PQC scheme is unforgeable — requiring an adversary to simultaneously break both ECDSA and Dilithium3. The migration cost model scales O(n log n) for n node PKI hierarchies. A 30 organization survey quantifies migration readiness: only 41% have completed cryptographic asset inventory, representing the critical first blocker.

International Journal of Engineering & Extended Technologies Research•Jul 10, 2024•2 citations
FIPS 203, 204 and 205 closed the algorithmic gap in post-quantum cryptography (PQC); the production gap -- hybrid combiners, conformance evidence, migration tooling, stateful signing, protocol helpers -- remains open. A methodology that scores it must not choose its own dimensions, so we anchor nine to external requirements (CNSA 2.0, CMVP, the TNO CADI survey, the IETF hybrid draft). We present quantum-safe, a hybrid-by-default Python library built against this rubric, and an audit of nine PQC libraries (September 2026). The exercise can lower our own score, and it does.
Hybrid combiners exist in three of six verifiable libraries, not the one a March-2026 snapshot found. Discovery and inventory tooling is the sharper gap: none of seven audited libraries has it; quantum-safe adds a CycloneDX CBOM. Only Bouncy Castle holds a CMVP FIPS 140-3 certificate; quantum-safe reports 225/225 runnable ACVP known-answer cases, which is conformance evidence, not validation. Bouncy Castle also supports LMS and XMSS where quantum-safe has LMS only, and quantum-safe's defaults sit below the CNSA 2.0 parameter sets; we score both against ourselves.
Every benchmark figure is computed from archived raw runs (bootstrap intervals over 15 runs). A full X25519 + ML-KEM-768 handshake takes a median of 231 microseconds under Docker/Linux (95% interval 218-250), 5.3x an X25519-only handshake and 0.46-2.3% of a typical TLS 1.3 budget. Throughput is flat from 100 to 5,000 threads but below the single-thread rate: threads do not speed up the hybrid path, although liboqs does release the GIL in longer calls (ML-DSA-65 signing scales 2.6x on four threads). Timing side channels are treated in a companion paper.
The impending arrival of cryptographically relevant quantum computers (CRQCs) threatens the security foundations of modern software: Shor's algorithm breaks RSA, ECDSA, ECDH, and Diffie-Hellman, while Grover's algorithm reduces the effective security of symmetric and hash-based schemes. Despite NIST standardising post-quantum cryptography (PQC) in 2024 (FIPS 203 ML-KEM, FIPS 204 ML-DSA, FIPS 205 SLH-DSA), most codebases lack automated tooling to inventory classical cryptographic usage and prioritise migration based on quantum risk. We present Quantum-Safe Code Auditor, a quantum-aware static analysis framework that combines (i) regex-based detection of 15 classes of quantum-vulnerable primitives, (ii) LLM-assisted contextual enrichment to classify usage and severity, and (iii) risk scoring via a Variational Quantum Eigensolver (VQE) model implemented in Qiskit 2.x, incorporating qubit-cost estimates to prioritise findings. We evaluate the system across five open-source libraries -- python-rsa, python-ecdsa, python-jose, node-jsonwebtoken, and Bouncy Castle Java -- covering 5,775 findings. On a stratified sample of 602 labelled instances, we achieve 71.98% precision, 100% recall, and an F1 score of 83.71%. All code, data, and reproduction scripts are released as open-source.
The prospect of a cryptographically relevant quantum computer (CRQC) undermines the public-key primitives that secure virtually every layer of modern communication networks, from subscriber authentication in cellular cores to transport-layer key exchange. Adversaries already following a harvest-now, decrypt-later (HNDL) strategy make this threat actionable today for any traffic whose confidentiality must outlast a decade. Following NIST’s finalisation of the first post-quantum cryptography (PQC) standards, ML-KEM (FIPS 203), ML-DSA (FIPS 204), and SLH-DSA (FIPS 205) in August 2024, and the selection of HQC as a fourth key-encapsulation candidate in March 2025, research has shifted from algorithm design to network-level integration. This paper reports a PRISMA-2020-compliant systematic literature review of PQC migration in communication networks, structured around five research questions covering protocol and scenario coverage, quantitative performance impact, hybrid cryptography strategies, transition barriers, and open research gaps. Six databases (IEEE Xplore, Scopus, Web of Science, ACM Digital Library, SpringerLink, and MDPI) were searched (3229 records identified); after deduplication, title-keyword screening, full-text eligibility assessment, and a pre-specified quality appraisal (Q1–Q6, threshold ≥3/6) applied to 310 eligible studies, a final synthesis corpus of 141 studies (68 journal articles, 68 conference papers, 4 conference-derived book chapters, 1 workshop paper) was screened, quality-appraised, and synthesised narratively with supporting evidence tables. The review finds that transport-layer protocols (TLS 1.3, QUIC, DTLS 1.3) dominate the literature, that lattice-based ML-KEM/ML-DSA offer the most favourable latency–bandwidth–energy trade-off among standardised families, and that classical–PQC hybrid schemes are the de facto transition strategy across 5G/6G, IoT, VPN, and automotive scenarios, at the cost of 10–100× larger keys/signatures and 8–40% handshake latency overhead. Persistent barriers include constrained-device resource limits, immature hardware acceleration, incomplete IETF/3GPP standardisation, and public-key-infrastructure scaling. We propose a five-level PQC transition-readiness maturity model and identify large-scale field validation, PQC–QKD integration, and lightweight signature schemes as priority directions for future work.
The accelerating development of large-scale quantum computers poses an existential threat to the public-key cryptographic infrastructure that underpins modern digital communication. Algorithms such as RSA and Elliptic Curve Cryptography (ECC), which currently secure internet traffic, digital signatures, and data-at-rest, are vulnerable to Shor's algorithm running on a sufficiently powerful quantum processor. In response, the U.S. National Institute of Standards and Technology (NIST) finalized the first post-quantum cryptography (PQC) standards in August 2024—FIPS 203 (ML-KEM/Kyber), FIPS 204 (ML-DSA/Dilithium), and FIPS 205 (SLH-DSA/SPHINCS+)—marking the beginning of a global migration toward quantum-resistant cryptography. This paper presents a hybrid C++/Python secure storage and communication platform (source code available at https://github.com/Sujithb128989/Quantum-Safe-Backend) that implements NIST-selected PQC algorithms in a production-oriented architecture. The backend employs CRYSTALS-Dilithium5 for quantum-resistant transport authentication, Kyber for key encapsulation, and AES-256-GCM for symmetric encryption-at-rest, delivered through a dual-stack gRPC/HTTP architecture containerized with Docker. We describe the system's design rationale, detail the cryptographic pipeline from certificate generation to atomic key rotation, and discuss the engineering challenges of integrating post-quantum primitives into real-world software systems.
Classical public-key cryptography (RSA-2048, ECDH) is vulnerable to Shor's algorithm on quantum computers, with harvest-now-decrypt-later threats already targeting archived cloud traffic for future decryption. While NIST's 2024 ML-KEM (FIPS 203) and ML-DSA (FIPS 204) standards provide quantumresistant primitives, uniform PQC deployment across diverse cloud workloads remains computationally inefficient and lacks validated hybrid security and scalability. This paper introduces AH-KEM, an adaptive hybrid key encapsulation mechanism for TLS 1.3-compatible cloud communication. The AH-KEM algorithm determines a risk rating for each session from three dimensions-sensitivity of the data, expected length of the session, and network exposure-and then uses a deterministic method to choose among four modes of cryptography, which include Classical-only (X25519/ECDSA), Parallel-Hybrid (X25519/ML-KEM-512/ML-DSA-44), PQC-Dominant(ML-KEM-768/ML-DSA-65), and Full-Hybrid (X25519/ML-KEM-1024/ML-DSA-87). The safe dual-PRF combiner combines the classical and post-quantum shared keys to obtain a single session key that is secure in the Quantum Random Oracle Model if either KEM used is secure. Implemented in Python with FIPS-compliant software stubs on a Lenovo LOQ 15APH8 (AMD Ryzen 7 7840HS), AH-KEM demonstrates that, when both are generated fresh per session to satisfy forward secrecy, ML-KEM-768 key generation is over 11, 000× faster than RSA-2048 (0.004 ms vs. 44.335 ms); note RSA keys are not conventionally regenerated per session in deployed TLS, so this comparison isolates the cost of per-session ephemeral generation rather than RSA's typical amortized cost. Full-Hybrid end-to-end handshake latency is 0.514 ms (a sub-millisecond overhead); servers sustain zero errors at 250 concurrent clients; and risk classification achieves 100.0% accuracy over 10,000 sessions.
The short boom of quantum computing is a critical threat to traditional cryptographic requirements like RSA & ECC. this means we need to replace to post-Quantum Cryptography proper away. This research presents an elaborate, enterprise-level migration process for PQC based on a hybrid TLS model that provides backwards compatibility and utilizes quantum-resistant algorithms. This model enables the transition process from the identification of cryptographic assets, risk assessment through indicators, to the gradual deployment of infrastructure. To verify the applicability of such a model in practice, experiments were carried out on an Intel Core i7-powered platform using the OQS library. The hybrid handshake model, which combines X25519 with ML-KEM-768, only adds a latency overhead of 1.2 to 1.5 milliseconds and increases the CPU usage from 3% to 7%. This indicates that the process can be carried out without the need to entirely restructure the existing infrastructure, as evidenced by the stability benchmarks provided in this research paper. Based on these observations, the research concludes that hybrid cryptography presents an effective approach to mitigating quantum computing risks, with negligible overhead costs and high machine performance.
The imminent threat of cryptographically relevant quantum computers (CRQCs) to RSA and elliptic curve cryptography — combined with the 'harvest now, decrypt later' attack paradigm — necessitates an urgent enterprise PKI migration to post quantum cryptographic (PQC) algorithms. This paper presents a comprehensive hybrid PKI framework enabling phased, backward compatible migration from classical to post quantum certificate chains. The framework embeds dual signatures (ECDSA + CRYSTALS Dilithium3) within X.509v3 certificates following the emerging RFC 9480 composite certificate standard. We provide Algorithm 2 (HybridCertIssue) specifying the complete certificate generation and verification protocol, and a migration roadmap structured across five phases from 2021 to 2035+. Experimental evaluation on a 10,000 node enterprise PKI demonstrates: TLS handshake overhead of +4.6 KB, latency increase of +38ms (LAN p50), and Dilithium3 signing throughput of 800 ops/sec on FIPS 140 3 HSMs. Security proofs establish that the hybrid scheme is secure if either the classical or PQC scheme is unforgeable — requiring an adversary to simultaneously break both ECDSA and Dilithium3. The migration cost model scales O(n log n) for n node PKI hierarchies. A 30 organization survey quantifies migration readiness: only 41% have completed cryptographic asset inventory, representing the critical first blocker.