Sie verwenden einen Browser, in dem JavaScript deaktiviert ist. Dadurch wird verhindert, dass Sie die volle Funktionalität dieser Webseite nutzen können. Zur Navigation müssen Sie daher die Sitemap nutzen.

You are currently using a browser with deactivated JavaScript. There you can't use all the features of this website. In order to navigate the site, please use the Sitemap .

Evolving Cryptographic Pseudorandom Number Generators

Authors:: Picek, S. , Šišejković, D. , Rozic, V. , Yang, B. , Jakobović, D. , Mentens, N.
Journal:: Parallel Problem Solving from Nature (PPSN)
Publisher:: Springer International Publishing
Page(s):: 613--622
Date:: 2016
DOI:: 978-3-319-45823-6_57
Language:: English
Abstract:: 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.
Download:: BibTeX