Abstract
A large class of linear structural functions(LSF) satisfying the condition of correlational immunity of order one are constructed by studying the linear structural Boolean functions. With these new founded functions, the known enumeration bounds of correlation-immune functions of order one are greatly improved. In fact, the best, up to now, lower bound is found.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Mitchell, Enumerating Boolean functions of cryptographic significance, J. of Cryptology, 2(1990)3, 155–170.
Yang Yixian, Hu Zhengming, On the enumeration of Boolean functions used for stream cipher, J. of Chinese Institute of Communications (1992)4, 18–24, (in Chinese).
Yang Yixian, Guo Baoan, Further enumeration of Boolean functions of cryptographic significance, J. of Cryptology, 8(1995)2, 115–122.
Guo Baoan, Analysis and synthesis of non-linear sequences, Ph. D Thesis, Beijing University of Posts and Telecommunications, 1996.
Luke O’Connor, Andrew Klapper, Algebraic nonlinearity and it’s applications to cryptography, J. of Cryptology, 7(1994)4, 213–227.
Yang Yixian, Lin Xuduan, Hu Zhengming, Coding and Cryptography, People’s Posts and Telecommunications Press, Beijing, 1992, Chap.15, 538–549.
Author information
Authors and Affiliations
About this article
Cite this article
Tian, H., Yang, Y. & Wang, J. Enumerating correlation-immune boolean functions of order one. J. of Electron.(China) 15, 50–57 (1998). https://doi.org/10.1007/s11767-998-0021-z
Issue Date:
DOI: https://doi.org/10.1007/s11767-998-0021-z