Boolean Functions for Cryptography

Publications

Publications from this research. Where a paper is freely available, a link is given; please consult the publisher of record for the version of record.

PhD thesis

Analysis of Affine Equivalent Boolean Functions for Cryptography
J. Fuller. PhD thesis, Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, Brisbane, Australia, December 2003. Freely available from QUT ePrints: eprints.qut.edu.au/15828
The source of the results on this site: efficient algorithms for Boolean function analysis; the complete affine equivalence classification for $n \le 6$; the Theorem of Connectivity between equivalence classes and, from it, the first non-exhaustive test for affine equivalence and a self-mapping constant that enables enumeration of the classes; new constructions for bent and for maximum-nonlinearity balanced 8-input functions; and linear redundancy in S-boxes.

Cryptographic Boolean functions

Efficient Algorithms for Analysis of Cryptographic Boolean Functions
J. Fuller, W. Millan and E. Dawson. Australasian Workshop on Combinatorial Algorithms (AWOCA), Fraser Island, Australia, 2002.
Implementation techniques for fast analysis of Boolean function cryptographic properties — the packing and transform methods behind the exhaustive $n = 6$ classification. See Efficient Implementation.
Evolutionary Generation of Bent Functions for Cryptography
J. Fuller, W. Millan and E. Dawson. IEEE Congress on Evolutionary Computation (CEC 2003), Canberra, Australia, December 2003.
Search methods that generate bent functions, analysed by the affine equivalence classes they reach.
New Concepts in Evolutionary Search for Boolean Functions in Cryptology
W. Millan, J. Fuller and E. Dawson. IEEE Congress on Evolutionary Computation (CEC 2003), Canberra, Australia, December 2003.
Applies the affine equivalence class structure from the thesis, including the self-mapping constant, to evolutionary search for cryptographic Boolean functions.

Linear redundancy in the AES S-box

On Linear Redundancy in the AES S-box
J. Fuller and W. Millan. IACR ePrint Archive, 2002.
Analysis of linear redundancy structure in the AES substitution box.
Linear Redundancy in S-boxes
J. Fuller and W. Millan. Fast Software Encryption (FSE), Lund, Sweden, 2003.
The peer-reviewed presentation of the linear redundancy results, showing that the AES S-box (and others) exhibit linear redundancy — every output coordinate function is affine-equivalent to a single function. See the S-box survey.

Stream ciphers

The LILI-II Keystream Generator
A. Clark, E. Dawson, J. Fuller, J. Golić, H-J. Lee, W. Millan, S-J. Moon and L. Simpson. Australasian Conference on Information Security and Privacy (ACISP 2002), Lecture Notes in Computer Science 2384, pp. 25–39, Springer, 2002.

Related work using this data

The Multiplicative Complexity of 6-variable Boolean Functions
Ç. Çalık, M. Sönmez Türan and R. Peralta. IACR ePrint 2018/002. eprint.iacr.org/2018/002
Computes the multiplicative complexity (minimum AND-gate count) of all 150,357 $n = 6$ equivalence classes — building on the classification published here. Relevant to lightweight cryptography and NIST standardisation work.

If you use the $n = 6$ classification data, please cite the PhD thesis above (see how to cite). If you have used the data in your own work, I'd be glad to hear about it: please message me on LinkedIn.