  Lattice-based cryptography has recently emerged as a prominent candidate for
secure communication in the quantum age. Its security relies on the hardness of
certain lattice problems, and the inability of known lattice algorithms, such
as lattice sieving, to solve these problems efficiently. In this paper we
investigate the similarities between lattice sieving and evolutionary
algorithms, how various improvements to lattice sieving can be viewed as
applications of known techniques from evolutionary computation, and how other
evolutionary techniques can benefit lattice sieving in practice.
