Cryptographic Boolean Functions in Lean

6. Resilient functions🔗

Carlet's Chapter 7 develops resilient Boolean functions through their Walsh zeros, divisibility, algebraic degree, nonlinearity, interactions with other cryptographic criteria, and recursive constructions. Throughout, V_n=\mathbb F_2^n and W_f denotes the unnormalized Walsh transform.

  1. 6.1. Degree, divisibility, and nonlinearity
  2. 6.2. Correlation and propagation criteria
  3. 6.3. Primary constructions
  4. 6.4. Composition on coordinate blocks
  5. 6.5. Secondary constructions
  6. 6.6. Counting resilient functions