On the Δ-equivalence of Boolean functions
Oleg Aleksejevich Logachev, Sergey N. Fedorov, Valerii Vladimirovich Yashchenko · Discrete Mathematics and Applications · 2020
Abstract A new equivalence relation on the set of Boolean functions is introduced: functions are declared to be Δ -equivalent if their autocorrelation functions are equal. It turns out that this classification agrees well with the cryptographic properties of Boolean functions: for functions belonging to the same Δ -equivalence class a number of their cryptographic characteristics do coincide. For example, all bent-functions (of a fixed number of variables) make up one class.