Asymptotics and Improvements of Sieving for Codes

ePrint Report: Asymptotics and Improvements of Sieving for Codes

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

A recent work by Guo, Johansson, and Nguyen (Eprint'23) proposes a promising adaptation of Sieving techniques from lattices to codes, in particular, by claiming concrete cryptanalytic improvements on various schemes. The core of their algorithm reduces to a Near Neighbor Search (NNS) problem, for which they devise an ad-hoc approach. In this work, we aim for a better theoretical understanding of this approach. …

algorithm eprint report nguyen report techniques work