The following pages link to G6K (Q1353858):
Displaying 12 items.
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Solving the search-LWE problem over projected lattices (Q2146741) (← links)
- Attacking ECDSA leaking discrete bits with a more efficient lattice (Q2151304) (← links)
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation (Q2231762) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
