Paper 2021/1391 Original: eprint.iacr.org/2021/1391 ↗
A note on a Claim of Eldar & Hallgren: LLL already solves it
Abstract
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2021-10-15: last updated
- 2021-10-15: published
- Short URL
- https://ia.cr/2021/1391
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2021/1391,
author = {Léo Ducas and Wessel van Woerden},
title = {A note on a Claim of Eldar & Hallgren: LLL already solves it},
howpublished = {Cryptology {ePrint} Archive, Paper 2021/1391},
year = {2021},
url = {https://eprint.iacr.org/2021/1391}
}