Pages that link to "Item:Q2292889"

The following pages link to Approx-SVP in ideal lattices with pre-processing (Q2292889):

Displaying 15 items.

• Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
• Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
• On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
• Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
• Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
• Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
• On the quantum complexity of the continuous hidden subgroup problem (Q2119017) (← links)
• Towards faster polynomial-time lattice reduction (Q2128584) (← links)
• Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography (Q2143125) (← links)
• Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
• Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
• A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic (Q5091762) (← links)
• On ideal class group computation of imaginary multiquadratic fields (Q5871436) (← links)
• A short basis of the Stickelberger ideal of a cyclotomic field (Q6181103) (← links)
• Lattice-based cryptography: a survey (Q6183909) (← links)