On the Security of Chaos Based "True" Random Number Generators
On the Security of Chaos Based "True" Random Number Generators
复制标题
DOI：
10.1587/transfun.e99.a.363
复制
发表时间：
2016-01-01
影响因子：
0.5
通讯作者：
Ergun, Salih
中科院分区：
文献类型：
--
作者：
Ergun, Salih
本文讨论基于混沌的“真”随机数生成器 (RNG) 的安全性。提出了一种攻击方法来分析基于混沌的 RNG 的安全弱点，并使用主从同步方案证明了其收敛性。还以对基于双滚动吸引子的 RNG 的攻击作为示例。 RNG 的所有秘密参数都被揭示，唯一可用的信息是 RNG 的结构和从双滚动吸引子观察到的标量时间序列。给出了所提出的攻击方法的仿真和数值结果，使得RNG不满足NIST-800-22统计测试套件，不仅可以再现下一个比特，而且可以再现RNG的相同输出比特流。
This paper deals with the security of chaos-based "true" random number generators (RNG)s. An attack method is proposed to analyze the security weaknesses of chaos-based RNGs and its convergence is proved using a master slave synchronization scheme. Attack on a RNG based on a double-scroll attractor is also presented as an example. All secret parameters of the RNG are revealed where the only information available is the structure of the RNG and a scalar time series observed from the double-scroll attractor. Simulation and numerical results of the proposed attack method are given such that the RNG doesn't fulfill NIST-800-22 statistical test suite, not only the next bit but also the same output bit stream of the RNG can be reproduced.