Estimating the hidden overheads in the BDGL lattice sieving algorithm

DOI10.1007/978-3-031-17234-2_22zbMATH Open1517.94097OpenAlexW4297042470MaRDI QIDQ6166998FDOQ6166998

Authors: 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

Recommendations

• Estimating quantum speedups for lattice sieves
• Lower bounds on lattice sieving and information set decoding
• BKZ 2.0: Better lattice security estimates
• Lattice Sieving via Quantum Random Walks
• Tuning GaussSieve for speed

zbMATH Keywords

lattice sievingconcrete cryptanalysis

Mathematics Subject Classification ID

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

Cites Work

• BKZ 2.0: Better lattice security estimates
• A sieve algorithm for the shortest lattice vector problem
• Sieve algorithms for the shortest vector problem are practical
• New directions in nearest neighbor searching with applications to lattice sieving
• Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
• 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
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• Tuning GaussSieve for speed
• Estimating quantum speedups for lattice sieves
• Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS

Cited In (1)

• A refined hardness estimation of LWE in two-step mode

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166998)