E Dubrova, M Hell - Cryptography and Communications, 2017 - Springer
The demand for more efficient ciphers is a likely to sharpen with new generation of products and applications. Previous cipher designs typically focused on optimizing only one of the …
Boolean functions represent an important primitive in the design of various cryptographic algorithms. There exist several well-known schemes where a Boolean function is used to …
E Dubrova - Designs, codes and cryptography, 2014 - Springer
Non-linear feedback shift registers (NLFSRs) are a generalization of linear feedback shift registers in which a current state is a non-linear function of the previous state. The interest in …
Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic …
TW Cusick, Y Cheon - Information Sciences, 2014 - Elsevier
Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic …
It has been known since 1996 (work of Cai et al.) that the sequence of Hamming weights {wt (fn (x 1,…, xn))}, where fn is a symmetric Boolean function of degree d in n variables …
The covering radius of the third order Reed–Muller code of length 128 has been an open problem for many years. The best upper bound of it is known to be 22. In this paper, we give …
Abstract The Gowers U_3 U 3 norm of a Boolean function is a measure of its resistance to quadratic approximations. It is known that smaller the Gowers U_3 U 3 norm for a Boolean …
A Sárközy - Discrete Applied Mathematics, 2017 - Elsevier
In cryptography one needs large families of binary sequences with strong pseudorandom properties. In the last decades many families of this type have been constructed. However, in …