Finding an effective metric used for bijective S-Box generation by genetic algorithms

Baicheva, Tsonka and Bikov, Dusan and Borissov, Yuri and Koceva Lazarova, Limonka and Stojanova, Aleksandra and Stoykova, Liliya and Zhelezova, Stela (2014) Finding an effective metric used for bijective S-Box generation by genetic algorithms. In: 104th European Study Group with Industry, 23-27 Sept 2014, Sofia, Bulgaria.

[thumbnail of problem4.pdf]
Preview
Text
problem4.pdf

Download (90kB) | Preview
[thumbnail of problem2.pdf]
Preview
Text
problem2.pdf

Download (464kB) | Preview
[thumbnail of ESGI104.pdf]
Preview
Text
ESGI104.pdf

Download (2MB) | Preview

Abstract

In cryptography, S-box is a basic component of symmetric key algorithms which performs nonlinear substitution. S-boxes need to be highly nonlinear, so that the cipher can resist linear cryptanalysis.
The main criteria for cryptographically strong (n × n) S-box are:
• High non linearity;
• High algebraic degree;
• Balanced structure;
• Good auto correlation properties.
Our task was to give some suggestions for finding an effective metric used for generation bijective optimal S-Box. Because of the given problem’s complexity, our group considered different approaches and we gave a few suggestions for problem solving.

Item Type: Conference or Workshop Item (Paper)
Subjects: Natural sciences > Computer and information sciences
Divisions: Faculty of Computer Science
Depositing User: Александра Стојанова Илиевска
Date Deposited: 01 Dec 2014 10:00
Last Modified: 25 Oct 2021 07:34
URI: https://eprints.ugd.edu.mk/id/eprint/11515

Actions (login required)

View Item View Item