Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Engelberts, Lynn"'
Sieving using near-neighbor search techniques is a well-known method in lattice-based cryptanalysis, yielding the current best runtime for the shortest vector problem in both the classical [BDGL16] and quantum [BCSS23] setting. Recently, sieving has
Externí odkaz:
http://arxiv.org/abs/2408.16458
