Approx-SVP in ideal lattices with pre-processing

DOI10.1007/978-3-030-17656-3_24OpenAlexW2946791252MaRDI QIDQ2292889FDOQ2292889

Authors: Alice Pellet-Mary, Damien Stehlé, Guillaume Hanrot 

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_24

Recommendations

• Improved Inapproximability of Lattice and Coding Problems With Preprocessing
• Lattice sparsification and the approximate closest vector problem
• scientific article; zbMATH DE number 6607548
• Hardness of approximating the closest vector problem with pre-processing
• Sieve, Enumerate, Slice, and Lift:
• The inapproximability of lattice and coding problems with preprocessing
• Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
• Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
• scientific article; zbMATH DE number 2081093
• Preprocessing sparse semidefinite programs via matrix completion

zbMATH Keywords

approximate Shortest Vector Problem

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (28)

• Dual lattice attacks for closest vector problems (with preprocessing)
• On module unique-SVP and NTRU
• A short basis of the Stickelberger ideal of a cyclotomic field
• Lattice-based cryptography: a survey
• 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
• RLWE/PLWE equivalence for the maximal totally real subextension of the \(2^rpq\)-th cyclotomic field
• Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\)
• Subfield attacks on HSVP in ideal lattices
• Ideal-SVP is hard for small-norm uniform prime ideals
• Approximate Voronoi cells for lattices, revisited
• Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography
• Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
• A local-global approach to solving ideal lattice problems
• Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
• On the shortness of vectors to be found by the ideal-SVP quantum algorithm
• On the ideal shortest vector problem over random rational primes
• On algebraic embedding for unstructured lattices
• CryptAttackTester: high-assurance attack analysis
• Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
• Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices
• Improved computation of polynomial roots over number fields when using complex embeddings
• Towards faster polynomial-time lattice reduction
• On the hardness of the NTRU problem
• Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
• Random self-reducibility of ideal-SVP via Arakelov random walks
• A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic

This page was built for publication: Approx-SVP in ideal lattices with pre-processing

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