On finite pseudorandom binary lattices

Abstract : 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.
Type de document :
Article dans une revue
Discrete Applied Mathematics, Elsevier, 2017, 216, pp.589 - 597. 〈10.1016/j.dam.2015.07.012〉
Liste complète des métadonnées

Contributeur : Aigle I2m <>
Soumis le : jeudi 31 août 2017 - 11:21:50
Dernière modification le : jeudi 18 janvier 2018 - 01:34:05

Lien texte intégral




Katalin Gyarmati, Christian Mauduit, András Sárközy. On finite pseudorandom binary lattices. Discrete Applied Mathematics, Elsevier, 2017, 216, pp.589 - 597. 〈10.1016/j.dam.2015.07.012〉. 〈hal-01579480〉



Consultations de la notice