A note on the construction and upper bounds of correlation-immune functions
In this paper, an algorithm for the construction of correlation-immune functions is given. It will be shown that the proposed algorithm provides a method to construct every mth order correlationimmune function. Besides correlation-immunity, also other properties of Boolean functions, like Hamming weight, can be taken into account. The complexity analysis of the proposed algorithm leads to a new upper bound for the number of specified correlation-immune functions and correlation-immune functions in general, depending on the number of input variables n and the order of correlation-immunity.
Unable to display preview. Download preview PDF.
- [CCCS 91]P. Camion, C. Carlet, P. Charpin, N. Sendrier: ‘On Correlation-immune Functions', Advances in Cryptology: Crypto '91, Proceedings, Lecture Notes on Computer Science 576, 1991, p. 86–100Google Scholar
- [GuMa 88]
- [SeZh 93]J. Seberry, X. Zhang, Y. Zheng: ‘On Constructions and Nonlinearity of Correlation Immune Functions', Advances in Cryptology: Eurocrypt '93, Proceedings, Lecture Notes on Computer Science 765, 1993, p. 181–199Google Scholar
- [Sieg 84]
- [Sieg 85]T. Siegenthaler: ‘Decrypting a Class of Stream Ciphers Using Ciphertext Only', IEEE Transactions on Computers, Vol. C-34, No.1, Jan. 1985, p. 81–85Google Scholar
- [YaGu 95]