2021-10-15
A note on a Claim of Eldar & Hallgren: LLL already solves it
Publication
Publication
In a recent talk of Hallgren on a joint work with Eldar (Sept 21, 2021, Simons Institute), a polynomial-time quantum algorithm for solving BDD in a certain class of lattices was claimed. We show here that known classical (and even, deterministic) polynomial-time algorithms already achieve this result.
| Additional Metadata | |
|---|---|
| , , | |
| Cryptology ePrint Archive ; Paper 2021/1391 | |
| Organisation | Cryptology |
|
Ducas, L., & van Woerden, W. (2021). A note on a Claim of Eldar & Hallgren: LLL already solves it. Cryptology ePrint Archive. |
|
