Cryptology ePrint Archive: Report 2017/851

How to Use Metaheuristics for Design of Symmetric-Key Primitives

Ivica Nikolić

Abstract: The ultimate goal of designing a symmetric-key cryptographic primitive often can be formulated as an optimization problem. So far, these problems mainly have been solved with trivial algorithms such as brute force or random search. We show that a more advanced and equally versatile class of search algorithms, called metaheuristics, can help to tackle optimization problems related to design of symmetric-key primitives. We use two nature-inspired metaheuristics, simulated annealing and genetic algorithm, to optimize in terms of security the components of two recent cryptographic designs, SKINNY and AES-round based constructions. The positive outputs of the optimization suggest that metaheuristics are non-trivial tools, well suited for automatic design of primitives.

Category / Keywords: secret-key cryptography / Metaheuristic, simulated annealing, genetic algorithm, automatic tool, cryptographic primitive

Original Publication (in the same form): IACR-ASIACRYPT-2017

Date: received 3 Sep 2017, last revised 20 Dec 2017

Contact author: cube444 at gmail com

Available format(s): PDF | BibTeX Citation

Note: Added link to GitHub that contains Python implementation of the results.

Version: 20171220:124009 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]