On some algorithms for constructing low-degree annihilators for Boolean functions
V. V. Baev

This publication is cited in the following articles:

1. A. S. Zelenetsky, P. G. Klyucharev, “Affine Annihilator Finding Algorithm for Boolean Function”, Mat. mat. model., 2021, no. 1, 13  
2. A. S. Zelenetsky, P. G. Klyucharev, “Boolean Functions with Affine Annihilators”, Mat. mat. model., 2021, no. 6, 1  
3. S. N. Selezneva, “Multiaffine polynomials over a finite field”, Discrete Math. Appl., 31:6 (2021), 421–430            
4. K. N. Koryagin, “Level structure of Zhegalkin polynomials, properties of test sets, and an annihilator search algorithm”, Comput. Math. Math. Phys., 50:7 (2010), 1267–1273          
5. Leont'ev V. K., “Boolean polynomials and linear transformations”, Dokl. Math., 79:2 (2009), 216–218              
6. V. V. Bayev, “Some Lower Bounds on the Algebraic Immunity of Functions Given by Their Trace Forms”, Problems Inform. Transmission, 44:3 (2008), 243–265        
7. V. V. Baev, “An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial”, Discrete Math. Appl., 17:5 (2007), 533–538