On equivalence classes of Boolean functions
In FSE 2010, Rønjom and Cid put forward a nonlinear equivalence for Boolean functions and demonstrated that many cryptographic properties are not invariant among functions within the same equivalence class by providing some special examples. Their paper presented the idea and many problems were left open.In this paper, we investigate equivalence of Boolean functions more deeply using a new method
