摘要
在许多密码系统中,伪随机序列生成器是系统安全的一个重要组成部分。作者在文中主要研究了一类伪随机序列生成器DRG(DynamicRandomNumberGenerator)的线性复杂度的上界,并给出了一种达到其上界的DRG的构造方法。
In many cipher system, the pseudo random sequence generator is an important part in system security. This dissertation mainly researches on the upper bound of linear complexity of DRG (Dynamic Random Number Generator), and provides a kind of structure method of DRG that linear complexity is up to the upper bound.
出处
《陕西科技大学学报（自然科学版）》
2004年第6期62-65,共4页
Journal of Shaanxi University of Science & Technology
