On a new classification of Boolean functions

We discuss a recent approach to the study of Boolean functions. The approach is based on a notion of $\Delta$-equivalence class, which is a set of Boolean functions having the same autocorrelation function. Such a classification has an apparently useful property: a substantial number of cryptographic characteristics of Boolean functions are the same within any $\Delta$-equivalence class.