Characterization of almost perfect nonlinear functions in terms of subfunctions

References

[1] Gluhov M. M., “On the transition matrix of the differences for using some modular groups”, Matematicheskie voprosy kriptografii, 4: 4 (2013), 27–47 (in Russian).Search in Google Scholar

[2] Tuzhilin M. E., “Almost perfect nonlinear functions”, Prikladnaya diskretnaya matematika, 2009, № 3, 14–20 (in Russian).10.17223/20710410/5/2Search in Google Scholar

[3] Bending T. D., Fon-der-Flaass D., “Crooked functions, bent functions, and distance regular graphs”, Electron. J. Comb., 5 (1998).10.37236/1372Search in Google Scholar

[4] Biham E., Shamir A., “Differential cryptanalysis of DES-like cryptosystems”, J. Cryptology, 4: 1 (1991), 3–72.10.1007/3-540-38424-3_1Search in Google Scholar

[5] Brinkman M., Leander G., “On the classification of APN functions up to dimension five ”, Designs, Codes & Cryptogr., 49: 1 (2008), 273–288.10.1007/s10623-008-9194-6Search in Google Scholar

[6] Budaghyan L., Construction and analysis of cryptographic functions, Habilitation Thesis, Univ. of Paris 8, Sept. 2013.10.1007/978-3-319-12991-4Search in Google Scholar

[7] Carlet C., “Open questions on nonlinearity and on APN functions”, Arithmetic of Finite Fields, Lect. Notes Comput. Sci., 9061 (2015), 83–107.10.1007/978-3-319-16277-5_5Search in Google Scholar

[8] Carlet C., Vectorial Boolean functions for cryptography, In: Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Cambridge Univ. Press, 2010, 398–472.10.1017/CBO9780511780448.012Search in Google Scholar

[9] Carlet C., Charpin P., Zinoviev V., “Codes, bent functions and permutations suitable for DES-like cryptosystems”, Designs, Codes and Cryptography, 15: 2 (1998), 125–156.10.1023/A:1008344232130Search in Google Scholar

[10] Charpin P., “On almost perfect nonlinear functions over F2n, IEEE Trans. Inf. Theory, 52: 9 (2006), 4160–4170.10.1109/TIT.2006.880036Search in Google Scholar

[11] Daemen J., Rijmen V., The Design of Rijdael: AES — Advanced Encryption Standard, Springer, 2002, 256 pp.10.1007/978-3-662-04722-4Search in Google Scholar

[12] Dillon J. F., “APN polynomials: an update”, Proc. 9th Int. Conf. Finite Fields and Appl. (Dublin, Ireland, July 2009), http://mathsci.ucd.ie/gmg/Fq9Talks/Dillon.pdf.Search in Google Scholar

[13] Dobbertin H., “Almost perfect nonlinear power functions on GF(2ⁿ): a new class for n divisible by 5”, Proc. of Finite Fields and Appl. Fq5 (Berlin, Germany: Springer-Verlag, 2000), 113–121.10.1007/978-3-642-56755-1_11Search in Google Scholar

[14] Dobbertin H., “Almost perfect nonlinear power functions over GF( 2 n): the Niho case”, Inf. and Comput., 151: 1-2 (1999), 57-72.10.1006/inco.1998.2764Search in Google Scholar

[15] Edel Y., “On quadratic APN functions and dimensional dual hyperovals”, Designs, Codes and Cryptography, 57: 1 (2010), 35–44.10.1007/s10623-009-9347-2Search in Google Scholar

[16] Nyberg K., “Differentially uniform mappings for cryptography”, Eurocrypt 1993, Lect. Notes Comput. Sci., 765 (1994), 55–64.10.1007/3-540-48285-7_6Search in Google Scholar

[17] Nyberg K., Knudsen L. R., “Provable security against a differential attack”, J. Cryptology, 8: 1 (1995), 27–37.10.1007/BF00204800Search in Google Scholar

[18] Yoshiara Y., “Notes on APN functions, semibiplanes and dimensional dual hyperovals”, Designs, Codes and Cryptography, 56:2–3 (2010), 197–218.10.1007/s10623-010-9402-zSearch in Google Scholar

[19] Yu Y., Wang M., Li Y., “A matrix approach for constructing quadratic APN functions”, Designs, Codes and Cryptography, 73: 2 (2014), 587–600.10.1007/s10623-014-9955-3Search in Google Scholar