On the shortness of vectors to be found by the ideal-SVP quantum algorithm

DOI10.1007/978-3-030-26948-7_12zbMath1456.94074OpenAlexW2967180961MaRDI QIDQ2181855

Maxime Plançon, Léo Ducas, Benjamin Wesolowski

Publication date: 20 May 2020

Full work available at URL: https://ir.cwi.nl/pub/29164

zbMATH Keywords

quantum cryptanalysiscyclotomic ideal lattices

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (9)

Application of automorphic forms to lattice problems ⋮ Sieve algorithms for some orthogonal integer lattices ⋮ Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP ⋮ Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices ⋮ Geometry of biquadratic and cyclic cubic log-unit lattices ⋮ On the ideal shortest vector problem over random rational primes ⋮ Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP ⋮ Random self-reducibility of ideal-SVP via Arakelov random walks ⋮ On the quantum complexity of the continuous hidden subgroup problem

This page was built for publication: On the shortness of vectors to be found by the ideal-SVP quantum algorithm