Napredna pretraga

Pregled bibliografske jedinice broj: 831962

Evolving Cryptographic Pseudorandom Number Generators


Picek, Stjepan; Sisejkovic, Dominik; Rozic, Vladimir; Yang, Bohan; Jakobović, Domagoj; Mentens, Nele
Evolving Cryptographic Pseudorandom Number Generators // Lecture Notes in Computer Science vol. 9921
Edinburgh, Škotska: Springer, 2016. str. 613-622 (poster, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


Naslov
Evolving Cryptographic Pseudorandom Number Generators

Autori
Picek, Stjepan ; Sisejkovic, Dominik ; Rozic, Vladimir ; Yang, Bohan ; Jakobović, Domagoj ; Mentens, Nele

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Lecture Notes in Computer Science vol. 9921 / - : Springer, 2016, 613-622

ISBN
978-3-319-45822-9

Skup
Parallel Problem Solving from Nature

Mjesto i datum
Edinburgh, Škotska, 17-21.09.2016

Vrsta sudjelovanja
Poster

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Random number generators ; Pseudorandomness ; Cryptography ; Cartesian Genetic Programming ; Statistical tests

Sažetak
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.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA


Ustanove
Fakultet elektrotehnike i računarstva, Zagreb