Random sequence generation by cellular automata
Advances in Applied Mathematics
Efficient and portable combined Tausworthe random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Radix-b extensions to some common empirical tests for pseudorandom number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
On Random Numbers And The Performance Of Genetic Algorithms
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
An effective genetic algorithm for finding highly nonlinear Boolean Functions
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
A Cellular Automaton Based Fast One-Way Hash Function Suitable for Hardware Implementation
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
An improved key stream generator based on the programmable cellular automata
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Cryptanalysis of a Partially Known Cellular Automata Cryptosystem
IEEE Transactions on Computers
Block cipher based on reversible cellular automata
New Generation Computing - Evolutionary computation
Searching for resource-efficient programs: low-power pseudorandom number generators
Proceedings of the 10th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
Pseudorandom number generation is a key component of many Computer Science algorithms, including mathematical modeling, stochastic processes, Monte Carlo simulations, and most cryptographic primitives and protocols. To date, multiple approaches that use Evolutionary Computation (EC) techniques have been proposed for designing useful Pseudorandom Number Generators (PRNGs) for certain non-cryptographic applications. However, none of the proposals have been secure nor efficient enough to be of interest for the much more demanding crypto world. In this work, we present a general scheme, which uses Genetic Programming (GP), for the automatic design of crypto-quality PRNGs by evolving highly nonlinear and extremely efficient functions. A new PRNG named Lamar and obtained using this scheme is proposed, whose C code and preliminary security analysis are provided.