基于素数的混沌伪随机数发生器的安全性分析  

Cryptanalysis of a class of chaos-based pseudo-random number generator

作　　者：谢邦勇[1] 王德石[1] 蒋兴舟[1] 

机构地区：[1]海军工程大学兵器工程系,武汉430033

出　　处：《海军工程大学学报》2007年第6期17-20,70,共5页Journal of Naval University of Engineering

基　　金：国家自然科学基金资助项目(10272113)

摘　　要：分析了一类基于素数的混沌伪随机数发生器的安全性问题。分析表明,此类混沌伪随机数发生器的输出不是密码学安全的伪随机序列,在截获不长的一段序列的基础上即可很容易地恢复此类PRNGs的全部密鈅。虽然基于素数的方法在改善混沌序列相关性能、周期长度等方面具有一定的优势,但是却不能增加序列的不可预测性,这就限制了此类混沌伪随机数发生器在诸多应用领域中的应用前景。In order to overcome the shortcomings such as short period, existing weak keys of chaos- based pseudo-random number generators realized under finite computing precision, and the current lit- erature proposed a class of prime number based method. The fundamental weakness of this class of PRNGs was pointed out and a successful attack was described. Given a piece of sequence produced by such kind of generators, we can completely recover the whole secret keys of the PRNGs, so this class of PRNGs is not cryptographically secure. Both theoretical and experimental results show that al- though the prime number-based method can improve the performance of correlation and enlarge the period of the chaotic sequence, but the generated chaotic sequence is completely predictable without knowing the secret keys. The lack of security discourages the use of such class of PRNGs for practical application.

关 键 词：混沌 伪随机数发生器 密码分析 

分 类 号：TN914.4[电子电信—通信与信息系统] TN918[电子电信—信息与通信工程]