The complexity of Boolean functions from cryptographic viewpoint

@inproceedings{Carlet2006TheCO,
  title={The complexity of Boolean functions from cryptographic viewpoint},
  author={Claude Carlet},
  booktitle={Complexity of Boolean Functions},
  year={2006}
}
Cryptographic Boolean functions must be complex to satisfy Shannon’s principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit complexity. The two main criteria evaluating the cryptographic complexity of Boolean functions on F n 2 are the nonlinearity (and more generally the r-th order nonlinearity, for every positive r < n) and the algebraic degree. Two other criteria have also been considered: the algebraic thickness and the non-normality. After… CONTINUE READING