Conclusion
The question related to (in)decomposition of functions has been addressed. We first corrected some results in [7].
Further, A generalized method to check decomposition of Boolean functions was provided. At last, some sufficient conditions that the functions constructed by the indirect sum construction were indecomposable were presented.
Change history
13 August 2022
Incorrect cover date was used, instead of 2022 it should be 2023.
References
Zhou Y, Zhang W, Li J, Dong X, Xiao G. The autocorrelation distribution of balanced Boolean function. Frontiers of Computer Science, 2013, 7(2): 272–278
Zhao H, Wei Y. New construction of highly nonlinear resilient S-boxes via linear codes. Frontiers of Computer Science, 2022, 16(3): 163805
Dillon J F. Elementary hadamard difference sets. University of Maryland, Dissertation, 1974
Zhang F, Wei Y, Pasalic E, Xia S. Large sets of disjoint spectra plateaued functions inequivalent to partially linear functions. IEEE Transactions on Information Theory, 2018, 64(4): 2987–2999
Zhang W, Pasalic E. Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria. Information Sciences, 2017, 376: 21–30
Biham E, Shamir A. Differential cryptanalysis of DES-like cryptosystems. Journal of Cryptology, 1991, 4(1): 3–72
Zheng Y, Zhang X M. Non-separable cryptographic functions. In: Proceedings of the 2000 International Symposium on Information Theory and its Application. 2000, 51–58
Carlet C. On the secondary constructions of resilient and bent functions. In: Feng K, Niederreiter H, Xing C, eds. Coding, Cryptography and Combinatorics. Basel: Birkhäuser. 2004: 3–28
MacWilliams F J, Sloane N J A. The Theory of Error-Correcting Codes. Amsterdam: North-Holland Publishing Company, 1977
Rothaus O S. On “bent” functions. Journal of Combinatorial Theory, Series A, 1976, 20(3): 300–305
Acknowledgements
This work was supported by the Fundamental Research Funds for the Central Universities of China (2015QNA38) and the Natural Science Foundation of China (Grant No. 61972400).
Author information
Authors and Affiliations
Corresponding author
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Wang, Z., Xia, S. & Zhang, F. Further study on indecomposable cryptographic functions. Front. Comput. Sci. 17, 172803 (2023). https://doi.org/10.1007/s11704-021-0550-2
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11704-021-0550-2