Modifications of Patterson-Wiedemann functions for cryptographic applications
Subhamoy Maitra, Palash Sarkar · IEEE Transactions on Information Theory · 2002
Three basic properties of Boolean functions to be useful for cryptographic purposes are balancedness, high algebraic degree, and high nonlinearity. In addition, strict avalanche criteria and propagation characteristics are required for design of S-boxes. We introduce methods to modify the Patterson-Wiedemann (19983, 1990) and bent functions to achieve the above cryptographic properties. In the process, we are able to answer some open questions about Boolean functions.