Pseudorandom binary sequences play a crucial role in cryptography. The classical approach to pseudorandomness of binary sequences is based on computational complexity …
ZX Chen, XN Du, CH Wu - Journal of Computer Science and Technology, 2011 - Springer
The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sárközy and later extended to sequences of k symbols (or k-ary sequences). Certain …
K Gyarmati - Finite Fields and Their Applications: Character Sums …, 2013 - library.oapen.org
In the second half of the 1990s Christian Mauduit and András Sárközy [86] introduced a new quantitative theory of pseudorandomness of binary sequences. Since then numerous …
K Gyarmati, P Hubert, A Sárközy - J. Combin. Number …, 2010 - gyarmatikati.web.elte.hu
First the notion of r-almost s-uniform tree is introduced which includes both the case of finitely generated free groups and uniform binary trees as special cases. The goal of the …
KH Mak - Monatshefte für Mathematik, 2015 - Springer
We define the pseudorandom lattice of kk symbols, and present some new constructions of families of such lattices, which generalize several previous constructions for the …
X Du, Z Lin - Applicable Algebra in Engineering, Communication …, 2014 - Springer
A family of pseudorandom sequences of kk symbols are constructed by using finite fields of prime-power order. The construction is an extension of certain construction of Sárközy and …