IDEM Enough? Evolving Highly Nonlinear Idempotent Boolean Functions
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912866658942976 |
|---|---|
| author | Carlet, Claude Ðurasevic, Marko Jakobovic, Domagoj Mariot, Luca Picek, Stjepan |
| author_facet | Carlet, Claude Ðurasevic, Marko Jakobovic, Domagoj Mariot, Luca Picek, Stjepan |
| contents | 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 invariance under a fixed linear map in a polynomial basis. These functions are attractive as candidates for cryptographic design, yet their additional algebraic constraints make the search for high nonlinearity substantially more difficult than in the unconstrained case. In this work, we investigate evolutionary methods for constructing highly nonlinear idempotent Boolean functions for dimensions $n=5$ up to $n=12$ using a polynomial basis representation with canonical primitive polynomials. Our results show that the problem of evolving idempotent functions is difficult due to the disruptive nature of crossover and mutation operators. Next, we show that idempotence can be enforced by encoding the truth table on orbits, yielding a compact genome of size equal to the number of distinct squaring orbits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_00837 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | IDEM Enough? Evolving Highly Nonlinear Idempotent Boolean Functions Carlet, Claude Ðurasevic, Marko Jakobovic, Domagoj Mariot, Luca Picek, Stjepan Cryptography and Security Neural and Evolutionary Computing 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 invariance under a fixed linear map in a polynomial basis. These functions are attractive as candidates for cryptographic design, yet their additional algebraic constraints make the search for high nonlinearity substantially more difficult than in the unconstrained case. In this work, we investigate evolutionary methods for constructing highly nonlinear idempotent Boolean functions for dimensions $n=5$ up to $n=12$ using a polynomial basis representation with canonical primitive polynomials. Our results show that the problem of evolving idempotent functions is difficult due to the disruptive nature of crossover and mutation operators. Next, we show that idempotence can be enforced by encoding the truth table on orbits, yielding a compact genome of size equal to the number of distinct squaring orbits. |
| title | IDEM Enough? Evolving Highly Nonlinear Idempotent Boolean Functions |
| topic | Cryptography and Security Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2602.00837 |