Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
1 answer
304 views

Shortest vector problem over polynomials

In shortest vector problem, given a lattice in $\Bbb Z^n$, we seek the shortest non-zero vector in the lattice. This problem is computationally difficult. Answer in Evidence for integer factorization ...
Turbo's user avatar
  • 13.9k