TITLE: Shortest vector problem over polynomials
QUESTION [6 upvotes]: 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 is in $P$ seems to suggest some connections between polynomial analog of this problem that is easy? What is the precise polynomial analog of this problem and is there any connection to discrete logarithms?

REPLY [3 votes]: Not sure about the first, but for the second, yes:
Claus-Peter Schnorr. Factoring Integers and Computing Discrete Logarithms via Diophantine
Approximations. In Eurocrypt 1991, volume 547 of LNCS, pages 281–293.
Springer, 1991
Alexander May. Using LLL-Reduction for Solving RSA and Factorization Problems. In
Nguyen and Vallee [NV10], pages 315–348.