Binary decoding / Binary · full GV distance

Asymptotics and Improvements of Sieving for Codes

Léo Ducas · Andre Esser · Simona Etinski · Elena Kirshanova

Eurocrypt 2024

PublishedSource checked

Time bound: 2^{0.101 n + o(n)}
Space bound: —

Source / version date: 18 Mar 2024
Comparison variant: Binary · full GV distance
Cost scale: 2^{c n + o(n)}
variant: Improved sieving analysis

Assumptions and source notes

Improved sieving bound; not an improvement over Both–May.

Source location

Abstract
Version: 2024-03-18

Primary source ↗

BibTeXDownload .bib

@misc{deek2023,
  author = {Léo Ducas and Andre Esser and Simona Etinski and Elena Kirshanova},
  title = {{Asymptotics and Improvements of Sieving for Codes}},
  year = {2024},
  url = {https://eprint.iacr.org/2023/1577},
  cr_date = {2023-10-12},
  cr_status = {published},
  cr_venue = {EUROCRYPT 2024},
  cr_author_ids = {leo-ducas; andre-esser; simona-etinski; elena-kirshanova}
}