What is the most efficient lattice problem solving algorithm?

I've recently become very interested in post-quantum cryptography, specifically lattice-based cryptography. As of this posting there exists no quantum algorithm that can perform better at solving lattice problems than a conventional computer.

There are, however, algorithms that exist that theoretically can solve lattice problems, albeit slowly.

I'd like to study one or more of these algorithms myself to help me better understand lattice cryptography and lattices in general.

So, what is the most efficient lattice problem solving algorithm and why is it so efficient?

• Your question is not clear... There are several lattice problems and for each of them, several algorithms. So which lattice problem are you talking about? It seems to be SVP... Jun 23 '19 at 9:58
• why is it so efficient is a very interesting question, but the accepted answer doesn't address it Jun 23 '19 at 13:27