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.
In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC)
2 Pith papers cite this work, alongside 93 external citations. Polarity classification is still indexing.
2
Pith papers citing it
93
external citations · external index
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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
-
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.