Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory

Résumé

The Shortest Vector Problem (SVP) is at the foundation of lattice-based cryptography. The fastest known method to solve SVP in dimension d is by lattice sieving, which runs in time 2^(td+o(d)) with 2^(md+o(d)) memory for constants t, m ∈ Θ(1). Searching reduced vectors in the sieve is a problem reduced to the configuration problem, i.e. searching k vectors satisfying given constraints on their pairwise scalar products. In this work, we present a framework for k-sieve algorithms: we filter the input list of lattice vectors using a code structure modified from [Bec+16] to get lists centred around k codewords summing to the nullvector. Then, we solve a simpler instance of the configuration problem in the k filtered lists. Based on this framework, we describe classical sieves for k = 3 and 4 that introduce new time-memory trade-offs. We also use the k-Lists algorithm [Kir+19] inside our framework, and this improves the time for k = 3 and gives new trade-offs for k = 4.
Fichier principal
Vignette du fichier
2023-200.pdf (577.89 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY SA - Paternité - Partage selon les Conditions Initiales

Dates et versions

hal-04276492 , version 1 (09-11-2023)

Licence

Paternité - Partage selon les Conditions Initiales

Identifiants

Citer

André Chailloux, Johanna Loyer. Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory. PQCrypto 2023 - 14th International Conference on Post-Quantum Cryptography, Aug 2023, College Park, MD, United States. pp.225-255, ⟨10.1007/978-3-031-40003-2_9⟩. ⟨hal-04276492⟩

Collections

INRIA INRIA2
17 Consultations
18 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More