On finite pseudorandom binary lattices - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2017

On finite pseudorandom binary lattices

Résumé

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 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.

Dates et versions

hal-01579480 , version 1 (31-08-2017)

Identifiants

Citer

Katalin Gyarmati, Christian Mauduit, András Sárközy. On finite pseudorandom binary lattices. Discrete Applied Mathematics, 2017, 216, pp.589 - 597. ⟨10.1016/j.dam.2015.07.012⟩. ⟨hal-01579480⟩
59 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More