Evolving Cryptographic Pseudorandom Number Generators
نویسندگان
چکیده
Random number generators (RNGs) play an important role in many real-world applications. Besides true hardware RNGs, one important class are deterministic random number generators. Such generators do not possess the unpredictability of true RNGs, but still have a widespread usage. For a deterministic RNG to be used in cryptography, it needs to fulfill a number of conditions related to the speed, the security, and the ease of implementation. In this paper, we investigate how to evolve deterministic RNGs with Cartesian Genetic Programming. Our results show that such evolved generators easily pass all randomness tests and are extremely fast/small in hardware.
منابع مشابه
Analysis, demands, and properties of pseudorandom number generators
The goal of this paper is to create a comprehensive overview of demands of common cryptographic schemes (e.g., various cryptosystems, cryptographic protocols, or authentication mechanisms) on random or pseudorandom number generation, including the analysis of properties of common pseudorandom number generators (PRNGs).
متن کاملA Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material. Generators suitable for use in cryptographic applications may need to meet stronger requirements than for other applications. In particular, their outputs must be unpredictable...
متن کاملSecurity Frameworks for Pseudorandom Number Generators
In the cryptographic system a pseudorandom number generator is one of the basic primitives. We survey theoretically secure pseudorandom bit generators which are provably secure under certain reasonable number theoretic assumptions and some practical pseudorandom number generators based on assumptions about symmetric crypto-primitives. Recently, there was a noticeable result for the concrete sec...
متن کاملCryptanalysis of LFSR-based Pseudorandom Generators - a Survey
Pseudorandom generators based on linear feedback shift registers (LFSR) are a traditional building block for cryptographic stream ciphers. In this report, we review the general idea for such generators, as well as the most important techniques of cryptanalysis.
متن کاملUniversal Test for Quantum One-Way Permutations
The next bit test was introduced by Blum and Micali and proved by Yao to be a universal test for cryptographic pseudorandom generators. On the other hand, no universal test for the cryptographic onewayness of functions (or permutations) is known, though the existence of cryptographic pseudorandom generators is equivalent to that of cryptographic one-way functions. In the quantum computation mod...
متن کامل