  Since quantum computers are known to break the vast majority of
currently-used cryptographic protocols, a variety of new protocols are being
developed that are conjectured, but not proven to be safe against quantum
attacks. Among the most promising is lattice-based cryptography, where security
relies upon problems like the shortest vector problem. We analyse the potential
of adiabatic quantum computation for attacks on lattice-based cryptography, and
give numerical evidence that even outside the adiabatic regime such methods can
facilitate the solution of the shortest vector and similar problems.
