In this article, we address the problem of generation of pseudo-random sequences using deterministic chaotic maps. Using a set of three deterministic chaotic maps, we propose an algorithm for generation of pseudo-random sequences. We establish that the sequences generated through the algorithm are random in accordance with the criteria prescribed by the NIST 800-22 Test suite. We also establish the independence of output sequences with the sequences generated by any of the generator maps. The results indicate that the output sequence exhibits sufficiently high degree of randomness when the perturbations are non-dissipative.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Randomness from Deterministic Chaos: A Novel Algorithm for Random Number Generation

  • Sajad Ahmad Mir,
  • Puneet Sharma

摘要

In this article, we address the problem of generation of pseudo-random sequences using deterministic chaotic maps. Using a set of three deterministic chaotic maps, we propose an algorithm for generation of pseudo-random sequences. We establish that the sequences generated through the algorithm are random in accordance with the criteria prescribed by the NIST 800-22 Test suite. We also establish the independence of output sequences with the sequences generated by any of the generator maps. The results indicate that the output sequence exhibits sufficiently high degree of randomness when the perturbations are non-dissipative.