None

Cipher Construction with Cartesian genetic PrOgramming

Conference paper (2019)

Authors

S. Picek Cyber Security -

Karlo Knezevic University of Zagreb

Domagoj Jakobovic University of Zagreb

Ante Derek University of Zagreb

Research Group

Cyber Security () (TU Delft)

Cryptography Y, Cartesian Genetic Programming Block ciphers Bilevel optimization

To reference this document use:

http://resolver.tudelft.nl/uuid:c8ae43a3-466e-45ab-a125-82510ae027ad

More Info

expand_more

Published Date

2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Intelligent Systems

Research Group

Cyber Security

Abstract

In this paper, we ask a question whether evolutionary algorithms can evolve cryptographic algorithms when no precise design criteria are given. Our strategy utilizes Cartesian Genetic Programming in the bi-level optimization setting with multiple populations trying to evolve a cryptographic algorithm and break it. To challenge our design paradigm, we consider a number of scenarios with varying criteria on the system and its security. We are able to obtain interesting results in several scenarios where the attacker is not able to understand the text with more than a random chance. Interestingly, our system is able to develop various versions of one-time pads, which are the only systems that ensure perfect secrecy. Although our system is far from practical, we consider it interesting since it gives good results that are also human-readable.

Files

3319619.3326869_1_.pdf

(pdf | 0.91 Mb)

Download not available