An Implementation of Efficient Pseudo-Random Functions

Michael Langberg

Naor and Reingold have recently introduced two new constructions of very efficient pseudo-random functions, proven to be as secure as the decisional version of the Diffie-Hellman assumption or the assumption that factoring is hard. In this site we define and exhibit an implementation of the construction which is based on the decisional Diffie-Hellman assumption.

Enjoy our Pseudo-Random Services:

Moni Naor
Omer Reingold
Michael Langberg