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?