Boolean Functions for Cryptography

Function Analyser

Paste the truth table of any Boolean function with up to 10 inputs to see its cryptographic properties, all computed in your browser from the definitions on the Basics page. For $n \le 5$ it also tells you exactly which affine equivalence class the function belongs to, and for $n = 6$ which of the original classification data files contains its class.

Examples:

Formats: a hex value for $n \le 5$ (bit $i$ is $f(i)$, e.g. 0xe8); comma-separated 32-bit words for larger $n$, word 0 first, as in the data files (e.g. 0x110707FF,0xE0422107); or a string of 0s and 1s, $f(0)$ first.