Boolean Functions for Cryptography

Learning

A short, opinionated set of starting points for getting into Boolean functions for cryptography. This list will grow.

Core concepts

A Boolean function $f : \{0,1\}^n \to \{0,1\}$ is judged for cryptographic use against a handful of properties:

These criteria interact and often conflict: improving one can worsen another. Designing a function that is simultaneously good across all of them — and provably so — is the central challenge.

Key transforms

See Efficient Implementation for how these are computed in practice.

Foundational reading

Tools

Resources: papers and datasets

A curated, growing list of openly available papers, datasets and references for Boolean functions in cryptography. Links point to canonical sources — author / arXiv preprints, IACR ePrint, PubMed Central, the AMS, publisher DOIs, and official code repositories. Entries marked free have free full text.

This list grows over time. If a link breaks or you have a suggestion, please message me on LinkedIn.

Textbooks & surveys

Classification & affine equivalence ($n \le 6$)

Algebraic immunity & algebraic attacks

Multiplicative complexity & datasets

Higher-order nonlinearity & covering radius

Foundational classics

Origin papers — widely cited; not all are freely online (check a library or the publisher).