journal article Open Access Jun 18, 2024

Bent functions satisfying the dual bent condition and permutations with the $$(\mathcal {A}_m)$$ property

View at Publisher Save 10.1007/s12095-024-00724-z
Abstract
Abstract
The concatenation of four Boolean bent functions

$$f=f_1||f_2||f_3||f_4$$


f
=

f
1


|
|


f
2


|
|


f
3


|
|


f
4




is bent if and only if the dual bent condition

$$f_1^* + f_2^* + f_3^* + f_4^* =1$$



f
1


+

f
2


+

f
3


+

f
4


=
1



is satisfied. However, to specify four bent functions satisfying this duality condition is in general quite a difficult task. Commonly, to simplify this problem, certain relations between

$$f_i$$


f
i



are assumed, as well as functions

$$f_i$$


f
i



of a special shape are considered, e.g.,

$$f_i(x,y)=x\cdot \pi _i(y)+h_i(y)$$



f
i


(
x
,
y
)

=
x
·

π
i


(
y
)

+

h
i


(
y
)




are Maiorana-McFarland bent functions. In the case when permutations

$$\pi _i$$


π
i



of

$$\mathbb {F}_2^m$$


F
2
m



have the

$$(\mathcal {A}_m)$$


(

A
m

)



property and Maiorana-McFarland bent functions

$$f_i$$


f
i



satisfy the additional condition

$$f_1+f_2+f_3+f_4=0$$



f
1

+

f
2

+

f
3

+

f
4

=
0



, the dual bent condition is known to have a relatively simple shape allowing to specify the functions

$$f_i$$


f
i



explicitly. In this paper, we generalize this result for the case when Maiorana-McFarland bent functions

$$f_i$$


f
i



satisfy the condition

$$f_1(x,y)+f_2(x,y)+f_3(x,y)+f_4(x,y)=s(y)$$



f
1


(
x
,
y
)

+

f
2


(
x
,
y
)

+

f
3


(
x
,
y
)

+

f
4


(
x
,
y
)

=
s

(
y
)




and provide a construction of new permutations with the

$$(\mathcal {A}_m)$$


(

A
m

)



property from the old ones. Combining these two results, we obtain a recursive construction method of bent functions satisfying the dual bent condition. Moreover, we provide a generic condition on the Maiorana-McFarland bent functions

$$f_1,f_2,f_3,f_4$$



f
1

,

f
2

,

f
3

,

f
4




stemming from the permutations of

$$\mathbb {F}_2^m$$


F
2
m



with the

$$(\mathcal {A}_m)$$


(

A
m

)



property, such that the concatenation

$$f=f_1||f_2||f_3||f_4$$


f
=

f
1


|
|


f
2


|
|


f
3


|
|


f
4




does not belong, up to equivalence, to the Maiorana-McFarland class. Using monomial permutations

$$\pi _i$$


π
i



of

$$\mathbb {F}_{2^m}$$


F

2
m




with the

$$(\mathcal {A}_m)$$


(

A
m

)



property and monomial functions

$$h_i$$


h
i



on

$$\mathbb {F}_{2^m}$$


F

2
m




, we provide explicit constructions of such bent functions; a particular case of our result shows how one can construct bent functions from APN permutations, when m is odd. Finally, with our construction method, we explain how one can construct homogeneous cubic bent functions, noticing that only very few design methods of these objects are known.
Topics

No keywords indexed for this article. Browse by subject →

References
28
[1]
Anbar, N., Kudin, S., Meidl, W., Pasalic, E., Polujan, A.: Vectorial negabent concepts: Similarities, differences, and generalizations (2024). https://doi.org/10.48550/arXiv.2402.05677 10.48550/arxiv.2402.05677
[2]
Canteaut, A., Charpin, P.: Decomposing bent functions. IEEE Trans. Inf. Theory 49(8), 2004–2019 (2003). https://doi.org/10.1109/TIT.2003.814476 10.1109/tit.2003.814476
[3]
Carlet, C.: Two new classes of bent functions. In: Helleseth T. (ed.) Advances in Cryptology — EUROCRYPT ’93, pp. 77–101. Springer Berlin Heidelberg, Berlin, Heidelberg (1994). https://doi.org/10.1007/3-540-48285-7_8 10.1007/3-540-48285-7_8
[4]
Carlet, C.: On the secondary constructions of resilient and bent functions. In: Feng,K., Niederreiter, H., Xing, C. (eds.) Coding, Cryptography and Combinatorics, pp. 3–28. Birkhäuser Basel, Basel (2004). https://doi.org/10.1007/978-3-0348-7865-4_1 10.1007/978-3-0348-7865-4_1
[5]
Carlet, C.: Boolean functions for cryptography and coding theory. Cambridge University Press (2021). https://doi.org/10.1017/9781108606806 10.1017/9781108606806
[6]
Carlet, C., Mesnager, S.: Four decades of research on bent functions. Designs, Codes Cryptography 78(1), 5–50 (2016). https://doi.org/10.1007/s10623-015-0145-8 10.1007/s10623-015-0145-8
[7]
Cepak, N., Pasalic, E., Muratović-Ribić, A.: Frobenius linear translators giving rise to new infinite classes of permutations and bent functions. Cryptography Commun. 11(6), 1275–1295 (2019). https://doi.org/10.1007/s12095-019-00395-1 10.1007/s12095-019-00395-1
[8]
Charnes, C., Rötteler, M., Beth, T.: Homogeneous bent functions, invariants, and designs. Designs, Codes Cryptography 26(1), 139–154 (2002). https://doi.org/10.1023/A:1016509410000 10.1023/a:1016509410000
[9]
Charpin, P., Kyureghyan, G.M.: Monomial functions with linear structure and permutation polynomials. In: Finite fields: theory and applications, Contemp. Math., vol. 518, pp. 99–111. Amer. Math. Soc., Providence, RI (2010). https://doi.org/10.1090/conm/518/10199 10.1090/conm/518/10199
[10]
Dillon, J.F.: Elementary Hadamard difference sets. Ph.D. thesis, University of Maryland (1974). https://doi.org/10.13016/M2MS3K194 10.13016/m2ms3k194
[11]
Hodžić, S., Pasalic, E., Wei, Y.: A general framework for secondary constructions of bent and plateaued functions. Designs, Codes Cryptography 88(10), 2007–2035 (2020). https://doi.org/10.1007/s10623-020-00760-9 10.1007/s10623-020-00760-9
[12]
Hodžić, S., Pasalic, E., Wei, Y.: A general framework for secondary constructions of bent and plateaued functions. Designs, Codes Cryptography 88(10), 2007–2035 (2020). https://doi.org/10.1007/s10623-020-00760-9 10.1007/s10623-020-00760-9
[13]
Hodžić, S., Pasalic, E., Zhang, W.: Generic constructions of five-valued spectra boolean functions. IEEE Trans. Inf. Theory 65(11), 7554–7565 (2019). https://doi.org/10.1109/TIT.2019.2910808 10.1109/tit.2019.2910808
[14]
Mesnager, S.: Several new infinite families of bent functions and their duals. IEEE Trans. Inf. Theory 60(7), 4397–4407 (2014). https://doi.org/10.1109/TIT.2014.2320974 10.1109/tit.2014.2320974
[15]
Mesnager, S.: Bent Functions: Fundamentals and Results, 1st edn. Springer Cham (2016). https://doi.org/10.1007/978-3-319-32595-8 10.1007/978-3-319-32595-8
[16]
Further constructions of infinite families of bent functions from new permutations and their duals

Sihem Mesnager

Cryptography and Communications 2016 10.1007/s12095-015-0144-7
[17]
Mesnager, S., Cohen, G., Madore, D.: On existence (based on an arithmetical problem) and constructions of bent functions. In: Groth, J. (ed.) Cryptography and Coding, pp. 3–19. Springer International Publishing, Cham (2015). https://doi.org/10.1007/978-3-319-27239-9_1 10.1007/978-3-319-27239-9_1
[18]
Pasalic, E., Bapić, A., Zhang, F., Wei, Y.: Explicit infinite families of bent functions outside the completed Maiorana-McFarland class. Designs, Codes Cryptography 91(7), 2365–2393 (2023). https://doi.org/10.1007/s10623-023-01204-w 10.1007/s10623-023-01204-w
[19]
Pasalic, E., Polujan, A., Kudin, S., Zhang, F.: Design and analysis of bent functions using $$\cal{M} $$-subspaces. IEEE Trans. Inf. Theory 70(6), 4464–4477 (2024). https://doi.org/10.1109/TIT.2024.3352824 10.1109/tit.2024.3352824
[20]
Polujan, A.: Boolean and vectorial functions: a design-theoretic point of view. Ph.D. thesis, Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik (2021). https://doi.org/10.25673/37956 10.25673/37956
[21]
Polujan, A., Pasalic, E., Kudin, S., Zhang, F.: On bent functions satisfying the dual bent condition. In: The 8th International Workshop on Boolean Functions and their Applications (2023). https://boolean.w.uib.no/bfa-2023/
[22]
Polujan, A.A., Pott, A.: Cubic bent functions outside the completed Maiorana-McFarland class. Designs, Codes Cryptography 88(9), 1701–1722 (2020). https://doi.org/10.1007/s10623-019-00712-y 10.1007/s10623-019-00712-y
[23]
Preneel, B., Van Leekwijck, W., Van Linden, L., Govaerts, R., Vandewalle, J.: Propagation characteristics of boolean functions. In: Damgård, I.B. (ed.) Advances in Cryptology — EUROCRYPT ’90, pp. 161–173. Springer Berlin Heidelberg, Berlin, Heidelberg (1991). https://doi.org/10.1007/3-540-46877-3_14 10.1007/3-540-46877-3_14
[24]
Rothaus, O.: On “bent” functions. Journal of Combinatorial Theory, Series A 20(3), 300–305 (1976). https://doi.org/10.1016/0097-3165(76)90024-8 10.1016/0097-3165(76)90024-8
[25]
Seberry, J., Zhang, X.M., Zheng, Y.: Pitfalls in designing substitution boxes. In: Desmedt, Y.G. (ed.) Advances in Cryptology — CRYPTO ’94, pp. 383–396. Springer Berlin Heidelberg, Berlin, Heidelberg (1994). https://doi.org/10.1007/3-540-48658-5_35 10.1007/3-540-48658-5_35
[26]
Tokareva, N.: On the number of bent functions from iterative constructions: lower bounds and hypotheses (2011). https://doi.org/10.3934/amc.2011.5.609 10.3934/amc.2011.5.609
[27]
Zhang, F., Pasalic, E., Bapić, A., Wang, B.: Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class. Inf. Comput. 297, 105149 (2024). https://doi.org/10.1016/j.ic.2024.105149 10.1016/j.ic.2024.105149
[28]
Zhao, H., Wei, Y., Zhang, F., Pasalic, E., Cepak, N.: Two secondary constructions of bent functions without initial conditions. Des. Codes Cryptogr. 90(3), 653–679 (2022). https://doi.org/10.1007/s10623-021-00996-z 10.1007/s10623-021-00996-z
Metrics
6
Citations
28
References
Details
Published
Jun 18, 2024
Vol/Issue
16(6)
Pages
1235-1256
License
View
Funding
Otto-von-Guericke-Universität Magdeburg
Cite This Article
Alexandr Polujan, Enes Pasalic, Sadmir Kudin, et al. (2024). Bent functions satisfying the dual bent condition and permutations with the $$(\mathcal {A}_m)$$ property. Cryptography and Communications, 16(6), 1235-1256. https://doi.org/10.1007/s12095-024-00724-z