When this era of quantum computing arrives, we will reach the point where post-quantum cryptography (PCQ) becomes essential.

In these post-quantum cryptography algorithms the keys are vectors, directions through the maze of a structured lattice.

These algorithms rely on the geometry of numbers and finding the shortest vector in a high-dimensional lattice for problems such as the shortest vector problem or learning with errors.

We introduce a new Monte Carlo algorithm called the impurity lattice Monte Carlo method. This algorithm samples the path integral in a computationally efficient manner and has only small sign ...