Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Evolving Cryptographic Pseudorandom Number Generators (CROSBI ID 638812)

Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija

Picek, Stjepan ; Sisejkovic, Dominik ; Rozic, Vladimir ; Yang, Bohan ; Jakobović, Domagoj ; Mentens, Nele Evolving Cryptographic Pseudorandom Number Generators // Lecture Notes in Computer Science vol. 9921. Springer, 2016. str. 613-622

Podaci o odgovornosti

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

engleski

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.

Random number generators ; Pseudorandomness ; Cryptography ; Cartesian Genetic Programming ; Statistical tests

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

613-622.

2016.

objavljeno

Podaci o matičnoj publikaciji

Lecture Notes in Computer Science vol. 9921

Springer

978-3-319-45822-9

Podaci o skupu

Parallel Problem Solving from Nature

poster

17.09.2016-21.09.2016

Edinburgh, Ujedinjeno Kraljevstvo

Povezanost rada

Računarstvo