Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | IJCCI 2019 - Proceedings of the 11th International Joint Conference on Computational Intelligence |
| Editors | Juan Julian Merelo, Jonathan Garibaldi, Alejandro Linares-Barranco, Kurosh Madani, Kevin Warwick, Kevin Warwick |
| Place of Publication | Setúbal |
| Publisher | SciTePress Digital Library |
| Pages | 31-39 |
| Number of pages | 9 |
| ISBN (Electronic) | 9789897583841 |
| DOIs | |
| Publication status | Published - 2019 |
| Event | 11th International Joint Conference on Computational Intelligence, IJCCI 2019 - Vienna, Austria Duration: 17 Sept 2019 → 19 Sept 2019 |
Conference
| Conference | 11th International Joint Conference on Computational Intelligence, IJCCI 2019 |
|---|---|
| Country/Territory | Austria |
| City | Vienna |
| Period | 17/09/19 → 19/09/19 |
Funding
The author is supported by a Veni Innovational Research Grant from NWO under project number 016.Veni.192.005.
Keywords
- Applications
- Cryptography
- Evolutionary algorithms
- Lattice sieving