The Cryptographic Amplification Factor (CAF) is defined, a metric for the per-resource cost asymmetry that an adversary induces by forcing a TLS 1.3 server onto a high-cost signature algorithm (SLH-DSA instead of a low-cost one (ECDSA or ML-DSA) instead of a low-cost one (ECDSA or ML-DSA).
Abstract
Hybrid post-quantum TLS deployments pair classical and post-quantum signature algorithms to resist future quantum adversaries. However, to the best of our knowledge, no active IETF TLS, PQUIP, or LAMPS working-group draft treats CPU-cost adversarial algorithm substitution as a first-class availability threat. We define the Cryptographic Amplification Factor (CAF), a metric for the per-resource cost asymmetry that an adversary induces by forcing a TLS 1.3 server onto a high-cost signature algorithm (SLH-DSA) instead of a low-cost one (ECDSA or ML-DSA). We characterise four adversary classes—insider misconfiguration, supply-chain compromise, remote TLS peer, and protocol man-in-the-middle—demonstrate working proof-of-concept exploits on representative testbeds, and evaluate three defensive primitives under realistic deployment conditions. On the liboqs 0.14.0 reference implementation, CAFrcpu reaches 12,255× on Apple M-series ARM64 and 14,272× on AWS Graviton3 (3904–14,272× across five microarchitectures). Under a representative two-worker hardware security module (HSM) calibration (λ=13.5 TPS), substitution drives the modelled queue utilisation ρ past the stability boundary (1.44×10−4→1.787), a model-independent saturation; on the testbed, we observe server-CPU saturation, accept-queue exhaustion, and dropped connections. Two enforcement defences and a Parallel Signing Architecture provably bound ρ≤α<1 by admission control, regardless of attack rate. The exposed surface is concentrated today in high-assurance and financial-sector deployments and widens as FIPS 206 finalises.
This analysis demonstrates that while hybrid PQC-QKD models reduce long-term key compromise probabilities to near 0%, they introduce a 15% to 40% increase in bandwidth overhead during initial cryptographic handshakes during initial cryptographic handshakes.
R. Delhibabu· Frontiers of Computer Scienc...· 0 citations
This paper proposes a secure and quantum-resistant key exchange scheme leveraging the FrodoKEM algorithm, a lattice-based post-quantum key encapsulation mechanism designed to resist attacks from quantum adversaries, and compares the performance and security against traditional key exchange mechanisms.
P. V. Krishna, Meeravali Shaik· International journal of com...· 0 citations
The proposed framework provides an approach to securing JWTs and APIs with PQC Dilithium, backed by formal guarantees, and Benchmarking results indicate that MLDSA-44 (NIST strength category 2) offers the ideal balance between performance, reliability, and quantum readiness.
Sreeja C. S. Vivin Krishnan· Journal of Intelligent Decis...· 0 citations
This article presents a formal specification and verification of the PQ OpenPGP protocol using the algebraic specification language CafeOBJ and successfully verify that the PQ OpenPGP protocol satisfies three essential security properties: secrecy of the session key, forward secrecy, and authenticity.
Trong Binh Hoang, Duong Dinh Tran, Canh Minh Do et al.· PeerJ Computer Science· 0 citations
Advancements in quantum computing pose critical risks to classical cryptographic systems that rely on the computational hardness of integer factorization and discrete logarithms. This paper presents an evaluation of quantum resistant key exchange mechanisms, emphasizing the BB84 Quantum Key Distribution (QKD) protocol...
M. Nayeem· International Conference Com...· 0 citations
The review argues that readiness depends on protocol binding, implementation behavior, monitoring, and governance as much as on algorithm strength, and develops a deployment-readiness framework with four layers: security continuity, protocol integration, operational observability, and crypto-agility.
Yan Zhang· Applied and Computational En...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.