An Implementation of Efficient Pseudo-Random Functions

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