Cryptographer's Toolkit for Construction of $8$-Bit Bent Functions

Hans Dobbertin; Gregor Leander

Paper 2005/089

Cryptographer's Toolkit for Construction of $8$-Bit Bent Functions

Hans Dobbertin and Gregor Leander

Abstract

Boolean functions form basic building blocks in various cryptographic algorithms. They are used for instance as filters in stream ciphers. Maximally non-linear (necessarily non-balanced) Boolean functions with an even number of variables are called bent functions. Bent functions can be modified to get balanced highly non-linear Boolean functions. Recently the first author has demonstrated how bent functions can be studied in a recursive framework of certain integer-valued functions. Based on this new approach we describe the practical systematic construction of $8$-bit bent functions. We outline also how to compute the number of all $8$-bit bent functions.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: bent functions highly nonlinear Boolean functions
Contact author(s): Hans Dobbertin @ ruhr-uni-bochum de
History: 2005-03-22: received
Short URL: https://ia.cr/2005/089
License: CC BY

BibTeX

@misc{cryptoeprint:2005/089,
      author = {Hans Dobbertin and Gregor Leander},
      title = {Cryptographer's Toolkit for Construction of $8$-Bit Bent Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2005/089},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/089}},
      url = {https://eprint.iacr.org/2005/089}
}