next up previous
Next: Finding the Shortest Move-Sequence Up: The Post-Doctoral Period (1983-86) Previous: The Post-Doctoral Period (1983-86)

How to Construct Random Functions

This work extends the theory of pseudorandomness to functions. A collection of functions is called pseudorandom if it is infeasible to distinguish the case one is given oracle access to a function chosen uniformly in the collection from the case one is given oracle access to a truely random function. It is shown how to construct collections of pseudorandom functions from any pseudorandom generator.


\fbox{\begin{minipage}{40em}
{\bf Abstract ({rev.}):} {A constructive theory of...
...n cryptography, random coinstructions, and complexity theory.}
\end{minipage}}


Comments: Authored by O. Goldreich, S. Goldwasser and S. Micali. Appeared in



Oded Goldreich
2003-07-30