Skip to main navigation Skip to search Skip to main content

Cryptografische eigenschappen van Booleaanse functies en S-boxen

Translated title of the thesis: Cryptographic Properties of Boolean Functions and S-Boxes

Student thesis: Doctoral Thesis

Abstract

This thesis deals with building blocks of cryptosystems in symmetric cryptography. The building blocks can be seen as Boolean functions for a one dimensional output and vectorial Boolean functions, also called S(ubstitution)-boxes, for a multi dimensional output.
We start with a thorough security analysis of the filter and combination generator in order to derive the minimal requirements on the Boolean function in the generator. Then, we investigate the existence of efficiently implementable functions satisfying these requirements. For this purpose, we study the symmetric functions and the Boolean functions that are affine equivalent to the trace function of highly nonlinear bijective power functions.
In order to study Boolean functions with a broader perspective, we derive the affine equivalence classes of Boolean functions in 5 variables and 6 and 7 variables of degree less than or equal to 3. From this classification, we find several new properties on maximum resilient cubic Boolean functions, distance of resilient functions to low degree functions, and cubic bent functions in less than or equal to 8 variables.
We also study the strength of two building blocks which are frequently used in cryptographic algorithms, namely the addition and multiplication in a finite field. In particular, we derive a compact representation of the algebraic equations representing the nonlinear combinations of the output components of the S-boxes.
Finally, by considering a new metric, we generalize several cryptographic properties of Boolean functions. The new definitions result in a better understanding of these properties and provide a better insight in the space defined by this metric. This approach leads to the construction of ''hand-made'' Boolean functions, i.e., functions for which the security with respect to some specific monotone sets of inputs is considered, instead of the security with respect to all possible monotone sets with the same cardinality, as in the usual definitions. We show relations between resilient Boolean functions, error-correcting codes, and orthogonal arrays in this generalized setting.
Date of Award8 Mar 2006
Original languageDutch
SupervisorBart Preneel (Promotor)

Keywords

  • Boolean function, resiliency, propagation
  • lineairity, algebraic immunity, symmetric

Cite this

'