## CryptoDB

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

Authors: Hans Dobbertin Gregor Leander URL: http://eprint.iacr.org/2005/089 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2005-12426,
title={Cryptographer's Toolkit for Construction of $8$-Bit Bent Functions},
booktitle={IACR Eprint archive},
keywords={bent functions, highly nonlinear Boolean functions},
url={http://eprint.iacr.org/2005/089},
note={ Hans.Dobbertin@ruhr-uni-bochum.de 12863 received 21 Mar 2005},
author={Hans Dobbertin and Gregor Leander},
year=2005
}