OPAQUE is a mature augmented PAKE whose authenticated key-exchange core remains classical and therefore exposed to store-now-decrypt-later risk once scalable quantum attacks against discrete-logarithm systems become practical. This paper introduces Hybrid PQ-OPAQUE, a fixed-round reinforcement of OPAQUE that incorporates ML-KEM-768 into the authenticated transcript and final key schedule while preserving the canonical three-message interaction pattern. Session-key derivation binds four Diffie-Hellman t e rms o v er Ristretto255 to the ML-KEM shared secret through transcript-bound HKDF extraction. Relative to canonical 3DH-OPAQUE, the construction preserves 1.5 rounds and adds one additional Diffie-Hellman computation, one KEM operation, and 2272 bytes of hybrid payload expansion; the complete authentication wire format grows to 2715 bytes in total. The evidence base combines symbolic analyses in ProVerif and Tamarin with a reproducible Rust implementation, 157 passing tests, and benchmark measurements on a Linux/Xeon server. End-to-end authentication remains dominated by Argon2id, and the post-quantum overhead outside password hardening is additive and sub-millisecond. The results show that augmented PAKE can be reinforced against store-nowdecrypt-later risk without increasing round complexity or altering the underlying interaction class.
OPAQUE is a mature augmented PAKE whose authenticated key-exchange core remains classical and therefore exposed to store-now-decrypt-later risk once scalable quantum attacks against discrete-logarithm systems become practical. This paper introduces Hybrid PQ-OPAQUE, a fixed-round reinforcement of OPAQUE that incorporates ML-KEM-768 into the authenticated transcript and final key schedule while preserving the canonical three-message interaction pattern. Session-key derivation binds four Diffie-Hellman t e rms o v er Ristretto255 to the ML-KEM shared secret through transcript-bound HKDF extraction. Relative to canonical 3DH-OPAQUE, the construction preserves 1.5 rounds and adds one additional Diffie-Hellman computation, one KEM operation, and 2272 bytes of hybrid payload expansion; the complete authentication wire format grows to 2715 bytes in total. The evidence base combines symbolic analyses in ProVerif and Tamarin with a reproducible Rust implementation, 157 passing tests, and benchmark measurements on a Linux/Xeon server. End-to-end authentication remains dominated by Argon2id, and the post-quantum overhead outside password hardening is additive and sub-millisecond. The results show that augmented PAKE can be reinforced against store-nowdecrypt-later risk without increasing round complexity or altering the underlying interaction class.
Hybrid key establishment runs a post-quantum key-encapsulation mechanism (KEM) alongside a classical Diffie-Hellman primitive, so that the session key stays secure while either component resists attack. This design is now standardized in the Transport Layer Security protocol, Secure Shell, and the Internet Key Exchange, with the standardized module-lattice KEM (ML-KEM) as the post-quantum component. A hybrid KEM secures the derived key, but not the integrity of the negotiation that selects which primitives are used. Full protocols authenticate that negotiation through a handshake transcript; a hybrid KEM deployed as a standalone drop-in primitive, or inside a minimal handshake without transcript authentication, inherits no such guarantee, and an active attacker can strip the post-quantum option. We ask what the key schedule alone must contain to make downgrade resilience a local property of the combiner. We give a game-based definition at the combiner layer and prove a two-sided separation: a combiner that ignores the transcript is downgraded with certainty, whereas one that binds the session key and the confirmation tag to a hash of the transcript blocks every such attempt, up to a term negligible for a 256-bit transcript hash. We also give an explicit strongest-link security bound. Using a calibrated cost model composed from published Cortex-M4 measurements, transcript binding adds one hash per party - about 11.8% of handshake computation but only 1.5% of radio-inclusive energy - and adds no messages or bytes on the wire. Every reported number is produced by a released harness that passes a 30-check validation gate.
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.
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 advent of quantum computing poses a significant threat to conventional public-key cryptographic systems, particularly resource-constrained mobile and cyber-physical environments. To address this challenge, this study proposes an implementation-oriented unified hybrid key derivation framework that integrates the Elliptic Curve Diffie–Hellman Ephemeral (ECDHE-P256) and post-quantum ML-KEM-768 algorithm for quantum-resilient secure communication. The proposed approach combines independently generated classical and post-quantum shared secrets through a lightweight mixing step followed by HKDF-SHA256 extraction and expansion to derive a unified 256-bit session key. This design preserves forward secrecy while enhancing resilience against quantum adversaries without requiring substantial modifications to the existing communication infrastructures. The framework was implemented on a heterogeneous testbed consisting of an x86_64 client and ARM64-based Android device. Experimental evaluations were conducted across 27 test configurations under three network latency conditions (50, 150, and 500 ms) using payload sizes of 64, 1024, and 10240 KB. Each configuration was executed for 1000 iterations to ensure statistically reliable measurements. The results demonstrate that, compared with standalone ECDHE-P256 and standalone ML-KEM-768, the proposed hybrid framework introduces only minimal computational overhead while maintaining stable resource utilization. Furthermore, network latency contributes more significantly to end-to-end communication delay than cryptographic processing overhead, indicating that the integration of classical and post-quantum cryptographic mechanisms does not constitute a major performance bottleneck. Overall, the proposed implementation-oriented framework provides a practical and lightweight transition strategy to quantum-resilient secure communication in heterogeneous mobile, IoT, and cyber-physical environments.
Post-quantum authenticated key exchange is needed for Internet of Things (IoT) systems facing quantum-enabled adversaries, but signature-heavy post-quantum handshakes remain costly for constrained devices and long-delay non-terrestrial network (NTN) links. This paper proposes NTN-PQ-AKE, a lightweight, transcript-bound authenticated key exchange for managed IoT/NTN deployments. The protocol avoids online post-quantum signatures by combining the Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM) with provisioned symmetric token material, replay-window checking, transcript-bound derivation using the HMAC-based Key Derivation Function (HKDF), and two-way confirmation tags. Its principal novelty relative to the KEM-based baselines considered here is the joint provision of pair-scoped pre-authentication before ML-KEM processing, complete binding of the key-establishing transcript, and fail-closed two-way key confirmation for managed IoT/NTN deployments. Its “authenticate first, compute later” design rejects forged initiations before expensive KEM processing, while each endpoint releases local session keys only after verifying the role-specific peer confirmation for the same transcript-derived state. Security analysis under a Dolev–Yao adversarial model shows that, within the stated freshness and provisioning assumptions, NTN-PQ-AKE supports mutual authentication, KEM-derived session-key freshness for uncompromised sessions, replay and man-in-the-middle resistance, transcript integrity, and scoped resource-exhaustion mitigation; it does not claim full perfect forward secrecy after later endpoint-key compromise. Across 100 measured runs after five warm-up runs, hardware profiling on an STM32F407G-DISC1 Cortex-M4 gives a mean combined Alice-and-Bob handshake cost of 3,812,967 cycles (SD 13,420; 95% CI half-width 2,662), or 22.70 ms at 168 MHz, with 52,356 B of text, 136 B of data, and 68,664 B of bss. OMNeT++ evaluation shows that NTN-PQ-AKE transmits 2,472 bytes and completes in approximately 524.67 ms on the modeled NTN channel.