Security problems for a pseudorandom sequence generator based on the Chen chaotic system

详细信息    查看全文

• 作者：Fatih Ö ; zkaynak^a ; ^{ozkaynak_fatih@hotmail.com} ; ^{ozkaynak@firat.edu.tr} ; S?rma Yavuz^b ; ^{sirma@ce.yildiz.edu.tr}
• 关键词：Chaos ; Cryptography ; Pseudorandom number generator ; Cryptanalysis
• 刊名：Computer Physics Communications
• 出版年：2013
• 出版时间：September, 2013
• 年：2013
• 卷：184
• 期：9
• 页码：2178-2181
• 全文大小：889 K

文摘

Recently, a novel pseudorandom number generator scheme based on the Chen chaotic system was proposed. In this study, we analyze the security weaknesses of the proposed generator. By applying a brute force attack on a reduced key space, we show that 66 % of the generated pseudorandom number sequences can be revealed. Executable C# code is given for the proposed attack. The computational complexity of this attack is O(n), where n is the sequence length. Both mathematical proofs and experimental results are presented to support the proposed attack.