Pseudo-Random Functions and Factoring

Moni Naor, Omer Reingold and Alon Rosen

Abstract:

Factoring integers is the most established problem on which cryptographic primitives are based. This work presents an efficient construction of pseudorandom functions whose security is based on the intractability of factoring. In particular, we are able to construct efficient length-preserving pseudorandom functions where each evaluation requires only a constant number of modular multiplications per output bit. This is substantially more efficient than any previous construction of pseudorandom functions based on factoring, and matches (up to a constant factor) the efficiency of the best known factoring-based pseudorandom bit generators.

Postscript, gzipped Postscript.

Back Home