Approx-SVP in ideal lattices with pre-processing
From MaRDI portal
Publication:2292889
DOI10.1007/978-3-030-17656-3_24OpenAlexW2946791252MaRDI QIDQ2292889
Damien Stehlé, Alice Pellet-Mary, Guillaume Hanrot
Publication date: 6 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_24
Related Items (19)
Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Towards faster polynomial-time lattice reduction ⋮ Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem ⋮ Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP ⋮ On module unique-SVP and NTRU ⋮ On the hardness of the NTRU problem ⋮ A short basis of the Stickelberger ideal of a cyclotomic field ⋮ Lattice-based cryptography: a survey ⋮ Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices ⋮ Approximate Voronoi cells for lattices, revisited ⋮ On the ideal shortest vector problem over random rational primes ⋮ A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic ⋮ Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP ⋮ Random self-reducibility of ideal-SVP via Arakelov random walks ⋮ On ideal class group computation of imaginary multiquadratic fields ⋮ Implementation of lattice trapdoors on modules and applications ⋮ On the quantum complexity of the continuous hidden subgroup problem
This page was built for publication: Approx-SVP in ideal lattices with pre-processing
