From fitness landscape to crossover operator choice

Contains fulltext : 132817.pdf (publisher's version ) (Open Access

Evolving genetic algorithms for fault injection attacks

Contains fulltext : 129947.pdf (publisher's version ) (Closed access)MIPRO 2014 : 37th International Convention on Information and Communication Technology, Electronics and Microelectronics, 26-30 May 2014 Opatija, Croati

Correlation Immunity of Boolean Functions: An Evolutionary Algorithms Perspective

Contains fulltext : 143724.pdf (publisher's version ) (Open Access)GECCO '15 : the 2015 on Genetic and Evolutionary Computation Conference, Madrid, Spain — July 11 - 15, 201

On using genetic algorithms for intrinsic side-channel resistance: the case of AES S-box

Contains fulltext : 126183.pdf (preprint version ) (Open Access)CS2 '1

Fault Injection with a New Flavor: Memetic Algorithms Make a Difference

Item does not contain fulltex

Toward more efficient heuristic construction of Boolean functions

Boolean functions have numerous applications in domains as diverse as coding theory, cryptography,and telecommunications. Heuristics play an important role in the construction of Boolean functions with the desired properties for a specific purpose. However, there are only sparse results trying to understand the problem’s difficulty. With this work, we aim to address this issue. We conduct a fitness landscape analysis based on Local Optima Networks (LONs) and investigate the influence of different optimization criteria and variation operators. We observe that the naive fitness formulation results in the largest networks of local optima with disconnected components. Also, the combination of variation operators can both increase or decrease the network size. Most importantly, we observe correlations of local optima’s fitness, their degrees of interconnection, and the sizes of the respective basins of attraction. This can be exploited to restart algorithms dynamically and influence the degree of perturbation of the current best solution when restarting.Domagoj Jakobovic, Stjepan Picek, Marcella S.R. Martins, Markus Wagne

A characterisation of S-box fitness landscapes in cryptography

Substitution Boxes (S-boxes) are nonlinear objects often used in the design of cryptographic algorithms. The design of high quality S-boxes is an interesting problem that attracts a lot of attention. Many attempts have been made in recent years to use heuristics to design S-boxes, but the results were often far from the previously known best obtained ones. Unfortunately, most of the effort went into exploring different algorithms and fitness functions while little attention has been given to the understanding why this problem is so difficult for heuristics. In this paper, we conduct a fitness landscape analysis to better understand why this problem can be difficult. Among other, we find that almost each initial starting point has its own local optimum, even though the networks are highly interconnected.Domagoj Jakobovic, Stjepan Picek, Marcella S. R. Martins, Markus Wagne

Evolutionary Methods for the Construction of Cryptographic Boolean Functions

Item does not contain fulltex