Proves the Ekerå-Håstad quantum algorithm for short DLP achieves success probability 1-10^{-10} or higher with efficient classical meet-in-the-middle or random-walk post-processing, approaching 1 asymptotically.
Babai: On Lov´ asz’ lattice reduction and the nearest lattice point problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the success probability of the quantum algorithm for the short DLP
Proves the Ekerå-Håstad quantum algorithm for short DLP achieves success probability 1-10^{-10} or higher with efficient classical meet-in-the-middle or random-walk post-processing, approaching 1 asymptotically.