Designing Bent Boolean Functions With Parallelized Linear Genetic Programming

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F17%3APU126400" target="_blank" >RIV/00216305:26230/17:PU126400 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.fit.vut.cz/research/publication/11402/" target="_blank" >https://www.fit.vut.cz/research/publication/11402/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3067695.3084220" target="_blank" >10.1145/3067695.3084220</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Designing Bent Boolean Functions With Parallelized Linear Genetic Programming

Popis výsledku v původním jazyce

Bent Boolean functions are cryptographic primitives essential for the safety of cryptographic algorithms, providing a degree of non-linearity to otherwise linear systems. The maximum possible non-linearity of a Boolean function is limited by the number of its inputs, and as technology advances, functions with higher number of inputs are required in order to guarantee a level of security demanded in many modern applications. Genetic programming has been successfully used to discover new larger bent Boolean functions in the past. This paper proposes the use of linear genetic programming for this purpose. It shows that this approach is suitable for designing of bent Boolean functions larger than those designed using other approaches, and explores the influence of multiple evolutionary parameters on the evolution runtime. Parallelized implementation of the proposed approach is used to search for new, larger bent functions, and the results are compared with other related work. The results show that linear genetic programming copes better with growing number of function inputs than genetic programming, and is able to create significantly larger bent functions in comparable time.

Název v anglickém jazyce

Designing Bent Boolean Functions With Parallelized Linear Genetic Programming

Popis výsledku anglicky

Bent Boolean functions are cryptographic primitives essential for the safety of cryptographic algorithms, providing a degree of non-linearity to otherwise linear systems. The maximum possible non-linearity of a Boolean function is limited by the number of its inputs, and as technology advances, functions with higher number of inputs are required in order to guarantee a level of security demanded in many modern applications. Genetic programming has been successfully used to discover new larger bent Boolean functions in the past. This paper proposes the use of linear genetic programming for this purpose. It shows that this approach is suitable for designing of bent Boolean functions larger than those designed using other approaches, and explores the influence of multiple evolutionary parameters on the evolution runtime. Parallelized implementation of the proposed approach is used to search for new, larger bent functions, and the results are compared with other related work. The results show that linear genetic programming copes better with growing number of function inputs than genetic programming, and is able to create significantly larger bent functions in comparable time.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA16-08565S" target="_blank" >GA16-08565S: Rozvoj kryptoanalytických metod prostřednictvím evolučních výpočtů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

GECCO Companion '17 Proceedings of the Companion Publication of the 2017 on Genetic and Evolutionary Computation Conference

ISBN

978-1-4503-4939-0

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1825-1832

Název nakladatele

Association for Computing Machinery

Místo vydání

Berlín

Místo konání akce

Berlin

Datum konání akce

15. 7. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000625865500309