Introduction Session establishment, the process by which two parties authenticate each other and derive a shared secret key, forms the foundation for secure digital communication. Quantum computers threaten this foundation by breaking classical public-key primitives such as RSA and elliptic-curve Diffie–Hellman (ECDH), thereby enabling harvest-now–decrypt-later (HNDL) attacks that endanger long-term confidentiality. Methods This paper presents the design, implementation, and evaluation of an authenticated, quantum-resistant session protocol that replaces these vulnerable mechanisms with their post-quantum counterparts. The proposed protocol integrates ML-KEM-1024 (FIPS 203; CRYSTALS, Kyber) for ephemeral key exchange, ML-DSA-65 (FIPS 204; CRYSTALS, Dilithium) for endpoint authentication, and AES-256-GCM for symmetric protection. A transcript-bound HKDF–SHA3-256 key schedule and a 96-bit GCM nonce construction with conservative rekey limits are used to ensure forward secrecy, downgrade resistance, and message integrity. A Python/C prototype (PQClean ML-KEM-1024 with PyCryptodome AES-256-GCM) was benchmarked over 1,000 iterations on commodity hardware. Results The results show that sub-millisecond cryptographic overhead ML-KEM-1024 matches the performance of X25519 while vastly outperforming RSA-3072 in secure session establishment, and symmetric encryption remains cost effective. Nonces are unique 96-bit values, never reused across directions or beyond 2³² records, following NIST SP 800-38D; when nonce-misuse resistance is required, AES-256-GCM-SIV (RFC 8452) is supported as a drop-in alternative. Empirical tests under both local and WAN-emulated ( ≈ 40 ms RTT) network conditions confirm that the additional post-quantum cost maintains the handshake cryptographic latency in the 0.50–0.70 ms range. Discussion These results demonstrate that fully authenticated, forward-secure, quantum-resistant session negotiation is practical for real-world deployments.
Introduction Session establishment, the process by which two parties authenticate each other and derive a shared secret key, forms the foundation for secure digital communication. Quantum computers threaten this foundation by breaking classical public-key primitives such as RSA and elliptic-curve Diffie–Hellman (ECDH), thereby enabling harvest-now–decrypt-later (HNDL) attacks that endanger long-term confidentiality. Methods This paper presents the design, implementation, and evaluation of an authenticated, quantum-resistant session protocol that replaces these vulnerable mechanisms with their post-quantum counterparts. The proposed protocol integrates ML-KEM-1024 (FIPS 203; CRYSTALS, Kyber) for ephemeral key exchange, ML-DSA-65 (FIPS 204; CRYSTALS, Dilithium) for endpoint authentication, and AES-256-GCM for symmetric protection. A transcript-bound HKDF–SHA3-256 key schedule and a 96-bit GCM nonce construction with conservative rekey limits are used to ensure forward secrecy, downgrade resistance, and message integrity. A Python/C prototype (PQClean ML-KEM-1024 with PyCryptodome AES-256-GCM) was benchmarked over 1,000 iterations on commodity hardware. Results The results show that sub-millisecond cryptographic overhead ML-KEM-1024 matches the performance of X25519 while vastly outperforming RSA-3072 in secure session establishment, and symmetric encryption remains cost effective. Nonces are unique 96-bit values, never reused across directions or beyond 2³² records, following NIST SP 800-38D; when nonce-misuse resistance is required, AES-256-GCM-SIV (RFC 8452) is supported as a drop-in alternative. Empirical tests under both local and WAN-emulated ( ≈ 40 ms RTT) network conditions confirm that the additional post-quantum cost maintains the handshake cryptographic latency in the 0.50–0.70 ms range. Discussion These results demonstrate that fully authenticated, forward-secure, quantum-resistant session negotiation is practical for real-world deployments.
Abstract - Most secure messaging today relies on RSA or elliptic-curve Diffie–Hellman, which a sufficiently large quantum computer could break, and traffic recorded today can be stored and decrypted later. This paper describes a multi-client secure communication system that uses post-quantum cryptography for session-key establishment. Key encapsulation uses ML-KEM-768 (FIPS 203) by default, identities and key-distribution packets are signed with ML-DSA-65 (FIPS 204), and message and file contents are protected with AES-256-GCM. The relay server routes traffic and metadata but is not a cryptographic authority: a receiver verifies a packet's signature against its own locally held key before decapsulating or installing any key, and a peer is trusted only after explicit out-of-band confirmation. We evaluated the system with 200-iteration micro-benchmarks, 2,188 automated tests in 15 batches, 33 UI-driven acceptance tests and six attack and fault scenarios. In this implementation, a full MLKEM-768 session-key round trip takes 8.16ms against 0.51ms for RSA-2048, a gap that mainly reflects a pure-Python MLKEM library compared with native RSA. ML-KEM-768 public keys and ciphertexts are 4.6 and 4.3 times larger. ML-DSA65 signing averages 0.62ms. Every forged, stripped, malformed or tampered input was rejected before any key was installed. Manual acceptance testing and real-hardware audio checks remain open.
The emergence of fault-tolerant quantum computing poses an existential threat to classical public-key cryptographic systems, including RSA and Elliptic Curve Cryptography (ECC), through Shor's polynomial-time factorization algorithm. The Harvest Now, Decrypt Later (HNDL) attack paradigm further amplifies this threat by enabling adversaries to archive ciphertext today for future quantum-enabled decryption, rendering long-term data confidentiality immediately at risk. While the National Institute of Standards and Technology (NIST) finalized post-quantum cryptographic standards ML-KEM (FIPS 203) and ML-DSA (FIPS 204) in August 2024, their practical integration into complete application-level communication systems remains a largely unaddressed research gap. This paper presents QuantumShield, a hybrid post-quantum secure peer-to-peer communication platform that integrates ML-KEM-768 for quantum-safe key encapsulation, ML-DSA-65 for authenticated digital signatures, and AES-256-GCM for high-throughput symmetric encryption. Our primary research contribution is a rigorous empirical analysis of PQC integration overhead in a real-world communication pipeline, quantifying latency, key size, and security trade-offs against classical RSA-2048 and ECC-256 baselines under controlled experimental conditions. Experimental evaluation across 1,000 iterations demonstrates that ML-KEM-768 encapsulation completes in 2.8 ± 0.2 ms compared to 4.1 ± 0.3 ms for ECDH key agreement — a 32% latency reduction while providing NIST Level 3 post-quantum security. The complete secure transfer pipeline processes 1 MB files in under 22 ms on commodity hardware. The system further provides interactive cryptographic visualization, adversary threat modeling, tamper detection simulation, and a hybrid migration framework demonstrating practical transition from classical to post-quantum infrastructure. QuantumShield establishes that quantum-safe communication is not merely theoretical but deployable today with negligible performance compromise.
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.
Quantum computing poses a serious long-term risk to modern cryptographic systems, including the widely used Signal messaging protocol. This research work addresses that risk by integrating ML-KEM-768, a NIST-standardized post-quantum algorithm specified in FIPS 203, as an additional security layer within Signal Desktop. The proposed implementation applies a quantum-resistant wrapping layer to message content before encryption by Signal’s existing Double Ratchet protocol, thereby creating a hybrid cryptographic design that strengthens protection against both classical and quantum adversaries. The system uses ML-KEM-768 key encapsulation from the @noble/post-quantum library together with AES-256-GCM authenticated encryption from @noble/ciphers. This process produces 1088-byte KEM ciphertexts with 32-byte shared secrets and adds about 1104 bytes of overhead per message. Performance evaluation using two live Signal Desktop instances shows that the additional post-quantum layer introduces only modest latency. ML-KEM-768 encapsulation averages 0.67 ms, decapsulation averages 2.27 ms, and total message preparation overhead averages 13.0ms, which remains well below the 100 ms threshold commonly associated with instantaneous user interaction. Additionally, a second set of experiments evaluated image attachment encryption (100 KB, 500 KB, and 2 MB), confirming that ML-KEM-768 encapsulation cost remains constant at approximately 0.4 ms regardless of payload size while AES-256-GCM bulk encryption scales linearly, making the post-quantum overhead negligible for large media. A third stress test evaluated robustness under load, achieving 913 messages per second in burst mode with sub-millisecond wrap latency, and confirming stable performance with no degradation across sustained operation at 10 messages per second over 60 s. Overall, this work demonstrates that post-quantum cryptography can be integrated into a real messaging system in a practical manner, helping address the harvest now, decrypt later threat while preserving usability and strengthening long-term communication security.
The accelerating maturation of quantum computing technology-exemplified by IBM's Eagle, Osprey, and Condor processors surpassing 1,000+ physical qubits-represents a strategic and existential threat to the public-key cryptographic foundations of modern digital infrastructure.The mathematical intractability assumptions underlying RSA (integer factorization), Diffie-Hellman (discrete logarithm), and Elliptic Curve Cryptography (elliptic curve discrete logarithm problem) are rendered computationally negligible by Shor's polynomial-time quantum algorithm.Simultaneously, Grover's unstructured quantum search algorithm halves the effective security of all symmetric encryption schemes, requiring doubling of key lengths.The consequent "Harvest Now, Decrypt Later" (HNDL) attack paradigm-wherein encrypted communications are archived today for future quantum decryption-transforms post-quantum cryptographic migration from a future concern into an immediate operational imperative for all communications with confidentiality lifetimes exceeding five years.This paper presents a comprehensive Hybrid Post-Quantum Cryptographic (HPQC) framework that systematically integrates NIST-finalized post-quantum algorithms-CRYSTALS-Kyber (FIPS 203) for Key Encapsulation Mechanisms, CRYSTALS-Dilithium (FIPS 204) and SPHINCS+ (FIPS 205) for digital signatureswith classical cryptographic primitives (ECDH P-256/X25519, ECDSA, AES-256-GCM) in a layered, crypto-agile, formally proven, and operationally deployable security architecture.Twenty mathematical formulae are derived and presented, covering Shor/Grover complexity bounds, Module-LWE and Module-SIS hardness parameters, hybrid HKDF-SHA-512 key derivation, IND-CCA2 and EUF-CMA security reductions, forward secrecy entropy bounds, and crypto-agility rotation period calculations.Formal Theorems 1 and 2 establish the security of the hybrid KEM and hybrid signature constructions respectively.Simulated performance benchmarks across three hardware tiers (Intel Xeon server, ARM Cortex-A72 edge gateway, ARM Cortex-M4 IoT device) demonstrate 23-31% TLS 1.3 handshake latency overhead over classical baselines with full quantum resistance.Seven comparative tables and five architectural figures support the engineering-ready deployment guidance provided across 5G/6G, massive IoT, SDN, and cloud-native environments.A four-phase crypto-agile migration roadmap aligned with NIST FIPS 203/204/205, NIST SP 800-208, NSA CNSA 2.0, BSI TR-02102, and ENISA PQC guidance is presented for enterprise network operators and security architects.
The rise of quantum computers threatens the security of current TLS protocols, which rely on elliptic curve and RSA-based primitives that quantum algorithms like Shor's can break. This creates a “store now, decrypt later” risk, where attackers may collect encrypted data today to decrypt it in the future once quantum capabilities advance. This study introduces a novel hybrid TLS protocol that seamlessly integrates classical (ECDSA and X25519) and post-quantum (CRYSTALS-Dilithium5 and CRYSTALS-Kyber1024) primitives. The proposed method generates a composite X. 509 certificate dual-signed with ECDSA and Dilithium5. It conducts a key exchange that concatenates an X25519 Diffie-Hellman shared secret with a Kyber KEM shared secret, followed by HKDF-SHA256 key derivation. The entire protocol is implemented in Go, leveraging the OQS liboqs-go library alongside Go's standard crypto packages. Experimental validation via a proof-of-concept demonstrates successful hybrid certificate validation and secure session establishment with both classical and post-quantum peers. These results confirm that hybrid cryptographic integration can provide quantum-resilient security while preserving compatibility with existing TLS deployments.