Efficient Composited de Bruijn Sequence Generators.

IEEE Transactions on Computers(2017)

引用 19|浏览43
暂无评分
摘要
A binary de Bruijn sequence with period 2n is a sequence in which every tuple of n bits occurs exactly once. De Bruijn sequence generators have randomness properties that make them attractive for pseudorandom number generators and as building blocks for stream ciphers. Unfortunately, it is very difficult to find de Bruijn sequence generators with long periods (e.g., 2128) and most known de Bruijn ...
更多
查看译文
关键词
Generators,Shift registers,Complexity theory,Ciphers,Hardware,Indexes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要