On Hardware Implementation of Tang-Maitra Boolean Functions

A note on generalization of bent boolean functions

“…This class of Boolean functions is called Maiorana-McFarland bent [17], and denoted by M. The Maiorana-McFarland bent functions are used to construct cryptographic significance Boolean functions; for example, Dobbertin [5] constructed balanced Boolean functions with high nonlinearity by modifying the M functions. Recently, Tang and Maitra [29] was constructed a balanced Boolean function in n variables having absolute autocorrelation strictly less than 2 n 2 , nonlinearity greater than 2 n−1 − 2 n 2 and algebraic degree n − 1 by modifying a PS ap class of bent functions that belong to M. There are many recent papers [11,12,30] on this topic. Stȃnicȃ et al [27] proved that if π is a complete mapping permutation (π and π ⊕ I both are permutation, where I is an identity permutation) and ρ = i then f is a bent-negabent function.…”