Pages that link to "Item:Q1698670"

The following pages link to Sieving for closest lattice vectors (with preprocessing) (Q1698670):

Displaying 13 items.

• Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
• Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
• The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
• Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
• The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
• A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ (Q2988333) (← links)
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102) (← links)
• (Q4787194) (← links)
• Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
• A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic (Q5091762) (← links)
• (Q5741633) (← links)
• Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP (Q6135454) (← links)
• A review of mathematical and computational aspects of CSIDH algorithms (Q6580190) (← links)