$LLL$ algorithm is vectorized version of Euclidean algorithm for $GCD$.
Even the $m=2$ case known to Lagrange and Gauss does not have an $NC$ algorithm for shortest vector.
If $GCD$ is in $NC$ and in particular if solving the linear Diophantine equation in two dimensions is in $NC$ then would it follow the two dimensional shortest vector problem is in $NC$?
If $GCD$ is in $NC$ would it provide anything to shortest vector problem?
More strongly if integer factoring is in $NC$ placing $GCD$ in $NC$ trivially, would it have any impact on shortest vector problem at least for fixed dimension?