1. K. N. Koryagin and S. S. Khramkov, “Factorization Properties of Zhegalkin Polynomials,” in Methods of Mathematical Modeling and Information Processing (Moscow Institute for Physics and Technology, Moscow, 1987), pp. 159–161 [in Russian].
2. R. N. Zabaluev, “On the Mean Complexity of Boolean Functions Specified by Zhegalkin Polynomials,” Diskretnyi Analiz Issled. Operat., Ser. 1. 11(3), 3–15 (2004).
3. N. Courtois and W. Meier, “Algebraic Attacks on Stream Ciphers with Linear Feedback,” Lect. Notes Comput. Sci. 2656, 345–359 (2003).
4. W. Meier, E. Pasalic, and C. Carlet, “Algebraic Attacks and Decomposition of Boolean Functions,” Lect. Notes Comput. Sci. 3027, 474–491.
5. V. V. Baev, “Algorithms for Constructing Low-Degree Annihilators for Boolean Functions,” Diskretnaya Mat. 18(3), 138–151 (2006).