Estimating the hidden overheads in the BDGL lattice sieving algorithm

DOI10.1007/978-3-031-17234-2_22zbMath1517.94097OpenAlexW4297042470MaRDI QIDQ6166998

Léo Ducas

Publication date: 7 July 2023

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-17234-2_22

zbMATH Keywords

lattice sievingconcrete cryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Shortest vector from lattice sieving: a few dimensions for free
• Advanced lattice sieving on GPUs, with tensor cores
• LWE with side information: attacks and concrete security estimation
• The general sieve kernel and new records in lattice reduction
• Estimating quantum speedups for lattice sieves
• Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing
• Tuning GaussSieve for Speed
• BKZ 2.0: Better Lattice Security Estimates
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• Sieve algorithms for the shortest vector problem are practical
• New directions in nearest neighbor searching with applications to lattice sieving
• A sieve algorithm for the shortest lattice vector problem
• Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS

This page was built for publication: Estimating the hidden overheads in the BDGL lattice sieving algorithm