![]() A shorter version has appeared in the Proceedings of the 23rd Symposium on Information Theory in the Benelux, Louvain-La-Neuve, Belgian, 2002ĭe Bruijn, N.G.: A combinatorial problem. In: Lecture Notes Dedicated to Philippe Desarte. Springer, Berlin (2002)Ĭarlet, C., Klapper, A.: Upper bounds on the number of reslient functions and of bent functions. arXiv:0909.3321Ĭarlet, C., Gouget, A.: An upper bound on the number of m-resilient Boolean functions. Springer, Berlin (1996)Ĭanfield, E.R., Gao, Z., Greenhill, C., McKay, B.D., Robinson, R.W.: Asymtotic enumeration of correlation-immune Boolean functions. In: Advances in Cryptology-CRYPTO ’96 (Santa Barbara, CA). Springer, Berlin (1992)Ĭamion, P., Canteaut, A.: Generalization of Siegenthaler inequality and Schnorr-Vaudenay multipermutations. 161–166 (1986)Ĭamion, P., Carlet, C., Charpin, P., Sendrier, N.: On correlation-immune functions. In: Advances in Cryptology-Eurocrypt ’85. ![]() Technical report 1616, Computer Science Dept., University of Wisconsin (2007)īernasconi, J., Günter, C.G.: Analysis of nonlinear feedback logic for binary sequence generators. Simon Stevin 28, 203–217 (1951)īach, E.: Improved asymptotic formulas for counting correlation-immune Boolean functions. ![]() ![]() Van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |