Pregled bibliografske jedinice broj: 848070
Maximal nonlinearity in balanced boolean functions with even number of inputs, revisited
Maximal nonlinearity in balanced boolean functions with even number of inputs, revisited // IEEE Congress on Evolutionary Computation CEC 2016
Vancouver, Kanada, 2016. str. 3222-3229 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 848070 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Maximal nonlinearity in balanced boolean functions with even number of inputs, revisited
Autori
Picek, Stjepan ; Santana, Roberto ; Jakobović, Domagoj
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
IEEE Congress on Evolutionary Computation CEC 2016
/ - , 2016, 3222-3229
Skup
CEC
Mjesto i datum
Vancouver, Kanada, 24.07.2016. - 29.07.2016
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Boolean functions ; Ciphers ; Evolutionary computation ; Genetic algorithms ; Probabilistic logic ; Search problems
Sažetak
The problem of obtaining maximal nonlinearity in Boolean functions is well researched, both from the cryptographic and the evolutionary computation side. However, the results are still not conclusive enough to be able to show how good a heuristic approach is when tackling this problem. In this paper, we investigate how to obtain the maximal possible nonlinearity in balanced Boolean functions, but we also analyze how difficult is the problem itself. In order to do so, we conduct experiments with Estimation of distribution algorithms as well as the fitness landscape analysis and the deception analysis. Our results indicate that the first difficulties arise from the inappropriate fitness function and representation of solutions coupled with a huge search space. The fitness landscape analysis does not reveal any significant differences that could justify the assumed jump in problem difficulty when going from Boolean functions with 6 inputs to those with 8 inputs. Finally, we show that this problem is not order-1 deceptive.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb