You are looking at a specific version 20211015:084045 of this paper.
See the latest version.
Paper 2021/1391
A note on a Claim of Eldar & Hallgren: LLL already solves it
Léo Ducas and Wessel van Woerden
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)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- LatticeLLLCryptanalysis
- Contact author(s)
- wvw @ cwi nl,l ducas @ cwi nl
- History
- 2021-10-15: revised
- 2021-10-15: received
- See all versions
- Short URL
- https://ia.cr/2021/1391
- License
-
CC BY