On a finite pseudorandom binary sequences and their applications in cryptography

Rok, strany: 2007, 123 - 136

Finite pseudorandom binary sequences play a crucial role in cryptography. The pseudorandomness is usually characterized in terms of complexity theory. First the limitations of this approach will be analyzed. Then another, more constructive approach developed in the last decade by Mauduit, S'{a}rk"{o}zy and others will be described. Finally, constructions of large families of binary sequences with strong pseudorandom properties will be presented.

ISO 690:

Sárközy, A. 2007. On a finite pseudorandom binary sequences and their applications in cryptography. In Tatra Mountains Mathematical Publications, vol. 37, no.3, pp. 123-136. 1210-3195.

APA:

Sárközy, A. (2007). On a finite pseudorandom binary sequences and their applications in cryptography. Tatra Mountains Mathematical Publications, 37(3), 123-136. 1210-3195.