期刊名称：International Journal of Security and Its Applications
印刷版ISSN：1738-9976
出版年度：2016
卷号：10
期号：11
页码：109
出版社：SERSC
摘要：The random numbers are needed in variety fields of applications in particular cryptography. They can be constructed by using several methods such as cellular Automata (CA). This later cannot produce a long random numbers sequence, supplementary the quality of random numbers depends especially on applied CA rules. For this reason, the modified binary particle swarm optimization (MBPSO) is used to discover a new rules set for CA. Rules of radius r=1 and periodic boundary conditions are considered for a non-uniform one-dimensional CA. Our contribution consists to combine this CA with MBPSO for satisfying the pseudo random number generator (PRNG) characteristics, called "PSOCA". Thus, different tests were applied to our PSOCA algorithm to prove its generated sequences quality, such as Diehard, Nist and other statistical tests, which have been successfully passed. Moreover, the comparison with other systems ensure the highlight randomness quality of our proposal system.
