Search Results for author: Claude Carlet

Found 5 papers, 0 papers with code

A Systematic Evaluation of Evolving Highly Nonlinear Boolean Functions in Odd Sizes

no code implementations15 Feb 2024 Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic, Stjepan Picek, Luca Mariot

In the last 30 years, evolutionary algorithms have been shown to be a strong option for evolving Boolean functions in different sizes and with different properties.

Evolutionary Algorithms

Look into the Mirror: Evolving Self-Dual Bent Boolean Functions

no code implementations20 Nov 2023 Claude Carlet, Marko Ðurasevic, Domagoj Jakobovic, Luca Mariot, Stjepan Picek

This paper provides a detailed experimentation with evolutionary algorithms with the goal of evolving (anti-)self-dual bent Boolean functions.

Evolutionary Algorithms

A New Angle: On Evolving Rotation Symmetric Boolean Functions

no code implementations20 Nov 2023 Claude Carlet, Marko Ðurasevic, Bruno Gašperov, Domagoj Jakobovic, Luca Mariot, Stjepan Picek

Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean functions.

Evolutionary Algorithms

Evolutionary Strategies for the Design of Binary Linear Codes

no code implementations21 Nov 2022 Claude Carlet, Luca Mariot, Luca Manzoni, Stjepan Picek

The design of binary error-correcting codes is a challenging optimization problem with several applications in telecommunications and storage, which has also been addressed with metaheuristic techniques and evolutionary algorithms.

Evolutionary Algorithms

Evolving Constructions for Balanced, Highly Nonlinear Boolean Functions

no code implementations17 Feb 2022 Claude Carlet, Marko Djurasevic, Domagoj Jakobovic, Luca Mariot, Stjepan Picek

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.

Evolutionary Algorithms

Cannot find the paper you are looking for? You can Submit a new open access paper.