The following pages link to (Q3336683):
Displaying 10 items.
- Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
- On finite-precision representations of geometric objects (Q584309) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← links)
- Factorization properties of lattices over the integers (Q1345515) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Shortest Integer Vectors (Q3140530) (← links)
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time (Q5056439) (← links)
- On the unique shortest lattice vector problem (Q5941093) (← links)