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

Real-Data Validation of the Krylov Eavesdropper Detector on Experimental QKD Channel Data

Daniel Süß

Published Mar 10, 2026• 0 citations
Publisher

Abstract

Paper [8] in the QKD Krylov Detector research series. We validate the Calibrated Slope Detector on 181,606 experimental QBER measurements from a real fiber-optic QKD system. The detector achieves a false-positive rate of 4.5% and detects simulated intercept-resend attacks from ΔQBER ≥ 0.5% with 96.0% sensitivity (AUC = 0.981) — an order of magnitude more sensitive than conventional QBER threshold monitoring. Supplementary validation on the NIST Loophole-Free Bell Test dataset (152.6 million trials) confirms specificity on clean quantum data. This completes the validation triangle: theoretical unforgeability (Paper [7]), simulation-based sensitivity (Papers [5]–[6]), and real-data validation (this work). Software: https://github.com/quantumspiritresearch-crypto/qkd-krylov-detector (v1.3.0)

DOI
10.5281/zenodo.18936061

Related papers

Krylov complexity as a cryptographic resource: eavesdropper detection in quantum key distribution via operator-growth channel fingerprints

Daniel Süß

Abstract I present a physical-layer monitoring framework for quantum key distribution (QKD) implementations based on Krylov/operator-growth diagnostics. Running alongside standard parameter estimation, privacy amplification, and composable security proofs, it addresses a focused question: whether the temporal correlation structure of an observed quantum bit error rate (QBER) stream carries additional information about physical channel perturbations. Within a specified local-Hamiltonian channel model, the Lanczos coefficients of the channel Liouvillian define an operator-growth autocorrelation template, and deviations from it serve as anomaly scores for implementation monitoring. For the model studied here, the QBER autocorrelation relates to the operator autocorrelation through a proportionality relation, $C_{\mathrm{QBER}}(\tau )=\alpha (N)C_{\mathrm{op}}(\tau )$ C QBER ( τ ) = α ( N ) C op ( τ ) , with $\alpha (N)$ α ( N ) an explicitly specified calibration factor. Local Hamiltonian perturbations generically distort the associated Krylov fingerprint once the perturbation reaches the support of the monitored observable, consistent with the locality of the Lanczos recursion and with Lieb–Robinson bounds. The resulting three-layer pipeline combines adaptive frequency filtering, Krylov-template extraction, and calibrated slope detection. On simulated BB84-like QBER data with realistic hardware noise, the detector achieves high anomaly discrimination under the tested perturbation classes ( $\mathrm{AUC}=0.9899$ AUC = 0.9899 ). On $181{,}606$ 181 , 606 public QBER measurements from a deployed fiber-optic QKD system, it yields a 4.5% clean-test alarm rate against a 5% design target and detects injected perturbations with 96.0% sensitivity at $\Delta \mathrm{QBER}={+}0.5\%$ Δ QBER = + 0.5 % ( $\mathrm{AUC}=0.981$ AUC = 0.981 ). Certification of final key secrecy remains governed by the underlying QKD protocol, parameter estimation, finite-key analysis, and privacy amplification.

EPJ Quantum Technology•Jul 22, 2026•0 citations

QKD Eve Detector: A Research Collection on Eavesdropper Detection in Quantum Key Distribution

Daniel Süß

This collection presents three interconnected papers on eavesdropper (Eve) detection in Quantum Key Distribution (QKD) channels, following the chronological development of the framework. Part I Eve Detection in QKD via Dual-Layer Sidereal Filtering and Krylov Complexity Analysis (v4): The empirical starting point. Eve is modeled as a Hamiltonian perturbation at the kappa-coupling interface. Krylov-Statistical Mapping establishes a correlation between b_n deviation and QBER statistical moments (r=0.948, kurtosis; r=0.943, |skewness|) across 50 gamma values. Crossover spectral regime (⟨r⟩=0.366) explicitly documented. Part II: Distinguishing Quantum Scrambling from Eavesdropping via Krylov Temporal Structure and Sidereal Filtering (v2, with Robustness Analysis): The theoretical foundation. A Gaussian autocorrelation template C(t) = exp(−0.5·(slope·t)²) is derived from Krylov-Lanczos b_n coefficients. Under realistic hardware noise (AR(1) + 1/f + afterpulsing + bursts): AUC=0.9899, separation=12.13 sigma. Three methodological killer tests included. All results are simulation-based (N=8 crossover regime; not yet validated on real QKD hardware). Part III: QKD Eve Detector: A Unified Framework (Synthesis): The three-layer detector combining all prior work: (1) Dual-Layer Sidereal Filter for environmental noise removal, (2) Krylov Dynamic Detector for template matching, (3) Multi-Vector Attack Classifier distinguishing six attack types. Self-contained implementation provided in the accompanying demo notebook.Accompanying notebooks reproduce all figures and results. Dependencies: NumPy, SciPy, QuTiP. No special hardware required.

•Mar 5, 2026•0 citations

Lieb-Robinson Bounds and Krylov Unforgeability: A Rigorous Framework

Süß Daniel

We develop a rigorous mathematical framework proving that the QKD Krylov Detector, a three-layer eavesdropper detection system for Quantum Key Distribution based on Krylov complexity and sidereal filtering, provides information-theoretically grounded security against physically realizable attacks. The central results are: (1) Krylov Locality Theorem: An eavesdropper coupling at distance d from the monitored operator cannot affect the first d Lanczos coefficients. This is an exact algebraic identity, not an approximation. (2) Perturbation Detectability Theorem: The first affected Lanczos coefficient scales as gamma^2, with computable upper and lower bound constants derived from second-order perturbation theory applied to the Lanczos recursion. (3) Information-Distortion Bound: Eve's accessible information (Holevo quantity) scales as O(gamma^2), while the Krylov distortion scales as O(gamma^4), yielding an explicit tradeoff chi <= const * sqrt(Delta_K). Verified numerically using an explicit Eve ancilla model. (4) Krylov Unforgeability Theorem: Any Hamiltonian perturbation that extracts nonzero information from the quantum channel necessarily distorts the Lanczos coefficients beyond the detection threshold. No physically realizable attack can simultaneously extract information and preserve the clean Krylov signature. (5) Coherent Attack Invariance: The Lanczos coefficients are operator-space quantities independent of any quantum state, rendering coherent and entangled attack strategies unable to circumvent detection. (6) Time-Dependent Unforgeability: Time-dependent coupling strategies gamma(t) produce strictly more distortion than constant coupling at the same average strength, by Jensen's inequality applied via a rigorous stroboscopic argument. All results include full proofs and numerical verification for chain lengths N = 6, 8, 10, 12. This work provides the formal security foundation for the QKD Krylov Detector framework developed across six prior publications. Companion code: https://github.com/quantumspiritresearch-crypto/qkd-krylov-detector

•Mar 9, 2026•0 citations

Eavesdropper Detection in Six-State Protocol Against Partial Intercept–Resend Attack

Francesco Fiorini, Rosario Giuseppe Garroppo, Michele Pagano +1 more

This work presents and evaluates two threshold-based detection methods for the Six-State quantum key distribution protocol, considering a realistic scenario involving partial intercept–resend attack and channel noise. The statistical properties of the shared quantum bit error rate (QBER) are analyzed and used to estimate the attacker interception density from observed data. Building on this foundation, the work derives two optimal QBER detection thresholds designed to minimize both false positive and false negative rates, following, respectively, upper theoretical bounds and limit probability density function approach. A developed Qiskit simulation environment enables the evaluation and comparison of the two detection methods on simulated and real-inspired quantum systems with differing noise characteristics. This framework moves beyond theoretical analysis, allowing practical investigation of system noise effects on detection accuracy. Simulation results confirm that both methods are robust and effective, achieving high detection accuracy across all the tested configurations, thereby validating their applicability to real-world quantum communication systems.

Future Internet•Oct 31, 2025•3 citations

AI-Augmented Quantum Key Distribution for Cloud Data Security: A Simulation Study of Aggregate Versus Block-Wise Eavesdropping Detection

Akheel Mohammad

Cloud infrastructures face a long-horizon threat from cryptographically relevant quantum computers, motivating both post-quantum cryptography (PQC) and quantum key distribution (QKD) as complementary defenses. QKD additionally offers a physical, information-theoretic signal of eavesdropping through the quantum bit error rate (QBER) of the sifted key. Prior work has applied machine learning across the QKD pipeline, chiefly for parameter optimization and physical-layer stabilization, but has given less systematic attention to whether learned, distribution-aware statistics improve on a simple aggregate-QBER threshold for detecting partial intercept-resend eavesdropping in a cloud key-rotation setting. We simulate BB84 key exchange under uniform and time-concentrated (“bursty”) partial interception across two monitoring-window lengths, and compare a static aggregate-QBER threshold against a logistic-regression detector that additionally uses block-wise QBER variance and maxima, at a matched false-positive rate. Across all four tested conditions, the aggregate threshold matched or exceeded the block-wise detector, while monitoring-window length had a substantially larger, quantifiable effect on detection sensitivity than the choice of detector. For this attack model, cloud QKD key-management pipelines therefore gain more from shortening or adaptively sizing the QBER monitoring window than from adding distributional machine-learning features to the detection statistic, which also helps explain why reported machine-learning gains in QKD concentrate in parameter optimization rather than eavesdropping detection Keywords: machine learning; Quantum Key Distribution; BB84; eavesdropping detection; quantum bit error rate; cloud security

International Journal of Technology & Emerging Research•Nov 15, 2026•0 citations

Quantum Bit Error Rate Analysis in BB84 Quantum Key Distribution: Measurement, Statistical Estimation, and Eavesdropping Detection

Jaydeep Rath, Prajwal Panth, P. S. N. Bhaskar

Quantum Key Distribution (QKD) provides information-theoretic security by exploiting the principles of quantum mechanics. Among QKD protocols, the BB84 scheme remains the most widely adopted for both theoretical research and practical implementation. A critical parameter determining the reliability and security of BB84 is the Quantum Bit Error Rate (QBER), which quantifies errors in the sifted key arising from channel noise or potential eavesdropping. This paper presents a systematic review and analysis of QBER within the BB84 protocol, examining its calculation, statistical estimation methods, and role in detecting eavesdropping activity. Simulation results, corroborated by reported experimental observations, reveal a near-linear relationship between eavesdropping intensity and QBER, with values approaching 25% under full intercept-resend attacks. Four confidence interval estimation methods, Wald, Wilson, Clopper-Pearson, and Hoeffding's inequality, are compared for robust QBER analysis in finite-key scenarios. Protocol enhancements, including decoy-state methods, hybrid cryptographic models, and quantum-resistant authentication, are discussed as mechanisms to mitigate errors and strengthen resilience across fiber, free-space, underwater, and satellite QKD systems. Open challenges in distinguishing noise-induced errors from malicious eavesdropping, and the role of adaptive error correction and machine-learning-assisted QBER estimation in future quantum networks, are identified as key directions for further research.

quant-pharXiv:2603.27278•Mar 31, 2026•1 citation
Paper [8] in the QKD Krylov Detector research series. We validate the Calibrated Slope Detector on 181,606 experimental QBER measurements from a real fiber-optic QKD system. The detector achieves a false-positive rate of 4.5% and detects simulated intercept-resend attacks from ΔQBER ≥ 0.5% with 96.0% sensitivity (AUC = 0.981) — an order of magnitude more sensitive than conventional QBER threshold monitoring. Supplementary validation on the NIST Loophole-Free Bell Test dataset (152.6 million trials) confirms specificity on clean quantum data. This completes the validation triangle: theoretical unforgeability (Paper [7]), simulation-based sensitivity (Papers [5]–[6]), and real-data validation (this work). Software: https://github.com/quantumspiritresearch-crypto/qkd-krylov-detector (v1.3.0)
Abstract I present a physical-layer monitoring framework for quantum key distribution (QKD) implementations based on Krylov/operator-growth diagnostics. Running alongside standard parameter estimation, privacy amplification, and composable security proofs, it addresses a focused question: whether the temporal correlation structure of an observed quantum bit error rate (QBER) stream carries additional information about physical channel perturbations. Within a specified local-Hamiltonian channel model, the Lanczos coefficients of the channel Liouvillian define an operator-growth autocorrelation template, and deviations from it serve as anomaly scores for implementation monitoring. For the model studied here, the QBER autocorrelation relates to the operator autocorrelation through a proportionality relation, CQBER(τ)=α(N)Cop(τ)C_{\mathrm{QBER}}(\tau )=\alpha (N)C_{\mathrm{op}}(\tau )CQBER​(τ)=α(N)Cop​(τ) C QBER ( τ ) = α ( N ) C op ( τ ) , with α(N)\alpha (N)α(N) α ( N ) an explicitly specified calibration factor. Local Hamiltonian perturbations generically distort the associated Krylov fingerprint once the perturbation reaches the support of the monitored observable, consistent with the locality of the Lanczos recursion and with Lieb–Robinson bounds. The resulting three-layer pipeline combines adaptive frequency filtering, Krylov-template extraction, and calibrated slope detection. On simulated BB84-like QBER data with realistic hardware noise, the detector achieves high anomaly discrimination under the tested perturbation classes ( AUC=0.9899\mathrm{AUC}=0.9899AUC=0.9899 AUC = 0.9899 ). On 181,606181{,}606181,606 181 , 606 public QBER measurements from a deployed fiber-optic QKD system, it yields a 4.5% clean-test alarm rate against a 5% design target and detects injected perturbations with 96.0% sensitivity at ΔQBER=+0.5%\Delta \mathrm{QBER}={+}0.5\%ΔQBER=+0.5% Δ QBER = + 0.5 % ( AUC=0.981\mathrm{AUC}=0.981AUC=0.981 AUC = 0.981 ). Certification of final key secrecy remains governed by the underlying QKD protocol, parameter estimation, finite-key analysis, and privacy amplification.
This collection presents three interconnected papers on eavesdropper (Eve) detection in Quantum Key Distribution (QKD) channels, following the chronological development of the framework. Part I Eve Detection in QKD via Dual-Layer Sidereal Filtering and Krylov Complexity Analysis (v4): The empirical starting point. Eve is modeled as a Hamiltonian perturbation at the kappa-coupling interface. Krylov-Statistical Mapping establishes a correlation between b_n deviation and QBER statistical moments (r=0.948, kurtosis; r=0.943, |skewness|) across 50 gamma values. Crossover spectral regime (⟨r⟩=0.366) explicitly documented. Part II: Distinguishing Quantum Scrambling from Eavesdropping via Krylov Temporal Structure and Sidereal Filtering (v2, with Robustness Analysis): The theoretical foundation. A Gaussian autocorrelation template C(t) = exp(−0.5·(slope·t)²) is derived from Krylov-Lanczos b_n coefficients. Under realistic hardware noise (AR(1) + 1/f + afterpulsing + bursts): AUC=0.9899, separation=12.13 sigma. Three methodological killer tests included. All results are simulation-based (N=8 crossover regime; not yet validated on real QKD hardware). Part III: QKD Eve Detector: A Unified Framework (Synthesis): The three-layer detector combining all prior work: (1) Dual-Layer Sidereal Filter for environmental noise removal, (2) Krylov Dynamic Detector for template matching, (3) Multi-Vector Attack Classifier distinguishing six attack types. Self-contained implementation provided in the accompanying demo notebook.Accompanying notebooks reproduce all figures and results. Dependencies: NumPy, SciPy, QuTiP. No special hardware required.
We develop a rigorous mathematical framework proving that the QKD Krylov Detector, a three-layer eavesdropper detection system for Quantum Key Distribution based on Krylov complexity and sidereal filtering, provides information-theoretically grounded security against physically realizable attacks. The central results are: (1) Krylov Locality Theorem: An eavesdropper coupling at distance d from the monitored operator cannot affect the first d Lanczos coefficients. This is an exact algebraic identity, not an approximation. (2) Perturbation Detectability Theorem: The first affected Lanczos coefficient scales as gamma^2, with computable upper and lower bound constants derived from second-order perturbation theory applied to the Lanczos recursion. (3) Information-Distortion Bound: Eve's accessible information (Holevo quantity) scales as O(gamma^2), while the Krylov distortion scales as O(gamma^4), yielding an explicit tradeoff chi <= const * sqrt(Delta_K). Verified numerically using an explicit Eve ancilla model. (4) Krylov Unforgeability Theorem: Any Hamiltonian perturbation that extracts nonzero information from the quantum channel necessarily distorts the Lanczos coefficients beyond the detection threshold. No physically realizable attack can simultaneously extract information and preserve the clean Krylov signature. (5) Coherent Attack Invariance: The Lanczos coefficients are operator-space quantities independent of any quantum state, rendering coherent and entangled attack strategies unable to circumvent detection. (6) Time-Dependent Unforgeability: Time-dependent coupling strategies gamma(t) produce strictly more distortion than constant coupling at the same average strength, by Jensen's inequality applied via a rigorous stroboscopic argument. All results include full proofs and numerical verification for chain lengths N = 6, 8, 10, 12. This work provides the formal security foundation for the QKD Krylov Detector framework developed across six prior publications. Companion code: https://github.com/quantumspiritresearch-crypto/qkd-krylov-detector
This work presents and evaluates two threshold-based detection methods for the Six-State quantum key distribution protocol, considering a realistic scenario involving partial intercept–resend attack and channel noise. The statistical properties of the shared quantum bit error rate (QBER) are analyzed and used to estimate the attacker interception density from observed data. Building on this foundation, the work derives two optimal QBER detection thresholds designed to minimize both false positive and false negative rates, following, respectively, upper theoretical bounds and limit probability density function approach. A developed Qiskit simulation environment enables the evaluation and comparison of the two detection methods on simulated and real-inspired quantum systems with differing noise characteristics. This framework moves beyond theoretical analysis, allowing practical investigation of system noise effects on detection accuracy. Simulation results confirm that both methods are robust and effective, achieving high detection accuracy across all the tested configurations, thereby validating their applicability to real-world quantum communication systems.
Cloud infrastructures face a long-horizon threat from cryptographically relevant quantum computers, motivating both post-quantum cryptography (PQC) and quantum key distribution (QKD) as complementary defenses. QKD additionally offers a physical, information-theoretic signal of eavesdropping through the quantum bit error rate (QBER) of the sifted key. Prior work has applied machine learning across the QKD pipeline, chiefly for parameter optimization and physical-layer stabilization, but has given less systematic attention to whether learned, distribution-aware statistics improve on a simple aggregate-QBER threshold for detecting partial intercept-resend eavesdropping in a cloud key-rotation setting. We simulate BB84 key exchange under uniform and time-concentrated (“bursty”) partial interception across two monitoring-window lengths, and compare a static aggregate-QBER threshold against a logistic-regression detector that additionally uses block-wise QBER variance and maxima, at a matched false-positive rate. Across all four tested conditions, the aggregate threshold matched or exceeded the block-wise detector, while monitoring-window length had a substantially larger, quantifiable effect on detection sensitivity than the choice of detector. For this attack model, cloud QKD key-management pipelines therefore gain more from shortening or adaptively sizing the QBER monitoring window than from adding distributional machine-learning features to the detection statistic, which also helps explain why reported machine-learning gains in QKD concentrate in parameter optimization rather than eavesdropping detection Keywords: machine learning; Quantum Key Distribution; BB84; eavesdropping detection; quantum bit error rate; cloud security
Quantum Key Distribution (QKD) provides information-theoretic security by exploiting the principles of quantum mechanics. Among QKD protocols, the BB84 scheme remains the most widely adopted for both theoretical research and practical implementation. A critical parameter determining the reliability and security of BB84 is the Quantum Bit Error Rate (QBER), which quantifies errors in the sifted key arising from channel noise or potential eavesdropping. This paper presents a systematic review and analysis of QBER within the BB84 protocol, examining its calculation, statistical estimation methods, and role in detecting eavesdropping activity. Simulation results, corroborated by reported experimental observations, reveal a near-linear relationship between eavesdropping intensity and QBER, with values approaching 25% under full intercept-resend attacks. Four confidence interval estimation methods, Wald, Wilson, Clopper-Pearson, and Hoeffding's inequality, are compared for robust QBER analysis in finite-key scenarios. Protocol enhancements, including decoy-state methods, hybrid cryptographic models, and quantum-resistant authentication, are discussed as mechanisms to mitigate errors and strengthen resilience across fiber, free-space, underwater, and satellite QKD systems. Open challenges in distinguishing noise-induced errors from malicious eavesdropping, and the role of adaptive error correction and machine-learning-assisted QBER estimation in future quantum networks, are identified as key directions for further research.