Using Deterministic Genetic Algorithm to Provide Secured Cryptographic Pseudorandom Number Generators



Volume 1, Issue 4
AMANIE HASN ALHUSSAIN

Published online: 05 December 2015
Article Views: 32

Abstract

This 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

  1. C. Kenny and K. Mosurski, Distributed Systems Group-Random Number Generators: An Evaluation and Comparison of Random. org and Some Commonly Used Generators. Trinity College Dublin, 2005.
  2. H. Al-Hussain and V. L. Stefanuk, “Improvement of randomness level of pseudorandom number generators in cryptography,” in 2nd International Scientific Conference on Theoretical and Applied Sciences, pp. 172-177. US, Cibunet Publishing, New York, USA, 2015.
  3. H. Al-Hussain and V. L. Stefanuk, “Using Genetic Algorithm to improve periodic level of pseudorandom number generators,” in 1st European Conference on Informational Technology and Computer Science: East West, pp. 25-34, Vienna, Austria, 2015.
  4. H. Al-Hussain and V. L. Stefanuk, ―Using deterministic genetic algorithm to increase the security level of XOR encryption,‖ Priorities of world science: experiment and scientific discussion.‖ In Proceedings of the VIII International Scientific Conference: Create Space, pp. 15-18, 17-18 of June – South Carolina , North Charleston , United States, 2015
  5. “Statistics How to Statistics for the Rest of Us.” https://www.statisticshowto.com/how-to-compute-pearsons-correlation-coefficients/

To Cite this article

A. 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.