An interesting thread in the research of Boolean functions for cryptography and coding theory is the study of secondary constructions: given a known function with a good cryptographic profile, the aim is to extend it to a (usually larger) function possessing analogous properties. In this work, we continue the investigation of a secondary construction based on cellular automata (CA), focusing on the classes of bent and semi-bent functions. We prove that our construction preserves the algebraic degree of the local rule, and we narrow our attention to the subclass of quadratic functions, performing several experiments based on exhaustive combinatorial search and heuristic optimization through Evolutionary Strategies (ES). Finally, we classify the obtained results up to permutation equivalence, remarking that the number of equivalence classes that our CA-XOR construction can successfully extend grows very quickly with respect to the CA diameter.

(2022). Heuristic search of (semi-)bent functions based on cellular automata [journal article - articolo]. In NATURAL COMPUTING. Retrieved from https://hdl.handle.net/10446/265013

Heuristic search of (semi-)bent functions based on cellular automata

Saletta, Martina;
2022-01-01

Abstract

An interesting thread in the research of Boolean functions for cryptography and coding theory is the study of secondary constructions: given a known function with a good cryptographic profile, the aim is to extend it to a (usually larger) function possessing analogous properties. In this work, we continue the investigation of a secondary construction based on cellular automata (CA), focusing on the classes of bent and semi-bent functions. We prove that our construction preserves the algebraic degree of the local rule, and we narrow our attention to the subclass of quadratic functions, performing several experiments based on exhaustive combinatorial search and heuristic optimization through Evolutionary Strategies (ES). Finally, we classify the obtained results up to permutation equivalence, remarking that the number of equivalence classes that our CA-XOR construction can successfully extend grows very quickly with respect to the CA diameter.
articolo
2022
Mariot, Luca; Saletta, Martina; Leporati, Alberto; Manzoni, Luca
(2022). Heuristic search of (semi-)bent functions based on cellular automata [journal article - articolo]. In NATURAL COMPUTING. Retrieved from https://hdl.handle.net/10446/265013
File allegato/i alla scheda:
File Dimensione del file Formato  
Heuristic search - Natural computing - Saletta.pdf

accesso aperto

Versione: publisher's version - versione editoriale
Licenza: Creative commons
Dimensione del file 488.93 kB
Formato Adobe PDF
488.93 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/265013
Citazioni
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 4
social impact