Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving

DOI10.1007/978-3-030-34578-5_19zbMath1456.94093OpenAlexW2990274329MaRDI QIDQ2181895

Subhayan Roy Moulik, Elena Kirshanova, Erik Mårtensson, Eamonn W. Postlethwaite

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-34578-5_19

zbMATH Keywords

lattice based cryptographylattice sieve algorithms

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

Lower bounds on lattice sieving and information set decoding ⋮ Lattice Sieving via Quantum Random Walks ⋮ Finding many collisions via reusable quantum walks. Application to lattice sieving ⋮ Estimating quantum speedups for lattice sieves ⋮ Improved classical and quantum algorithms for subset-sum

This page was built for publication: Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving