CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Splittable Pseudorandom Number Generators using Cryptographic Hashing

Koen Claessen (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Michal H. Palka (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers))
Proceedings of the Haskell Symposium 2013 p. 47-58. (2013)
[Konferensbidrag, refereegranskat]

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.

Nyckelord: splittable pseudorandom number generators, provable security, Haskell

Denna post skapades 2013-09-15. Senast ändrad 2014-03-28.
CPL Pubid: 183348


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)



Chalmers infrastruktur

Relaterade publikationer

Denna publikation ingår i:

Random Structured Test Data Generation for Black-Box Testing