Construction of Nonlinear Boolean Functions with Important Cryptographic Properties

Abstract. This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, there are infinitely many integers n (both odd and even), such that it is possible to construct n-variable, m-resilient functions having nonlinearity greater than 2n-1 - 2 n 2 . Also we obtain better results than all published works on the construction of n-variable, m-resilient functions, including cases where the constructed

• Type: Conference
• Year: 2000
• Where: EUROCRYPT
• Authors: Palash Sarkar, Subhamoy Maitra
• Keywords: Cryptology, EUROCRYPT 2000, Functions Having Nonlinearity, M-resilient Functions, Significant Boolean Functions