Skip to main content
Erschienen in: Designs, Codes and Cryptography 9/2020

Open Access 13.02.2020

Cubic bent functions outside the completed Maiorana-McFarland class

verfasst von: Alexandr A. Polujan, Alexander Pott

Erschienen in: Designs, Codes and Cryptography | Ausgabe 9/2020

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper we prove that in opposite to the cases of 6 and 8 variables, the Maiorana-McFarland construction does not describe the whole class of cubic bent functions in n variables for all \(n\ge 10\). Moreover, we show that for almost all values of n, these functions can simultaneously be homogeneous and have no affine derivatives.
Anhänge
Nur mit Berechtigung zugänglich
Literatur
1.
Zurück zum Zitat Bending T.D.: Bent functions, SDP designs and their automorphism groups. Ph.D. thesis, Queen Mary and Westfield College (1993). Bending T.D.: Bent functions, SDP designs and their automorphism groups. Ph.D. thesis, Queen Mary and Westfield College (1993).
3.
Zurück zum Zitat Braeken A.: Cryptographic properties of Boolean functions and S-boxes. Ph.D. thesis, Katholieke Universiteit Leuven (2006). Braeken A.: Cryptographic properties of Boolean functions and S-boxes. Ph.D. thesis, Katholieke Universiteit Leuven (2006).
7.
Zurück zum Zitat Carlet C.: Boolean functions for cryptography and error-correcting codes. In: Y. Crama, P.L. Hammer (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Encyclopedia of Mathematics and Its Applications, pp. 257–397. Cambridge University Press (2010). https://doi.org/10.1017/CBO9780511780448.011CrossRef Carlet C.: Boolean functions for cryptography and error-correcting codes. In: Y. Crama, P.L. Hammer (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Encyclopedia of Mathematics and Its Applications, pp. 257–397. Cambridge University Press (2010). https://​doi.​org/​10.​1017/​CBO9780511780448​.​011CrossRef
10.
Zurück zum Zitat Dillon J.F.: A survey of bent functions. NSA Technical Journal Special Issue, pp. 191–215, (1972). Dillon J.F.: A survey of bent functions. NSA Technical Journal Special Issue, pp. 191–215, (1972).
15.
Zurück zum Zitat Duan M., Lai X., Yang M., Sun X., Zhu B.: Distinguishing properties of higher order derivatives of Boolean functions. Cryptology ePrint Archive, Report 2010/417 (2010). Duan M., Lai X., Yang M., Sun X., Zhu B.: Distinguishing properties of higher order derivatives of Boolean functions. Cryptology ePrint Archive, Report 2010/417 (2010).
17.
Zurück zum Zitat Edel Y., Pott A.: On designs and multiplier groups constructed from almost perfect nonlinear functions. In: Cryptography and Coding, 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15–17, 2009. Proceedings, pp. 383–401 (2009). https://doi.org/10.1007/978-3-642-10868-6_23. Edel Y., Pott A.: On designs and multiplier groups constructed from almost perfect nonlinear functions. In: Cryptography and Coding, 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15–17, 2009. Proceedings, pp. 383–401 (2009). https://​doi.​org/​10.​1007/​978-3-642-10868-6_​23.
18.
Zurück zum Zitat Edel, Y., Pott, A.: On the equivalence of nonlinear functions. In: Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, pp. 87–103 (2009). Edel, Y., Pott, A.: On the equivalence of nonlinear functions. In: Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes, pp. 87–103 (2009).
25.
Zurück zum Zitat MacWilliams F., Sloane N.: The Theory of Error-Correcting Codes, 2nd edn. North-holland Publishing Company, (1978).MATH MacWilliams F., Sloane N.: The Theory of Error-Correcting Codes, 2nd edn. North-holland Publishing Company, (1978).MATH
27.
Zurück zum Zitat Meng Q., Yang M., Zhang H., Cui J.: A novel algorithm enumerating bent functions. Cryptology ePrint Archive, Report 2004/274 (2004). Meng Q., Yang M., Zhang H., Cui J.: A novel algorithm enumerating bent functions. Cryptology ePrint Archive, Report 2004/274 (2004).
30.
Zurück zum Zitat Polujan A.A., Pott A.: Homogeneous cubic bent functions without affine derivatives outside the completed Maiorana-McFarland class. In: Proceedings of the Eleventh International Workshop on Coding and Cryptography (2019). Polujan A.A., Pott A.: Homogeneous cubic bent functions without affine derivatives outside the completed Maiorana-McFarland class. In: Proceedings of the Eleventh International Workshop on Coding and Cryptography (2019).
31.
Zurück zum Zitat Pott A.: Finite Geometry and Character Theory, vol. 1601. Lecture Notes in Mathematics Springer, Berlin (1995).CrossRef Pott A.: Finite Geometry and Character Theory, vol. 1601. Lecture Notes in Mathematics Springer, Berlin (1995).CrossRef
33.
Zurück zum Zitat Preneel B.: Analysis and design of cryptographic hash functions. Ph.D. thesis, Katholieke Universiteit Leuven (1993). Preneel B.: Analysis and design of cryptographic hash functions. Ph.D. thesis, Katholieke Universiteit Leuven (1993).
36.
Zurück zum Zitat Seberry J., Xia T., Pieprzyk J.: Construction of cubic homogeneous Boolean bent functions. Australasian Journal of Combinatorics 22, 233–245 (2000).MathSciNetMATH Seberry J., Xia T., Pieprzyk J.: Construction of cubic homogeneous Boolean bent functions. Australasian Journal of Combinatorics 22, 233–245 (2000).MathSciNetMATH
39.
Zurück zum Zitat Wolfram Research, Inc.: Mathematica, Version 11.2. Champaign, IL, (2017) Wolfram Research, Inc.: Mathematica, Version 11.2. Champaign, IL, (2017)
40.
Zurück zum Zitat Yashchenko, V.V.: On the propagation criterion for Boolean functions and on bent functions. Probl. Peredachi Inf. 33(1), 75–86 (1997). In Russian.MathSciNetMATH Yashchenko, V.V.: On the propagation criterion for Boolean functions and on bent functions. Probl. Peredachi Inf. 33(1), 75–86 (1997). In Russian.MathSciNetMATH
Metadaten
Titel
Cubic bent functions outside the completed Maiorana-McFarland class
verfasst von
Alexandr A. Polujan
Alexander Pott
Publikationsdatum
13.02.2020
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 9/2020
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-019-00712-y

Weitere Artikel der Ausgabe 9/2020

Designs, Codes and Cryptography 9/2020 Zur Ausgabe

Premium Partner