Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Hyper-bent Boolean Functions and Evolutionary Algorithms (CROSBI ID 675558)

Prilog sa skupa u časopisu | izvorni znanstveni rad | međunarodna recenzija

Mariot, Luca ; Jakobovic, Domagoj ; Leporati, Alberto ; Picek, Stjepan Hyper-bent Boolean Functions and Evolutionary Algorithms // Lecture notes in computer science. 2019. str. 262-277 doi: 10.1007/978-3-030-16670-0_17

Podaci o odgovornosti

Mariot, Luca ; Jakobovic, Domagoj ; Leporati, Alberto ; Picek, Stjepan

engleski

Hyper-bent Boolean Functions and Evolutionary Algorithms

Bent Boolean functions play an important role in the design of secure symmetric ciphers, since they achieve the maximum distance from affine functions allowed by Parseval’s relation. Hyper-bent functions, in turn, are those bent functions which additionally reach maximum distance from all bijective monomial functions, and provide further security towards approximation attacks. Being characterized by a stricter definition, hyper-bent functions are rarer than bent functions, and much more difficult to construct. In this paper, we employ several evolutionary algorithms in order to evolve hyper-bent Boolean functions of various sizes. Our results show that hyper-bent functions are extremely difficult to evolve, since we manage to find such functions only for the smallest investigated size. Interestingly, we are able to identify this difficulty as not lying in the evolution of hyper-bent functions itself, but rather in evolving some of their components, i.e. bent functions. Finally, we present an additional parameter to evaluate the performance of evolutionary algorithms when evolving Boolean functions: the diversity of the obtained solutions.

Bent functions ; Hyper-bent functions ; Genetic programming ; Genetic algorithms ; Evolution strategies

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

262-277.

2019.

nije evidentirano

objavljeno

10.1007/978-3-030-16670-0_17

Podaci o matičnoj publikaciji

Lecture notes in computer science

978-3-030-16669-4

0302-9743

Podaci o skupu

Genetic Programming. EuroGP 2019.

predavanje

24.04.2019-26.04.2019

Leipzig, Njemačka

Povezanost rada

Računarstvo

Poveznice