On finite pseudorandom binary lattices

详细信息    查看全文

• 作者：Katalin Gyarmati^a ; ^{gykati@cs.elte.hu} ; Christian Mauduit^b ; ^{mauduit@iml.univ-mrs.fr} ; Andrá ; s Sá ; rk&ouml ; zy^a ; ^{sarkozy@cs.elte.hu}
• 关键词：Binary lattice ; Pseudorandomness ; Linear complexity ; Families of lattices
• 刊名：Discrete Applied Mathematics
• 出版年：2017
• 出版时间：10 January 2017
• 年：2017
• 卷：216
• 期：part_P3
• 页码：589-597
• 全文大小：454 K
• 卷排序：216

文摘

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.