Using Deterministic Genetic Algorithm to Provide Secured Cryptographic Pseudorandom Number Generators Volume 1, Issue 4 Published online: 05 December 2015
Article Views: 32
AbstractThis research shows a method of providing Pseudorandom Number Generator (PRNG) without the properties of periodicity and predictability, i.e., secured cryptographic PRNG, by using a deterministic genetic algorithm. PRNGs are so important in cryptography. Their main advantages of PRNGs are speed, efficiency, and reproducibility. This article studies the properties of uniformity, randomness, and independence between two sequences of random numbers. The first sequence is generated by using a traditional pseudorandom number generator (PRNG). In contrast, the second one is generated with the help of a cryptographic pseudorandom number generator, which is modified by a genetic algorithm (GA). This work shows the graphical and statistical tests: frequency test, runs test, Autocorrelation test, and entropy. The tests are performed and implemented with the help of three programs: MATLAB, Minitab, and IBM SPSS Statistics. This statistical study has shown that the proposed deterministic GA improves the random numbers generated by conventional PRNG, i.e., it provides secured cryptographic pseudorandom number generators. Reference
To Cite this articleA. H, Alhussain, “Using deterministic genetic algorithm to provide secured cryptographic pseudorandom number generators,‖ International Journal of Technology and Engineering Studies, vol. 1, no. 4, pp. 107-116, 2015. |