Boolean Functions for Cryptography
The Boolean Planet · a world of zeros and ones

Boolean Functions for Cryptography

Boolean functions — built from nothing but zeros and ones — sit at the heart of block ciphers, stream ciphers and hash functions. The strength of these systems depends on choosing functions with the right cryptographic properties. This site collects results, data and reference material from ongoing research into the design and analysis of cryptographic Boolean functions.

What's here

A Boolean function of $n$ inputs is a map $f : \{0,1\}^n \to \{0,1\}$ — its truth table is a string of $2^n$ bits. Despite this simple definition, finding functions that resist all known attacks remains an open problem. Researchers measure a function against criteria such as nonlinearity, correlation immunity, algebraic degree and autocorrelation, and group functions into affine equivalence classes that share these properties.

150,357
n = 6 equivalence classes
74,542
contain balanced functions
4
bent classes (NL = 28)
n ≤ 6
fully classified

Explore

About

This work began as PhD research at the Queensland University of Technology (Information Security Research Centre) and continues today. The original Boolean Planet site accompanied that research and was widely used as a reference for the $n = 6$ classification — data that researchers have continued to draw on, including NIST's 2018 study of the multiplicative complexity of 6-variable Boolean functions. This is its modern home.

About me

I completed my PhD on Boolean functions for cryptography at the Queensland University of Technology in 2003, and since then my work has spanned:

My interest in Boolean functions never stopped. I've kept coming back to them over the years, and I have unpublished work that I'm keen to finalise and share. This site is a first step.

To get in touch, please message me on LinkedIn.

My research interests: cryptographic Boolean functions and their classification; affine equivalence and invariants; cryptanalysis.

By Dr Joanne Fuller · ORCID 0000-0002-5221-3505 · Google Scholar · LinkedIn · PhD thesis (PDF)