On a relationship between linear and differential characteristics of binary vector spaces mappings and diffusion characteristics over blocks of imprimitivity systems of translation group of the binary vector space

References

[1] Burov D. A., “On relationship between the parameters characterizing nonlinearity and nonhomomorphy of vector spaces transformation”, Discrete Math. Appl., 29:5 (2019), 287–294.Search in Google Scholar

[2] Burov D. A., “On scatter properties of modular addition operation over imprimitivity systems of the translation group of the binary vector space”, Discrete Math. Appl., 33:3 (2023), 127–156.Search in Google Scholar

[3] Gorchinskii Yu. N., “On homomorphisms of multibase universal algebras in connection with cryptographic applications”, Trudy po diskretnoy matematike, 1 (1997), 67–84 (in Russian).Search in Google Scholar

[4] De La Cruz Jimenez R. A., Kamlovskiy O. V., “The sum of modules of Walsh coefficients of Boolean functions”, Discrete Math. Appl., 26:5 (2016), 259–272.Search in Google Scholar

[5] Logachev O. A., Fedorov S. N., Yashchenko V. V., “Boolean functions as points on the hypersphere in the Euclidean space”, Discrete Math. Appl., 29:2 (2019), 89–101.Search in Google Scholar

[6] Malyshev F. M., “Probabilistic characteristics of differential and linear relations for nonhomogeneous linear medium”, Mate-maticheskie voprosy kriptografii, 10:1 (2019), 41–72 (in Russian).Search in Google Scholar

[7] Pogorelov B. A., Pudovkina M. A., “On the distance from permutations to imprimitive groups for a fixed system of imprimitivity”, Discrete Math. Appl., 24:2 (2014), 95–108.Search in Google Scholar

[8] Sidelnikov V. M., “On mutual correlation of sequences”, Soviet Math. Dokl., 12:1 (1971), 197–201.Search in Google Scholar

[9] Aragona R., Calderini M., Tortora A., Tota M., “Primitivity of PRESENT and other lightweight ciphers”, J. Algebra and Appl., 17:6 (2018), 1860115.Search in Google Scholar

[10] Bar-On A., Dunkelman O., Keller N., Weizman A., “DLCT: a new tool for differential-linear cryptanalysis”, EUROCRYPT 2019, Lect. Notes Comput. Sci., 11476, 2019, 313–342.Search in Google Scholar

[11] Bannier A., Bodin N., Filiol E., Partition-based trapdoor ciphers, IACR Cryptology Archive, Report 2016/493, 2016.Search in Google Scholar

[12] Beierle C., Canteaut A., Leander G., “Nonlinear approximations in cryptanalysis revisited”, IACR Trans. Symm. Cryptology, 2018:4 (2018), 80–101.Search in Google Scholar

[13] Beierle C., Leander G., “4-uniform permutations with null nonlinearity”, Cryptogr. Commun., 12 (2020), 1133–1141.Search in Google Scholar

[14] Blondeau C., Leander G., Nyberg K., “Differential-linear cryptanalysis revisited”, J. Cryptology, 30:3 (2017), 859–888.Search in Google Scholar

[15] Blondeau C., Nyberg K., “New links between differential and linear cryptanalysis”, EUROCRYPT 2013, Lect. Notes Comput. Sci., 7881, 2013, 388–404.Search in Google Scholar

[16] Bogdanov A., Leander G., Nyberg K., Wang M., “Integral and multidimensional linear distinguishers with correlation zero”, ASIACRYPT 2012, Lect. Notes Comput. Sci., 7658, 2012, 244–261.Search in Google Scholar

[17] Burov D. A., Pogorelov B. A., “An attack on 6 rounds of Khazad”, Matematicheskie voprosy kriptografii, 7:2 (2016), 35–46.Search in Google Scholar

[18] Calderini M., “Primitivity of the group of a cipher involving the action of the key-schedule”, J. Algebra and Appl., 20:5 (2020), 2150084.Search in Google Scholar

[19] Caranti A., Dalla Volta F., Sala M., “On some block ciphers and imprimitive groups”, Appl. Flgebra in Eng., Commun. Comput., 20 (2009), 339–350.Search in Google Scholar

[20] Carlet C., Boolean Functions for Cryptography and Coding Theory, Cambridge Univ. Press, Cambridge, 2021.Search in Google Scholar

[21] Cid C., Huang T., Peyrin T., Sasaki Y., Song L., “Boomerang connectivity table: a new cryptanalysis tool”, EUROCRYPT 2018, Lect. Notes Comput. Sci., 10821, 2018, 683–714.Search in Google Scholar

[22] Chabaud F., Vaudenay S., “Links between differential and linear cryptanalysis”, EUROCRYPT 1994, Lect. Notes Comput. Sci., 950, 1995, 356–365.Search in Google Scholar

[23] Courtois N.T., Pieprzyk J., “Cryptanalysis of block ciphers with overdefined systems of equations”, ASIACRYPT 2002, Lect. Notes Comput. Sci., 2501, 2002, 267–287.Search in Google Scholar

[24] Daemen J., Govaerts R., Vandewalle J., “Correlation matrices”, FSE 1994, Lect. Notes Comput. Sci., 1008, 1995, 275–285.Search in Google Scholar

[25] Dib S., “Asymptotic nonlinearity of vectorial Boolean functions”, Cryptogr. Communic., 6:2 (2013), 103–115.Search in Google Scholar

[26] Harpes C., Massey J., “Partitioning cryptanalysis”, FSE 1997, Lect. Notes Comput. Sci., 1267, 1995, 13–27.Search in Google Scholar

[27] Hemerlin M., Cho J. Y., Nyberg K., “Multidimensional linear cryptanalysis”, J. Cryptology, 32:2 (2019), 1–34.Search in Google Scholar

[28] Knudsen L. R., “Truncated and higher order differentials”, FSE 1994, Lect. Notes Comput. Sci., 1008, 1995, 196–211.Search in Google Scholar

[29] Kovács I., Malnič A., Marušič D., Miklavič Š., “Transitive group actions: (im)primitivity and semiregular subgroups”, J. Algebr Combin., 41 (2014), 867–885.Search in Google Scholar

[30] Leander G., Abdelraheem M. A., AlKhzaimi H., Zenner E., “A cryptanalysis of PRINTCIPHER: the invariant subspace attack”, CRYPTO 2011, Lect. Notes Comput. Sci., 6841, 2011, 206–221.Search in Google Scholar

[31] Leander G., Poschmann A., “On the classification of4 bit s-boxes”, WAIFI 2007, Lect. Notes Comput. Sci., 4547, 2007, 159–176.Search in Google Scholar

[32] Malyshev F. M., Trishin A. E., “Linear and differential cryptanalysis: another viewpoint”, Matematicheskie voprosy kriptografii, 11:2 (2020), 83–98.Search in Google Scholar

[33] Nyberg K., The extended autocorrelation and boomerang tables and links between nonlinearity properties of vectorial Boolean functions, IACR Cryptology Archive, Report 2019/1381, 2019.Search in Google Scholar

[34] Nyberg K., “Perfect nonlinear s-boxes”, EUROCRYPT 1991, Lect. Notes Comput. Sci., 547, 1991, 378–386.Search in Google Scholar

[35] Nyberg K., “Differentially uniform mappings for cryptography”, EUROCRYPT 1993, Lect. Notes Comput. Sci., 765, 1994, 55–64.Search in Google Scholar

[36] Todo Y., Leander G., Sasaki Y., “Nonlinear invariant attack — practical attack on full SCREAM, iSCREAM, and Midori64”, ASIACRYPT 2016, Lect. Notes Comput. Sci., 10032, 2016, 3–33.Search in Google Scholar

[37] Wallen J., “Linear approximations of addition modulo mod 2n”, FSE 2003, Lect. Notes Comput. Sci., 2887, 2003, 261–273.Search in Google Scholar

[38] Zhang X.-M., Zheng Y., Imai H., “Relating differential distribution tables to other properties of substitution boxes”, Des. Codes Cryptogr, 19:1 (2000), 45–63.Search in Google Scholar