On the sets of the propagation criterion for strict majority Boolean functions

References

[1] Ivchenko G. I., Medvedev Yu. I., Mironova V. A., “Krawtchouk polynomials and their applications in cryptography and coding theory”, Matematicheskie voprosy kriptografii, 61 (2015), 33–56 (in Russian).10.4213/mvk150Search in Google Scholar

[2] Kamlovskii O. V., “The sum of modules of Walsh coefficients for some balanced Boolean functions”, Matematicheskie voprosy kriptografii, 84 (2017), 75–98 (in Russian).10.4213/mvk240Search in Google Scholar

[3] Logachev O. A., Salnikov A. A., Smyshlyaev S. V., Yashchenko V. V., Boolean functions in coding theory and cryptology, M.: MCCME, 2012 (in Russian), 584 pp.Search in Google Scholar

[4] Carlet C., Boolean Functions for Cryptography and Coding Theory, Cambridge University Press, 2020, 574 pp.10.1017/9781108606806Search in Google Scholar

[5] Dalai D. K., Maitra S., Sarkar S., “Basic theory in construction of Boolean functions with maximum possible annihilator immunity”, Designs, Codes and Cryptography, 40 (2006), 41–58.10.1007/s10623-005-6300-xSearch in Google Scholar

[6] Feinsilver P., “Sums of squares of Krawtchouk polynomials, Catalan numbers, and some algebras over the Boolean lattice”, Int. J. Math. Comp. Sci., 121 (2017), 65–83.Search in Google Scholar

[7] Krawtchouk M., “Sur une généralisation des polynômes d’Hermite”, Comptes Rendus Math., 189 (1929), 620–622.Search in Google Scholar

[8] Preneel B., Van Leekwijck W., Van Linden L., Govaerts R., Vandewalle J., “Propagation characteristics of Boolean functions”, EUROCRYPT 1990, Lect. Notes Comput. Sci., 473 1990, 161–173.10.1007/3-540-46877-3_14Search in Google Scholar

[9] Rothaus O. S., “On “Bent” Functions”, J. Comb. Theory (A), 203 (1976), 300–305.10.1016/0097-3165(76)90024-8Search in Google Scholar

[10] Titswort R. C., Correlation properties of cyclic sequences, Ph. D. dissertation, Calif. Inst. Technol., Pasadena, California, 1962, 244 pp.Search in Google Scholar