Paper 2000/053

A Construction of Resilient Functions with High Nonlinearity

Thomas Johansson and Enes Pasalic

Abstract

The relationship between nonlinearity and resiliency for a function $F:\mathbb{F}_2^n \mapsto \mathbb{F}_2^m$ is considered. We give a construction of resilient functions with high nonlinearity. The construction leads to the problem of finding a set of linear codes with a fixed minimum distance, having the property that the intersection between any two codes is the all zero codeword only. This problem is considered, and existence results are provided. The constructed functions obtain a nonlinearity superior to previous construction methods.

Metadata
Available format(s)
PDF PS
Publication info
Published elsewhere. Unknown where it was published
Keywords
boolean functionresilient functionS-boxnonintersecting codes
Contact author(s)
enes @ it lth se
History
2000-10-24: received
Short URL
https://ia.cr/2000/053
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2000/053,
      author = {Thomas Johansson and Enes Pasalic},
      title = {A Construction of Resilient Functions with High Nonlinearity},
      howpublished = {Cryptology {ePrint} Archive, Paper 2000/053},
      year = {2000},
      url = {https://eprint.iacr.org/2000/053}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.