This article is cited in 4 scientific papers (total in 4 papers)
On some algorithms for constructing low-degree annihilators for Boolean functions
V. V. Baev
The algebraic method is widely used in analysis of filter generators of pseudo-random sequences. It is based on obtaining low-degree Boolean equations in bits of the initial states of the generator. The problem to obtain such equations reduces to finding low-degree annihilators for the filtering Boolean function. The presence of nonzero low-degree annihilators decreases the complexity of determining the initial state of the generator by means of its output.
In this research we deal with the problem to find all low-degree annihilators for a Boolean function defined as a polynomial in several variables. We propose two new algorithms which solve this problem. Their complexities are bounded above by polynomials of the number of variables of the function and of the number of monomials in the polynomial which defines the function. We also consider the application of these algorithms to realising the algebraic method by three known scenarios which yield low-degree equations.
PDF file (1313 kB)
Discrete Mathematics and Applications, 2006, 16:5, 439–452
V. V. Baev, “On some algorithms for constructing low-degree annihilators for Boolean functions”, Diskr. Mat., 18:3 (2006), 138–151; Discrete Math. Appl., 16:5 (2006), 439–452
Citation in format AMSBIB
\paper On some algorithms for constructing low-degree annihilators for Boolean functions
\jour Diskr. Mat.
\jour Discrete Math. Appl.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. V. Baev, “An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial”, Discrete Math. Appl., 17:5 (2007), 533–538
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
Leont'ev V. K., “Boolean polynomials and linear transformations”, Dokl. Math., 79:2 (2009), 216–218
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
|Number of views:|