Splittable pseudorandom number generators using cryptographic hashing
Artikel i övriga tidskrifter, 2013

We propose a new splittable pseudorandom number generator (PRNG) based on a cryptographic hash function. Splittable PRNGs, in contrast to linear PRNGs, allow the creation of two (seemingly) independent generators from a given random number generator. Splittable PRNGs are very useful for structuring purely functional programs, as they avoid the need for threading around state. We show that the currently known and used splittable PRNGs are either not efficient enough, have inherent flaws, or lack formal arguments about their randomness. In contrast, our proposed generator can be implemented efficiently, and comes with a formal statements and proofs that quantify how 'random' the results are that are generated. The provided proofs give strong randomness guarantees under assumptions commonly made in cryptography.

splittable pseudorandom number generators

provable security

Haskell

Författare

Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik

Michal Palka

Chalmers, Data- och informationsteknik, Programvaruteknik

ACM SIGPLAN Notices

1523-2867 (ISSN)

Vol. 48 12 47-58

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1145/2578854.2503784

Mer information

Skapat

2017-10-08