Improving high-meets-low technique to generate odd-variable resilient Boolean functions with currently best nonlinearity (Q2214052)

A high nonlinearity and a high resiliency order are necessary requirements for a Boolean function in cryptographic applications. By Parseval's identity, there is a natural trade-off between nonlinearity and resiliency. In this article, the authors improve the High-Meets-Low technique in [\textit{W. Zhang}, IEEE Trans. Inf. Theory 65, No. 9, 5856--5864 (2019; Zbl 1432.94148)], and present two constructions of Boolean functions in odd number \(n\) of variables (\(n = 2k+15\), \(n = 2k+9\)) with simultaneously high nonlinearity and high resiliency order. The obtained functions with a higher resiliency order attain the currently best known nonlinearity.