On the nonlinearity of Boolean functions with restricted input

Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P. L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp 257–397. Cambridge University Press, Cambridge (2010)

Carlet, C., Mesnager, S.: Improving the upper bounds on the covering radii of binary Reed-Muller codes. IEEE Trans. Inf. Theory 53(1), 162–173 (2007)

Carlet, C., Mesnager, S.: Four decades of research on bent functions. Des. Codes Crypt. 78(1), 5–50 (2016)

Carlet, C., Méaux, P., Rotella, Y.: Boolean functions with restricted input and their robustness; application to the flip cipher. IACR Transactions on Symmetric Cryptology (3), 192–227. https://doi.org/10.13154/tosc.v2017.i3.192-227 (2017)

Dillon, J.: Elementary Hadamard difference sets. PhD Thesis, University of Maryland (1974)

Méaux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: EUROCRYPT 2016, pp. 311–343 (2016)

Mesnager, S.: Binary Bent Functions: Fundamentals and Results. Springer, Switzerland (2016)

Rothaus, O.S.: On “bent” functions. Journal of Combinatorial Theory, Series A 20, 300–305 (1976)

Wang, Q., Johansson, T.: A note on fast algebraic attacks and higher order nonlinearities. In: International Conference on Information Security and Cryptology, Inscrypt 2010, pp. 404–414 (2010)