Algebra for Cryptologists pp 175-218 | Cite as

# Boolean Functions

Chapter

First Online:

## Abstract

Following from our previous chapter in which we noted some properties that we require in Boolean functions which are to be used as combining functions and filter functions, we now look at Boolean functions more closely. We start with an efficient way of determining the Algebraic Normal Form of a Boolean function, given its outputs for all possible inputs (and conversely) and then proceed with the Walsh–Hadamard transform and its applications to the kind of problems that we have identified. We end the chapter with a brief introduction to the Discrete Fourier Transform, where our knowledge of finite fields is required once again.

## Keywords

Boolean Function Discrete Fourier Transform Linear Structure Block Cipher Stream Cipher
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Copyright information

© Springer International Publishing Switzerland 2016