On random unimodular lattices, full-sign Gibbs mass of e^{a/n}-edge windows vanishes for c≤1 and converges to a Poisson–Dirichlet partition for c>1; primitive fixed-γ windows have visibility threshold c=γ^{-2} in the high-temperature regime.
Title resolution pending
3 Pith papers cite this work, alongside 898 external citations. Polarity classification is still indexing.
3
Pith papers citing it
898
external citations · OpenAlex
years
2026 3representative citing papers
Quantum rejection sampling applied to truncated Klein proposals yields quadratic speedup in dual-attack lattice Gaussian sampling, cutting Kyber attack costs by 9, 4, and 13 bits.
Quantum rejection sampling yields a quadratically faster discrete Gaussian sampler on lattices, enabling two improved versions of quantum dual attacks with trade-offs in speed and memory.
citing papers explorer
-
Thermal Concentration and Poisson-Dirichlet Edge Statistics for Random-Lattice Gibbs Ensembles
On random unimodular lattices, full-sign Gibbs mass of e^{a/n}-edge windows vanishes for c≤1 and converges to a Poisson–Dirichlet partition for c>1; primitive fixed-γ windows have visibility threshold c=γ^{-2} in the high-temperature regime.
-
Improved Dual Attack and Trapdoor Sampling via Quantum Rejection Sampling
Quantum rejection sampling applied to truncated Klein proposals yields quadratic speedup in dual-attack lattice Gaussian sampling, cutting Kyber attack costs by 9, 4, and 13 bits.
-
Quantum algorithm for Discrete Gaussian Sampling
Quantum rejection sampling yields a quadratically faster discrete Gaussian sampler on lattices, enabling two improved versions of quantum dual attacks with trade-offs in speed and memory.