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.
- Full detail on implementation and security :
HTML, Postscript.
- M. Naor and O. Reingold, Number-Theoretic constructions of efficient
pseudo-random functions, Extended abstract in: Proc. 38th IEEE Symp. on
Foundations of Computer Science, 1997, pp. 458-467
Abstract ,
Postscript,
gzipped Postscript .
Enjoy our Pseudo-Random Services:
Moni Naor
Omer Reingold
Michael Langberg