Verification of randomness on pseudo chaotic signals generated by digital system

摘要

The property of randomness on pseudo chaos generated by digital computers is analyzed using a statistical test called "Diehard". In this study, the relation between the parameter setting of the chaotic system, Kolmogonov Sinai entropy (KS entropy) of the system and the randomness of the generated signal is evaluated, and the availability of the pseudo chaos for the multiple communications and private communications is investigated.