30 citations · 41 across the 22 of their papers we have counts for
28 papers
Monotone but Exciting: On Evolving Monotone Boolean Functions with High Nonlinearity
Claude Carlet, Marko Čupić, Marko Ðurasevic +3
Monotone Boolean functions are a structurally important class of Boolean functions, but their restricted form imposes strong limitations on achievable nonlinearity. In this paper,…
NegaBent, No Regrets: Evolving Spectrally Flat Boolean Functions
Claude Carlet, Marko Ðurasevic, Ermes Franch +3
Negabent Boolean functions are defined by having a flat magnitude spectrum under the nega-Hadamard transform. They exist in both even and odd dimensions, and the subclass of functi…
IDEM Enough? Evolving Highly Nonlinear Idempotent Boolean Functions
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invarian…
On Counts and Densities of Homogeneous Bent Functions: An Evolutionary Approach
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +3
Boolean functions with strong cryptographic properties, such as high nonlinearity and algebraic degree, are important for the security of stream and block ciphers. These functions…
A Systematic Study on the Design of Odd-Sized Highly Nonlinear Boolean Functions via Evolutionary Algorithms
Claude Carlet, Marko Đurasevic, Domagoj Jakobovic +2
This paper focuses on the problem of evolving Boolean functions of odd sizes with high nonlinearity, a property of cryptographic relevance. Despite its simple formulation, this pro…
Degree is Important: On Evolving Homogeneous Boolean Functions
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Boolean functions with good cryptographic properties like high nonlinearity and algebraic degree play an important in the security of stream and block ciphers. Such functions may b…
The More the Merrier: On Evolving Five-valued Spectra Boolean Functions
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Evolving Boolean functions with specific properties is an interesting optimization problem since, depending on the combination of properties and Boolean function size, the problem…
Finding Near-Optimal Portfolios With Quality-Diversity
Bruno Gašperov, Marko Đurasević, Domagoj Jakobovic
The majority of standard approaches to financial portfolio optimization (PO) are based on the mean-variance (MV) framework. Given a risk aversion coefficient, the MV procedure yiel…
A Systematic Evaluation of Evolving Highly Nonlinear Boolean Functions in Odd Sizes
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Boolean functions are mathematical objects used in diverse applications. Different applications also have different requirements, making the research on Boolean functions very acti…
Look into the Mirror: Evolving Self-Dual Bent Boolean Functions
Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic +2
Bent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to b…
A New Angle: On Evolving Rotation Symmetric Boolean Functions
Claude Carlet, Marko Ðurasevic, Bruno Gašperov +3
Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean functions. At the same time, the fu…
A Search for Nonlinear Balanced Boolean Functions by Leveraging Phenotypic Properties
Bruno Gašperov, Marko Đurasević, Domagoj Jakobović
In this paper, we consider the problem of finding perfectly balanced Boolean functions with high non-linearity values. Such functions have extensive applications in domains such as…
Digging Deeper: Operator Analysis for Optimizing Nonlinearity of Boolean Functions
Marko Djurasevic, Domagoj Jakobovic, Luca Mariot +1
Boolean functions are mathematical objects with numerous applications in domains like coding theory, cryptography, and telecommunications. Finding Boolean functions with specific p…
A Survey of Metaheuristic Algorithms for the Design of Cryptographic Boolean Functions
Marko Djurasevic, Domagoj Jakobovic, Luca Mariot +1
Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an importa…
On the Evolution of Boomerang Uniformity in Cryptographic S-boxes
Marko Djurasevic, Domagoj Jakobovic, Luca Mariot +2
S-boxes are an important primitive that help cryptographic algorithms to be resilient against various attacks. The resilience against specific attacks can be connected with a certa…
DARWIN: Survival of the Fittest Fuzzing Mutators
Patrick Jauernig, Domagoj Jakobovic, Stjepan Picek +2
Fuzzing is an automated software testing technique broadly adopted by the industry. A popular variant is mutation-based fuzzing, which discovers a large number of bugs in practice.…
Novel ensemble collaboration method for dynamic scheduling problems
Marko Đurasević, Lucija Planinić, Francisco Javier Gil Gala +1
Dynamic scheduling problems are important optimisation problems with many real-world applications. Since in dynamic scheduling not all information is available at the start, such p…
Evolving Constructions for Balanced, Highly Nonlinear Boolean Functions
Claude Carlet, Marko Djurasevic, Domagoj Jakobovic +2
Finding balanced, highly nonlinear Boolean functions is a difficult problem where it is not known what nonlinearity values are possible to be reached in general. At the same time,…
Evolutionary Construction of Perfectly Balanced Boolean Functions
Luca Mariot, Stjepan Picek, Domagoj Jakobovic +2
Finding Boolean functions suitable for cryptographic primitives is a complex combinatorial optimization problem, since they must satisfy several properties to resist cryptanalytic…
Modeling Strong Physically Unclonable Functions with Metaheuristics
Carlos Coello Coello, Marko Djurasevic, Domagoj Jakobovic +2
Evolutionary algorithms have been successfully applied to attacking Physically Unclonable Functions (PUFs). CMA-ES is recognized as the most powerful option for a type of attack ca…
On the Difficulty of Evolving Permutation Codes
Luca Mariot, Stjepan Picek, Domagoj Jakobovic +2
Combinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly interesting given their applications in powerline commu…
Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey
Marko Đurasević, Domagoj Jakobović
Today scheduling problems have an immense effect on various areas of human lives, be it from their application in manufacturing and production industry, transportation, or workforc…
Evolutionary Algorithms for Designing Reversible Cellular Automata
Luca Mariot, Stjepan Picek, Domagoj Jakobovic +1
Reversible Cellular Automata (RCA) are a particular kind of shift-invariant transformations characterized by a dynamics composed only of disjoint cycles. They have many application…
On the Genotype Compression and Expansion for Evolutionary Algorithms in the Continuous Domain
Lucija Planinic, Marko Djurasevic, Luca Mariot +3
This paper investigates the influence of genotype size on evolutionary algorithms' performance. We consider genotype compression (where genotype is smaller than phenotype) and expa…