.png){kind=icon}
返回
Security problems for a pseudorandom sequence generator based on the Chen chaotic system
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cpc.2013.04.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Chaos
Cryptography
Pseudorandom number generator
Cryptanalysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
RNGSSELIB: Program library for random number generation, SSE2 realizationRNGSSELIB: 随机数生成程序库，SSE2实现
OAAI
OAAI分享收藏Hallucinogens as hard science: The adrenochrome hypothesis for the biogenesis of schizophrenia.
PREAI
分享收藏分享收藏
查看更多内容