Pages that link to "Item:Q2768282"
From MaRDI portal
The following pages link to On polynomial approximations to the shortest lattice vector length (Q2768282):
Displaying 6 items.
- The extended \(k\)-tree algorithm (Q431783) (← links)
- Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
- Long shortest vectors in low dimensional lattices (Q2005735) (← links)
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time (Q5056439) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- On the LWE cryptosystem with more general disturbance (Q6608568) (← links)