Boolean functions are essential to systems for secure and reliable communication. This
comprehensive survey of Boolean functions for cryptography and coding covers the whole …

The classical TF-IDF algorithm only considers the weight of the term frequency and the
inverse document frequency, without considering the weights of other feature of word. After …

In this paper, we study sufficient conditions to improve the lower bound on the algebraic
immunity of a direct sum of Boolean functions. We exhibit three properties on the component …

The security of stream ciphers against algebraic attacks is studied in this paper. Emphasis is
given on analysing the properties of the underlying Boolean functions that need to be …

238 A. Varelias, K. Limniotis, & N. Kolokotronis this algorithm as the means to compute
similar de Bruijn sequences, we subsequently examine cryptographic properties of the …

Boolean functions generating de Bruijn sequences are discussed in this chapter in terms of
investigating whether two Boolean functions that generate “similar” de Bruijn sequences …

Булевы функции вообще и булевы полиномы, в частности, предмет теоретических и
прикладных исследований в различных областях информатики. Аннигиляторы …

Boolean functions in general and Boolean polynomials (Zhegalkin polynomials or algebraic
normal forms (ANF)) in particular are the subject of theoretical and applied studies in various …

Булевы функции вообще и булевы полиномы (полиномы Жегалкина, алгебраические
нормальные формы (АНФ)), в частности, предмет теоретических и прикладных …

Obtainment of exact value or high lower bound on the $ r $-th order nonlinearity of Boolean
function is a very complicated problem (especial if $ r> 1$). In a number of papers lower …