Evolutionary techniques in lattice sieving algorithms
This work addresses the efficiency of lattice sieving, a key component in lattice-based cryptography, which is important for secure communication in the quantum era, but it appears incremental as it applies known evolutionary methods to an existing problem.
The paper explores connections between lattice sieving algorithms and evolutionary algorithms, showing how evolutionary techniques can be applied to improve lattice sieving for lattice-based cryptography.
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.