Abstract
By some basic transforms and invariant theory, we give two results: 1) an algorithm, which can be used to judge if two Boolean functions are affinely equivalent and to obtain the equivalence relationship if they are equivalent. This is useful in studying Boolean functions and in engineering. For example, we classify all 8-variable homogeneous bent functions of degree 3 into two classes; 2) Reed-Muller codes R(4,6)/R(1,6), R(3,7)/R(1,7) are classified efficiently.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Glolmb S. On the classification of Boolean functions. IRE Trans on Circ Theor, 1959, 6: 178–186
Harrison M A. Counting theorems and their applications to classifications of switching functions. In: Mukhopadhyay A, ed. Recent Developments in Switching Theory. New York: Academic Press, 1971. 85–120
Berlekamp E, Welch L. Weight distribution of the cosets of the (32, 6) Reed-Muller code. IEEE Trans Inform Theor, 1972, 18(1): 203–207
Wen Q, Niu X, Yang Y. Boolean Functions in Modern Cryptography (in Chinese). Beijing: Science Press, 2000
Li S, Zeng B, Lian Y, et al. Logic Functions in Cryptography (in Chinese). Beijing: Beijing Sinosoft Electronic Press, 2003
Macwillams F J, Solane N J A. The Theory of Error-correcting Codes. Amsterdam: North-holland publishing Company, 1978
Maiorana J A. A classification of the cosets of the Reed-Muller code R(1, 6). Math Comput, 1991, 57: 403–414
Hou X. GL(m, 2) acting on R(r, m)/R(r-1, m). Discrete Math, 1996, 149: 99–122
Hou X. AGL(m,2) acting on R(r, m)/R(s, m). J Algebra, 1995, 171: 921–938
Brier E, Langevin P. Classification of Boolean cubic forms in nine variables. In: Proceedings of IEEE Information Theory Workshop, 2003. 179–182
Fuller J, Millan W. Linear redundancy in S-box. In: Fast Software Encryption, Lect Notes Comput Sci 2887. Berlin: Springer-Verlag, 2003. 74–86
Meng Q, Zhang H. The analysis of linear equivalence of Boolean functions and its applications (in Chinese). Chin J Comput, 2004, 27(11): 1528–1532
Braeken A, Borisov Y, Nikova S, et al. Classification of Boolean functions of 6 variables or less with respect to cryptographic properties. In: Yung M, Italiano G F, Palamidessi C, eds. International Colloquim on Automata, Languages and Programming ICALP 2005, Lect Notes Comput Sci 3580. Berlin: Springer-Verlag, 2005. 324–334
Yang R, Zeng B, Li S. The characteristic of spectrum and self-correlation of some Boolean functions linearly equivalent to specific cryptographic functions. Eng Sci (in Chinese), 2005, 7(11): 60–65
Preneel B. Analysis and design of cryptographic hash functions. Ph. D Thesis, Leuven (Belgium): Katholieke University, 1993
Meng Q, Zhang G, Yang M, et al. A novel algorithm enumerating bent functions. http://eprint.iacr.org, 2004/274
Fuller J, Dawson E, Millan W. Evolutionary generation of bent functions for cryptography. The 2003 Congress on Evolutionary Computation, 2003, 3: 1655–1661
Clark J A, Jacob J L, Matria S, et al. Almost Boolean functions: the design of Boolean functions by spectral inversion. Comput Intell, 2004, 20(3): 446–458
Meng Q, Zhang H, Wang Z, et al. Designing bent functions using evolving method. Acta Elect Sin (in Chinese), 2004, 32(11): 1901–1903
Meng Q, Zhang H, Cui J, et al. Almost-enumeration of 8-variable bent functions. http://eprint.iacr.org 2005/100
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (Grant Nos. 69973034, 60373087, 60673071)
Rights and permissions
About this article
Cite this article
Meng, Q., Zhang, H., Yang, M. et al. Analysis of affinely equivalent Boolean functions. SCI CHINA SER F 50, 299–306 (2007). https://doi.org/10.1007/s11432-007-0030-9
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11432-007-0030-9