On finite pseudorandom binary lattices

Gyarmati, Katalin and Mauduit, Christian and Sárközy, András (2014) On finite pseudorandom binary lattices. DISCRETE APPLIED MATHEMATICS. ISSN 0166-218X (Submitted)


Download (177kB) | Preview


Pseudorandom binary sequences play a crucial role in cryptography. The classical approach to pseudorandomness of binary sequences is based on computational complexity. This approach has certain weak points thus in the last two decades years a new, more constructive and quantitative approach has been developed. Since multidimensional analogs of binary sequences (called binary lattices) also have important applications thus it is a natural idea to extend this new approach to the multidimensional case. This extension started with a paper published in 2006, and since that about 25 papers have been written on this subject. Here our goal is to present a survey of all these papers.

Item Type: Article
Subjects: Q Science / természettudomány > QA Mathematics / matematika > QA71 Number theory / számelmélet
Depositing User: Katalin Gyarmati
Date Deposited: 20 Sep 2014 15:36
Last Modified: 20 Sep 2014 15:36

Actions (login required)

Edit Item Edit Item