A note on a Claim of Eldar & Hallgren: LLL already solves it
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.
|Cryptology ePrint Archive ; Paper 2021/1391|
Ducas, L, & van Woerden, W.P.J. (2021). A note on a Claim of Eldar & Hallgren: LLL already solves it. Cryptology ePrint Archive.