Paper 2000/048
New Constructions of Resilent and Correlation Immune Boolean Functions achieving Upper Bounds on Nonlinearity
Enes Pasalic, Thomas Johansson, Subhamoy Maitra, and Palash Sarkar
Abstract
Recently weight divisibility results on resilient and correlation
immune Boolean functions have received a lot of attention. These
results have direct consequences towards the upper bound on nonlinearity
of resilient and correlation immune Boolean functions of certain order.
Now the clear benchmark in the design of resilient Boolean functions
(which optimizes Sigenthaler's inequality) is to provide results
which attain the upper bound on nonlinearity. Here we construct a
7-variable, 2-resilient Boolean function with nonlinearity 56. This
solves the maximum nonlinearity issue for 7-variable functions with
any order of resiliency. Using this 7-variable function, we also
construct a 10-variable, 4-resilient Boolean function with nonlinearity
480. Construction of these two functions were justified as important
open questions in Crypto 2000. Also we provide methods to generate an
infinite sequence of Boolean functions on
Metadata
- Available format(s)
- PS
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- boolean function
- Contact author(s)
- subho @ isical ac in
- History
- 2000-09-26: received
- Short URL
- https://ia.cr/2000/048
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2000/048, author = {Enes Pasalic and Thomas Johansson and Subhamoy Maitra and Palash Sarkar}, title = {New Constructions of Resilent and Correlation Immune Boolean Functions achieving Upper Bounds on Nonlinearity}, howpublished = {Cryptology {ePrint} Archive, Paper 2000/048}, year = {2000}, url = {https://eprint.iacr.org/2000/048} }