Pages that link to "Item:Q5738970"
From MaRDI portal
The following pages link to Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970):
Displaying 17 items.
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors (Q515394) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Comment on: ``Sum of squares of uniform random variables'' by I. Weissman (Q1726716) (← links)
- Lower bounds on lattice enumeration with extreme pruning (Q1784109) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths (Q2329392) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- Lattice Enumeration Using Extreme Pruning (Q3563839) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- On the Security of OSIDH (Q5087250) (← links)
- Algorithmic Number Theory (Q5899253) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- On the SVP for low-dimensional circulant lattices (Q6645172) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
