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:2602.21524

Quantum Attacks Targeting Nuclear Power Plants: Threat Analysis, Defense and Mitigation Strategies

Yaser Baseri, Edward Waller

Published Feb 25, 2026• 2 citations
arXivHTMLPDF

Abstract

Nuclear power plants face a structural lifecycle asymmetry: their 60-80 year operational lifecycles exceed the anticipated arrival of Cryptographically Relevant Quantum Computers (CRQCs), so cryptographic material harvested today becomes decryptable within the service life of the systems it protects. This paper introduces a forensics-first framework for quantum resilience that treats forensic integrity as operationally essential rather than merely evidentiary, analyzing the quantum threat landscape across the Purdue architecture (L0-L5) to show how Harvest-Now, Decrypt-Later (HNDL) campaigns enabled by Shor's algorithm can retroactively compromise cryptographic foundations and undermine forensic evidence. Through two case studies, Quantum Scar and Quantum Dawn, we model attack feasibility via a conditional-chain formulation over structured expert-judgment priors anchored to documented HNDL activity and published CRQC roadmaps, yielding success probabilities of 8-78% under current defenses, where the upper bound corresponds to high-value facilities exhibiting cryptographic monoculture. We propose a defense-in-depth migration to Post-Quantum Cryptography (PQC) integrating hybrid key exchange, code and log integrity with anti-rollback, authenticated time synchronization, and side-channel-resistant implementations aligned with ISA/IEC 62443 and NIST standards, and specify seven design-level conformance criteria for validating it; modeled residual feasibility falls to 1-8% at Security Level 4 and below 1% under full PQC migration. We further contribute six MITRE ATT&CK for ICS technique extensions (T1001-T1006) as a standardized vocabulary for quantum-enabled infrastructure attacks. Quantum threats thus extend beyond cybersecurity to system safety, operational reliability, and post-incident evidence admissibility across multi-decade nuclear asset lifecycles.

DOI
10.48550/arxiv.2602.21524

Related papers

Security Risks for Enterprises in the Post-Quantum Computing World

Milan Gupta

The arrival of cryptographically relevant quantum computers (CRQCs) represents an existential threat to the public-key cryptographic infrastructure underpinning global enterprise operations. Enterprise security today relies on RSA and elliptic-curve cryptography (ECC) for TLS, VPNs, PKI, code signing, and identity systems—all of which are fundamentally broken by Shor's algorithm on a sufficiently powerful quantum computer. The defining risk is time-shifted compromise: adversaries can harvest encrypted traffic today and decrypt it once CRQCs exist, a threat already underway according to U.S. intelligence assessments. NIST finalized three post-quantum cryptographic (PQC) standards in August 2024 (FIPS 203/204/205) and mandates deprecation of quantum-vulnerable algorithms by 2035. Yet only 5% of organizations have implemented quantum-safe encryption and 95% lack formal quantum transition plans. This paper provides a comprehensive, threat-driven analysis across seven dimensions: quantum algorithm impact, harvest-now-decrypt-later (HNDL) threat models, enterprise asset risks (PKI, TLS, VPNs, code signing, cloud, IoT, identity, blockchain, supply chain), sector-specific vulnerabilities (financial services, healthcare, critical infrastructure), cryptographic primitive analysis, migration standards and roadmaps, and enterprise readiness gaps. The convergence of HNDL attacks already underway, multi-decade data sensitivity windows, and 12–15 year enterprise migration timelines means the migration deadline has, for most sectors, already passed.

International Journal of Emerging Trends in Computer Science and Information Technology•Jan 1, 2026•1 citation

A Quantum-Safe Framework for Critical Infrastructure Resilience Against Post-Quantum Cybersecurity Threats

Nandan Sharma

Critical infrastructure operators face a cryptographic transition unlike any in the internet's history: the mathematical problems underlying RSA and elliptic-curve cryptography, which secure the vast majority of today's key exchange and digital signatures, are efficiently solvable by a sufficiently large quantum computer running Shor's algorithm. No such machine exists yet, but the transition to quantum-safe alternatives cannot wait for one to appear, because encrypted data intercepted and stored today can be decrypted retroactively the moment a capable quantum computer does exist-a risk the field calls “harvest now, decrypt later.” This paper reviews the technical and policy literature on building quantum-safe resilience into critical infrastructure specifically, where equipment lifespans of ten to twenty years and hard real-time performance constraints make this transition materially harder than in general-purpose computing. This review examines the NIST finalized post-quantum cryptography standards, published in August 2024, following an eight-year selection process; the considerable performance and overhead burden imposed by such algorithms, with measured throughput between 150 operations per second on embedded ARM devices to over 13 million operations per second on server-class GPUs for the same algorithm; the very uncertain expert opinion timeline for when a cryptographically relevant quantum computer could exist, currently estimated at a 28 to 49 percent likelihood of appearing within ten years according to a survey of twenty-six experts in 2025; and finally, the regulatory deadlines for migration to such algorithms established in five different jurisdictions, which fall anywhere between 2030 and 2035. The key finding of this review can perhaps be stated plainly: Estimates of the time period actually required for a large organization to migrate to post-quantum cryptography, which range from twelve to fifteen years or more, are uncomfortably close to, and sometimes exceed, both the regulatory deadline and even the lower end of the threat timeline itself. With regard to critical infrastructure, this is not merely a theoretical exercise, but potentially an already overdue one.

•Aug 1, 2026•0 citations

Quantum-resilient cybersecurity: Evaluating the impact of post-quantum cryptography on identity, asset and network security models

Tim Abdiukov

With the growth and advancement of quantum computing, conventional cryptographic methods are becoming increasingly vulnerable, particularly in the core aspects of cybersecurity, including identity, asset, and network security. In detail, the following paper will provide a systematic analysis of post-quantum cryptography (PQC) in these areas. It discusses the theoretical foundations and operational potential of PQC algorithms, including those based on lattices, which aim to withstand quantum attacks, enhance authentication systems, protect digital assets, and maintain secure network communications. Considering the standards efforts, such as the work by NIST and real-life projects (current implementations of NewHope by Google and pilot projects by AWS), as well as the implementation difficulties that the domain faces, the article provides an overview of strategies related to migration. It explains both the potential and the challenges that face the introduction of PQC into current security infrastructures. It focuses on hybrid cryptography, side-channel robustness, performance trade-offs, and regulatory issues. Ultimately, the findings of this study suggest adopting PQC as a proactive rather than a defensive approach, providing an opportunity to redesign the structure of contemporary cybersecurity to achieve greater security in the face of emerging threats in the future.

World Journal of Advanced Engineering Technology and Sciences•Dec 30, 2024•1 citation

Future-Proofing Data: Assessing the Feasibility of Post-Quantum Cryptographic Algorithms to Mitigate ‘Harvest Now, Decrypt Later’ Attacks

Abayomi Titilola Olutimehin, Sunday Abayomi Joseph, Adekunbi Justina Ajayi +3 more

This study evaluates the feasibility of post-quantum cryptographic (PQC) algorithms in mitigating "Harvest Now, Decrypt Later" (HNDL) attacks as quantum computing advances threaten classical encryption. Using datasets from the NIST Post-Quantum Cryptography Project, Deloitte’s PQC Adoption Survey, and IBM & Google Quantum Roadmaps, the study applied statistical modeling, Monte Carlo simulations, and ARIMA forecasting to assess PQC security resilience, adoption readiness, and quantum decryption feasibility. The findings indicate that CRYSTALS-Kyber and CRYSTALS-Dilithium outperform RSA-2048 and ECC-256 in quantum resistance, with attack cost thresholds exceeding 1.91×10101.91 \times 10^{10}1.91×1010 compared to 2.24×1082.24 \times 10^82.24×108 for RSA-2048. Industry adoption varies, with government PQC implementation at 79%, finance at 67%, and healthcare lagging at 48%. Quantum decryption probability remains negligible until 2029 but rises to 78.6% by 2033. This study addresses the critical challenge of post-quantum cryptographic (PQC) adoption amid growing quantum threats, particularly "Harvest Now, Decrypt Later" (HNDL) attacks. By evaluating PQC security resilience, industry adoption, and quantum decryption feasibility, the findings provide strategic insights for policymakers and cybersecurity experts. Highlighting the vulnerabilities of CRYSTALS-Kyber to side-channel attacks, this research underscores the need for continuous cryptanalysis, hybrid encryption models, and adaptive security frameworks to future-proof data.Organizations must accelerate PQC adoption, integrate hybrid cryptographic models, enforce regulatory policies, and sustain cryptanalysis efforts to ensure long-term security.

Archives of Current Research International•Feb 17, 2025•24 citations

Post-Quantum Cryptography (PQC) and Migration Strategies for Enterprise IT Infrastructure: Standards, Protocol Benchmarks, and Crypto-Agility

Yash Prashar, Tanishk Sharma, Vishal Shrivastava +2 more

Abstract—The advent of fault-tolerant Cryptanalytically Relevant Quantum Computers (CRQCs) presents an existential threat to modern information security. Shor's polynomial-time quantum algorithm renders widely deployed public-key cryptographic primitives—including RSA, Diffie-Hellman (DH), and Elliptic Curve Cryptography (ECDH/ECDSA)—completely vulnerable to private key derivation. Furthermore, 'Harvest Now, Decrypt Later' (HNDL) adversarial campaigns actively intercept and store encrypted enterprise telemetry today, anticipating future quantum decryption capabilities. In response, the National Institute of Standards and Technology (NIST) finalized its primary Post-Quantum Cryptography (PQC) standards in FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), and FIPS 205 (SLH-DSA). However, transitioning complex enterprise IT ecosystems to quantum-resistant primitives introduces severe architectural and computational disruptions: public key and signature sizes increase by several orders of magnitude, cryptographic handshake latencies escalate, network packets experience Maximum Transmission Unit (MTU) fragmentation, and legacy Hardware Security Modules (HSMs) lack microarchitectural support for lattice-based polynomial arithmetic. This paper provides an exhaustive, mathematically grounded technical survey and architectural roadmap for enterprise PQC migration. We formalize the Module Learning with Errors (M-LWE) and Module Short Integer Solution (M-SIS) hardness foundations, evaluate hybrid classical/post-quantum cryptographic transition models across standard transport protocols (TLS 1.3, IKEv2/IPsec, SSH), and formulate an enterprise Crypto-Agility Maturity Model. Furthermore, we construct an empirical enterprise testbed measuring throughput, connection establishment latency, memory footprints, and packet fragmentation across legacy and quantum-resistant suites. Our results show that while ML-KEM-768 achieves microsecond-level encapsulation, its 1,088-byte ciphertext expands TLS ClientHello payloads into multiple TCP segments under constrained networks. Finally, we establish open research directions in post-quantum identity federations, stateful hash signature tracking, and hardware-accelerated polynomial arithmetic. Index Terms—Post-Quantum Cryptography (PQC), FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), Crypto-Agility, TLS 1.3, Lattice-Based Cryptography, Harvest Now Decrypt Later, Hardware Security Modules (HSM), Enterprise Migration.

•Oct 9, 2026•0 citations

A Multi-Plane Detection Framework for Quantum-Enabled Cryptographic Attacks: Operationalizing the Detection of Harvest-Now-Decrypt-Later Activity and Attacks on Post-Quantum Cryptography

Kabir G. Kharade, K K.Vengatesan, Hayder Kareem Algabri

The advent of cryptographically relevant quantum computers (CRQCs) poses a fundamental threat to public-key cryptography securing modern digital communications. The most immediate danger is not direct decryption but the harvest-now-decrypt-later (HNDL) attack, wherein adversaries passively collect and archive encrypted traffic today for retrospective decryption once a CRQC becomes operational. This threat is structurally difficult to counter because the collection phase generates no host- or account-level signals detectable by conventional intrusion-detection systems.Simultaneously, migration to NIST-standardized post-quantum cryptography (PQC) specifically ML-KEM (FIPS 203), ML-DSA (FIPS 204), and SLH-DSA (FIPS 205) introduces new vulnerabilities, including chosen-ciphertext side-channel attacks, fault-injection attacks, and protocol downgrade attacks arising during hybrid deployment periods.Existing security tooling addresses cryptographic inventory, encrypted-traffic anomaly detection, and PQC readiness as isolated problems, leaving a critical operational gap. To address this, we propose QCAD (Quantum Cryptographic Attack Detection), a unified multi-plane detection framework integrating four complementary detection planes: (A) flow-metadata behavioral analytics targeting HNDL collection indicators; (B) host- and protocol-level telemetry for PQC implementation flaws and downgrade attacks; (C) continuous crypto-agility monitoring with per-asset Mosca-inequality risk scoring; and (D) quantum-vulnerable deception canaries. These planes feed a unified correlation layer that maps observations to MITRE ATT&CK techniques and produces risk-ranked alerts.Evaluation against synthetic HNDL and PQC-attack benchmarks demonstrates that cross-plane fusion achieves a recall of 0.97 at a 5% false-positive rate (F1 = 0.90, ROC-AUC = 0.99), substantially outperforming any individual plane, confirming that no single observable captures all attack families.A key boundary condition remains: HNDL detection is inherently a probabilistic behavioral-inference problem, and interception occurring on transit infrastructure beyond the defender's perimeter may remain undetectable regardless of sensor deployment.

CyberSystem journal.•Jun 24, 2026•0 citations
Nuclear power plants face a structural lifecycle asymmetry: their 60-80 year operational lifecycles exceed the anticipated arrival of Cryptographically Relevant Quantum Computers (CRQCs), so cryptographic material harvested today becomes decryptable within the service life of the systems it protects. This paper introduces a forensics-first framework for quantum resilience that treats forensic integrity as operationally essential rather than merely evidentiary, analyzing the quantum threat landscape across the Purdue architecture (L0-L5) to show how Harvest-Now, Decrypt-Later (HNDL) campaigns enabled by Shor's algorithm can retroactively compromise cryptographic foundations and undermine forensic evidence. Through two case studies, Quantum Scar and Quantum Dawn, we model attack feasibility via a conditional-chain formulation over structured expert-judgment priors anchored to documented HNDL activity and published CRQC roadmaps, yielding success probabilities of 8-78% under current defenses, where the upper bound corresponds to high-value facilities exhibiting cryptographic monoculture. We propose a defense-in-depth migration to Post-Quantum Cryptography (PQC) integrating hybrid key exchange, code and log integrity with anti-rollback, authenticated time synchronization, and side-channel-resistant implementations aligned with ISA/IEC 62443 and NIST standards, and specify seven design-level conformance criteria for validating it; modeled residual feasibility falls to 1-8% at Security Level 4 and below 1% under full PQC migration. We further contribute six MITRE ATT&CK for ICS technique extensions (T1001-T1006) as a standardized vocabulary for quantum-enabled infrastructure attacks. Quantum threats thus extend beyond cybersecurity to system safety, operational reliability, and post-incident evidence admissibility across multi-decade nuclear asset lifecycles.
The arrival of cryptographically relevant quantum computers (CRQCs) represents an existential threat to the public-key cryptographic infrastructure underpinning global enterprise operations. Enterprise security today relies on RSA and elliptic-curve cryptography (ECC) for TLS, VPNs, PKI, code signing, and identity systems—all of which are fundamentally broken by Shor's algorithm on a sufficiently powerful quantum computer. The defining risk is time-shifted compromise: adversaries can harvest encrypted traffic today and decrypt it once CRQCs exist, a threat already underway according to U.S. intelligence assessments. NIST finalized three post-quantum cryptographic (PQC) standards in August 2024 (FIPS 203/204/205) and mandates deprecation of quantum-vulnerable algorithms by 2035. Yet only 5% of organizations have implemented quantum-safe encryption and 95% lack formal quantum transition plans. This paper provides a comprehensive, threat-driven analysis across seven dimensions: quantum algorithm impact, harvest-now-decrypt-later (HNDL) threat models, enterprise asset risks (PKI, TLS, VPNs, code signing, cloud, IoT, identity, blockchain, supply chain), sector-specific vulnerabilities (financial services, healthcare, critical infrastructure), cryptographic primitive analysis, migration standards and roadmaps, and enterprise readiness gaps. The convergence of HNDL attacks already underway, multi-decade data sensitivity windows, and 12–15 year enterprise migration timelines means the migration deadline has, for most sectors, already passed.
Critical infrastructure operators face a cryptographic transition unlike any in the internet's history: the mathematical problems underlying RSA and elliptic-curve cryptography, which secure the vast majority of today's key exchange and digital signatures, are efficiently solvable by a sufficiently large quantum computer running Shor's algorithm. No such machine exists yet, but the transition to quantum-safe alternatives cannot wait for one to appear, because encrypted data intercepted and stored today can be decrypted retroactively the moment a capable quantum computer does exist-a risk the field calls “harvest now, decrypt later.” This paper reviews the technical and policy literature on building quantum-safe resilience into critical infrastructure specifically, where equipment lifespans of ten to twenty years and hard real-time performance constraints make this transition materially harder than in general-purpose computing. This review examines the NIST finalized post-quantum cryptography standards, published in August 2024, following an eight-year selection process; the considerable performance and overhead burden imposed by such algorithms, with measured throughput between 150 operations per second on embedded ARM devices to over 13 million operations per second on server-class GPUs for the same algorithm; the very uncertain expert opinion timeline for when a cryptographically relevant quantum computer could exist, currently estimated at a 28 to 49 percent likelihood of appearing within ten years according to a survey of twenty-six experts in 2025; and finally, the regulatory deadlines for migration to such algorithms established in five different jurisdictions, which fall anywhere between 2030 and 2035. The key finding of this review can perhaps be stated plainly: Estimates of the time period actually required for a large organization to migrate to post-quantum cryptography, which range from twelve to fifteen years or more, are uncomfortably close to, and sometimes exceed, both the regulatory deadline and even the lower end of the threat timeline itself. With regard to critical infrastructure, this is not merely a theoretical exercise, but potentially an already overdue one.
With the growth and advancement of quantum computing, conventional cryptographic methods are becoming increasingly vulnerable, particularly in the core aspects of cybersecurity, including identity, asset, and network security. In detail, the following paper will provide a systematic analysis of post-quantum cryptography (PQC) in these areas. It discusses the theoretical foundations and operational potential of PQC algorithms, including those based on lattices, which aim to withstand quantum attacks, enhance authentication systems, protect digital assets, and maintain secure network communications. Considering the standards efforts, such as the work by NIST and real-life projects (current implementations of NewHope by Google and pilot projects by AWS), as well as the implementation difficulties that the domain faces, the article provides an overview of strategies related to migration. It explains both the potential and the challenges that face the introduction of PQC into current security infrastructures. It focuses on hybrid cryptography, side-channel robustness, performance trade-offs, and regulatory issues. Ultimately, the findings of this study suggest adopting PQC as a proactive rather than a defensive approach, providing an opportunity to redesign the structure of contemporary cybersecurity to achieve greater security in the face of emerging threats in the future.
This study evaluates the feasibility of post-quantum cryptographic (PQC) algorithms in mitigating "Harvest Now, Decrypt Later" (HNDL) attacks as quantum computing advances threaten classical encryption. Using datasets from the NIST Post-Quantum Cryptography Project, Deloitte’s PQC Adoption Survey, and IBM & Google Quantum Roadmaps, the study applied statistical modeling, Monte Carlo simulations, and ARIMA forecasting to assess PQC security resilience, adoption readiness, and quantum decryption feasibility. The findings indicate that CRYSTALS-Kyber and CRYSTALS-Dilithium outperform RSA-2048 and ECC-256 in quantum resistance, with attack cost thresholds exceeding 1.91×10101.91 \times 10^{10}1.91×1010 compared to 2.24×1082.24 \times 10^82.24×108 for RSA-2048. Industry adoption varies, with government PQC implementation at 79%, finance at 67%, and healthcare lagging at 48%. Quantum decryption probability remains negligible until 2029 but rises to 78.6% by 2033. This study addresses the critical challenge of post-quantum cryptographic (PQC) adoption amid growing quantum threats, particularly "Harvest Now, Decrypt Later" (HNDL) attacks. By evaluating PQC security resilience, industry adoption, and quantum decryption feasibility, the findings provide strategic insights for policymakers and cybersecurity experts. Highlighting the vulnerabilities of CRYSTALS-Kyber to side-channel attacks, this research underscores the need for continuous cryptanalysis, hybrid encryption models, and adaptive security frameworks to future-proof data.Organizations must accelerate PQC adoption, integrate hybrid cryptographic models, enforce regulatory policies, and sustain cryptanalysis efforts to ensure long-term security.
Abstract—The advent of fault-tolerant Cryptanalytically Relevant Quantum Computers (CRQCs) presents an existential threat to modern information security. Shor's polynomial-time quantum algorithm renders widely deployed public-key cryptographic primitives—including RSA, Diffie-Hellman (DH), and Elliptic Curve Cryptography (ECDH/ECDSA)—completely vulnerable to private key derivation. Furthermore, 'Harvest Now, Decrypt Later' (HNDL) adversarial campaigns actively intercept and store encrypted enterprise telemetry today, anticipating future quantum decryption capabilities. In response, the National Institute of Standards and Technology (NIST) finalized its primary Post-Quantum Cryptography (PQC) standards in FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), and FIPS 205 (SLH-DSA). However, transitioning complex enterprise IT ecosystems to quantum-resistant primitives introduces severe architectural and computational disruptions: public key and signature sizes increase by several orders of magnitude, cryptographic handshake latencies escalate, network packets experience Maximum Transmission Unit (MTU) fragmentation, and legacy Hardware Security Modules (HSMs) lack microarchitectural support for lattice-based polynomial arithmetic. This paper provides an exhaustive, mathematically grounded technical survey and architectural roadmap for enterprise PQC migration. We formalize the Module Learning with Errors (M-LWE) and Module Short Integer Solution (M-SIS) hardness foundations, evaluate hybrid classical/post-quantum cryptographic transition models across standard transport protocols (TLS 1.3, IKEv2/IPsec, SSH), and formulate an enterprise Crypto-Agility Maturity Model. Furthermore, we construct an empirical enterprise testbed measuring throughput, connection establishment latency, memory footprints, and packet fragmentation across legacy and quantum-resistant suites. Our results show that while ML-KEM-768 achieves microsecond-level encapsulation, its 1,088-byte ciphertext expands TLS ClientHello payloads into multiple TCP segments under constrained networks. Finally, we establish open research directions in post-quantum identity federations, stateful hash signature tracking, and hardware-accelerated polynomial arithmetic. Index Terms—Post-Quantum Cryptography (PQC), FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), Crypto-Agility, TLS 1.3, Lattice-Based Cryptography, Harvest Now Decrypt Later, Hardware Security Modules (HSM), Enterprise Migration.
The advent of cryptographically relevant quantum computers (CRQCs) poses a fundamental threat to public-key cryptography securing modern digital communications. The most immediate danger is not direct decryption but the harvest-now-decrypt-later (HNDL) attack, wherein adversaries passively collect and archive encrypted traffic today for retrospective decryption once a CRQC becomes operational. This threat is structurally difficult to counter because the collection phase generates no host- or account-level signals detectable by conventional intrusion-detection systems.Simultaneously, migration to NIST-standardized post-quantum cryptography (PQC) specifically ML-KEM (FIPS 203), ML-DSA (FIPS 204), and SLH-DSA (FIPS 205) introduces new vulnerabilities, including chosen-ciphertext side-channel attacks, fault-injection attacks, and protocol downgrade attacks arising during hybrid deployment periods.Existing security tooling addresses cryptographic inventory, encrypted-traffic anomaly detection, and PQC readiness as isolated problems, leaving a critical operational gap. To address this, we propose QCAD (Quantum Cryptographic Attack Detection), a unified multi-plane detection framework integrating four complementary detection planes: (A) flow-metadata behavioral analytics targeting HNDL collection indicators; (B) host- and protocol-level telemetry for PQC implementation flaws and downgrade attacks; (C) continuous crypto-agility monitoring with per-asset Mosca-inequality risk scoring; and (D) quantum-vulnerable deception canaries. These planes feed a unified correlation layer that maps observations to MITRE ATT&CK techniques and produces risk-ranked alerts.Evaluation against synthetic HNDL and PQC-attack benchmarks demonstrates that cross-plane fusion achieves a recall of 0.97 at a 5% false-positive rate (F1 = 0.90, ROC-AUC = 0.99), substantially outperforming any individual plane, confirming that no single observable captures all attack families.A key boundary condition remains: HNDL detection is inherently a probabilistic behavioral-inference problem, and interception occurring on transit infrastructure beyond the defender's perimeter may remain undetectable regardless of sensor deployment.