Determine the number of the rational zeros of any given linearized polynomial is one of the
vital problems in finite field theory, with applications in modern symmetric cryptosystems …

Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important
problem in cryptography, coding theory, and computational complexity. We prove lower …

Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important
problem in cryptography, coding theory, and computational complexity. We prove lower …

The r th-order nonlinearity of a Boolean function is an important cryptographic criterion in
analysing the security of stream ciphers and block ciphers. In this paper, we compute the …

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 …

The hidden weighted bit function (HWBF) is a well-known benchmark function in the
branching program literature. In Wang et al.(2014), authors investigated the cryptographic …

The r-th order nonlinearity of Boolean functions is an important cryptographic criterion
associated with some attacks on stream and block ciphers. It is also very useful in coding …

To determine the dimension of null space of any given linearized polynomial is one of vital
problems in finite field theory, with concern to design of modern symmetric cryptosystems …

The higher order nonlinearity of a Boolean function is a cryptographic criterion, which plays
an important role in the design of secure block ciphers and stream ciphers. In this paper, we …