Pages that link to "Item:Q2302118"

The following pages link to Finding closest lattice vectors using approximate Voronoi cells (Q2302118):

Displaying 12 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)
• Threshold schemes from isogeny assumptions (Q2055691) (← links)
• On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
• Quantum security analysis of CSIDH (Q2119022) (← links)
• The irreducible vectors of a lattice: some theory and applications (Q2698346) (← links)
• Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
• A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic (Q5091762) (← links)
• New Results on the Remote Set Problem and Its Applications in Complexity Study (Q6489321) (← links)
• A review of mathematical and computational aspects of CSIDH algorithms (Q6580190) (← links)
• Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)