Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
Interval algorithm for random number generation,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A new sampler for discrete distributions using coin flips that combines linearithmic space, negligible runtime overhead, and entropy-optimal expected flips in [H(P), H(P)+2).
citing papers explorer
-
Rigorous Security Proofs for Practical Quantum Key Distribution
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
-
Efficient Rejection Sampling in the Entropy-Optimal Range
A new sampler for discrete distributions using coin flips that combines linearithmic space, negligible runtime overhead, and entropy-optimal expected flips in [H(P), H(P)+2).