Abstract
In this paper, a new method to analyze Boolean functions is proposed. By this method, one can analyze the balancedness, the nonlinearity, and the input-output correlation of vectorial Boolean functions. The basic idea of this method is to compute the refined covers of some parametric Boolean polynomial systems which are equivalent to these problems. By a refined cover, the parameter space is divided into several disjoint components, and on each component, the parametric Boolean polynomial system has a fixed number of solutions. An efficient algorithm based on the characteristic set method to compute refined covers of parametric Boolean polynomial systems is presented. The experimental results about some instances generated from cryptanalysis show that this new method is efficient and can solve some instances which can not be solved in reasonable time by other methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Carlet C, Vectorial Boolean functions for cryptography, Boolean Models and Methods in Mathematics, Computer Science, and Engineering, 2010, 134: 398–469.
Fischer S and Meier W, Algebraic immunity of S-boxes and augmented functions, International Workshop on Fast Software Encryption, LNCS, 2007, 4593: 366–381.
Carlet C and Feng K, An infinite class of balanced vectorial boolean functions with optimum algebraic immunity and good nonlinearity, Coding and Cryptology, Second International Workshop, Zhangjiajie, China, June, 2009.
Dobbertin H, Construction of bent functions and balanced Boolean functions with high nonlinearity, International Workshop on Fast Software Encryption, Springer, Berlin, Heidelberg, 1995, 61–74.
Satoh T, Iwata T, and Kurosawa K, On cryptographically secure vectorial Boolean functions, Advances in Cryptology-ASIACRYP’99, Springer Berlin Heidelberg, 1999, 20–28.
Gao X S and Chou S C, Solving parametric algebraic systems, International Symposium on Symbolic and Algebraic Computation, 1992, 335–341.
Kapur D, Sun Y, and Wang D, A new algorithm for computing comprehensive Grobner systems, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ACM, 2010, 29–36.
Weispfenning V, Comprehensive Grobner bases, Journal of Symbolic Computation, 1992, 14: 1–29.
Huang Z, Parametric equation solving and quantifier elimination in finite fields with the characteristic set method, Journal of Systems Science and Complexity, 2012, 25(4): 778–791.
Gao X S and Huang Z, Characteristic set algorithms for equation solving in finite fields, Journal of Symbolic Computation, 2012, 47(6): 655–679.
De Canniere C, Trivium: A stream cipher construction inspired by block cipher design principles, International Conference on Information Security, Springer, Berlin, Heidelberg, 2006.
Huang Z, Sun Y and Lin D, On the efficiency of solving Boolean polynomial systems with the characteristic set method, Journal of Symbolic Computation, 2019, https://doi.org/10.1016/j.jsc.2019.11.001.
Author information
Authors and Affiliations
Corresponding authors
Additional information
This research was in part supported by the National Natural Science Foundation of China under Grant Nos. 61977060 and 61877058.
This paper was recommended for publication by Editor LI Hongbo.
Rights and permissions
About this article
Cite this article
Huang, Z., Sun, Y. & Lin, D. Analyzing Boolean Functions via Solving Parametric Polynomial Systems. J Syst Sci Complex 34, 792–808 (2021). https://doi.org/10.1007/s11424-020-9209-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-020-9209-6