Efficient Evolution of High Entropy RNGs Using Single Node Genetic Programming
Pages 1071 - 1078
Abstract
Random Number Generators are an important aspect of many modern day software systems, cryptographic protocols and modelling techniques. To be more accurate, it is Pseudo Random Number Generators (PRNGs) that are more commonly used over their expensive, and less practical hardware based counterparts. Given that PRNGs rely on some deterministic algorithm (typically a Linear Congruential Generator) we can leverage Shannon's theory of information as our fitness function in order to generate these algorithms by evolutionary means. In this paper we compare traditional Genetic Programming (GP) against its graph based implementation, Single Node Genetic Programming (SNGP), for this task. We show that with SNGPs unique program structure and use of dynamic programming, it is possible to obtain smaller, higher entropy PRNGs, over six times faster and produced at a solution rate twice that achieved using Koza's standard GP model. We also show that the PRNGs obtained from evolutionary methods produce higher entropy outputs than other widely used PRNGs and Hardware RNGs (specifically recordings of atmospheric noise), as well as surpassing them in a variety of other statistical tests presented in the NIST RNG test suite.
References
[1]
A. D. Baddeley. The capacity for generating information by randomization. Quarterly Journal of Experimental Psychology, 18(2):119--129, 1966. 5935121.
[2]
Lenore Blum, Manuel Blum, and Mike Shub. A simple unpredictable pseudo-random number generator. SIAM Journal on computing, 15(2):364--383, 1986.
[3]
Leo Dorrendorf, Zvi Gutterman, and Benny Pinkas. Cryptanalysis of the random number generator of the windows operating system. ACM Transactions on Information and System Security (TISSEC), 13(1):10, 2009.
[4]
Antony Eagle. Randomness is unpredictability. The British Journal for the Philosophy of Science, 56(4):749--790, 2005.
[5]
Andrew Rukhin et al. A statistical test suite for random and pseudorandom number generators for cryptographic applications, 2001.
[6]
Robert M. Gray. Entropy and Information Theory. Springer-Verlag New York, Inc., New York, NY, USA, 1990.
[7]
M Haahr. Random.org - true random number service. {online} random.org. Available at: http://www.random.org {Accessed 27th March 2015}.
[8]
Haldir{RET}. How to crack a linear congruential generator. Reverse Engineering Team, Available at: http://www.reteam.org/papers/e59.pdf {Accessed 27th March 2015}, 2004.
[9]
J.C. Hernandez, A. Seznec, and P. Isasi. On the design of state-of-the-art pseudorandom number generators by means of genetic programming. In Evolutionary Computation, 2004. CEC2004. Congress on, volume 2, pages 1510--1516 Vol.2, June 2004.
[10]
David Jackson. A new, node-focused model for genetic programming. In Alberto Moraglio, Sara Silva, Krzysztof Krawiec, Penousal Machado, and Carlos Cotta, editors, Genetic Programming, volume 7244 of Lecture Notes in Computer Science, pages 49--60. Springer Berlin Heidelberg, 2012.
[11]
David Jackson. Single node genetic programming on problems with side effects. In Parallel Problem Solving from Nature-PPSN XII, pages 327--336. Springer, 2012.
[12]
John Kelsey, Bruce Schneier, David Wagner, and Chris Hall. Cryptanalytic attacks on pseudorandom number generators. In Fast Software Encryption, pages 168--188. Springer, 1998.
[13]
D. Knuth, J. Morris, Jr., and V. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323--350, 1977.
[14]
Donald Ervin Knuth. The art of computer programming: sorting and searching, volume 2, Seminumerical Algorithms. Pearson Education, 1998.
[15]
John R. Koza. Evolving a computer program to generate random numbers using the genetic programming paradigm. In ICGA, pages 37--44. 1991.
[16]
Carlos Lamenca-Martinez, Julio Cesar Hernandez-Castro, Juan M Estevez-Tapiador, and Arturo Ribagorda. Lamar: A new pseudorandom number generator evolved by means of genetic programming. In Parallel Problem Solving from Nature-PPSN IX, pages 850--859. Springer, 2006.
[17]
Makoto Matsumoto and Takuji Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation (TOMACS), 8(1):3--30, 1998.
[18]
Riccardo Poli, William B. Langdon, and Nicholas Freitag McPhee. A field guide to genetic programming. Published viatexttthttp://lulu.com and freely available attexttthttp://www.gp-field-guide.org.uk, 2008. (With contributions by J. R. Koza).
[19]
James Reeds. Cracking a random number generator. Cryptologia, 1(1):20--26, 1977.
[20]
C. E. Shannon. A mathematical theory of communication. SIGMOBILE Mob. Comput. Commun. Rev., 5(1):3--55, January 2001.
[21]
Thomas Symul, SM Assad, and Ping K Lam. Real time demonstration of high bitrate quantum random number generation with coherent laser light. Applied Physics Letters, 98(23):231103, 2011.
[22]
Stephen Wolfram. Random sequence generation by cellular automata. Advances in applied mathematics, 7(2):123--169, 1986.
Index Terms
- Efficient Evolution of High Entropy RNGs Using Single Node Genetic Programming
Recommendations
An Improved Single Node Genetic Programming for Symbolic Regression
IJCCI 2015: Proceedings of the 7th International Joint Conference on Computational IntelligenceThis paper presents a first step of our research on designing an effective and efficient GP-based method for
solving the symbolic regression. We have proposed three extensions of the standard Single Node GP, namely
(1) a selection strategy for choosing ...
Pseudo Random Bit Generator using Logistic and Bernoulli Maps
ICTCS '16: Proceedings of the Second International Conference on Information and Communication Technology for Competitive StrategiesWe propose pseudo random bit generator(PRBG) by constructing an ergodic orbit of logistic map generated using intermittent perturbation and sampling the orbit using Bernoulli shift map. The pseudo randomness of the key streams is tested with the ...
A Random Number Generator Based on Electronic Noise and the Xorshift Algorithm
ICNCC '18: Proceedings of the 2018 VII International Conference on Network, Communication and ComputingThis paper introduces a random number generator (RNG) based on the avalanche noise of two diodes. A true random number generator (TRNG) generates true random numbers with the use of the electronic noise produced by two avalanche diodes. The amplified ...
Comments
Information & Contributors
Information
Published In
July 2015
1496 pages
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 July 2015
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GECCO '15
Sponsor:
Acceptance Rates
GECCO '15 Paper Acceptance Rate 182 of 505 submissions, 36%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 104Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in