Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions

@inproceedings{Naor1995SynthesizersAT,
  title={Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions},
  author={Moni Naor and Omer Reingold},
  booktitle={FOCS},
  year={1995}
}
A pseudo-random function is a fundamental cryptographic primitive that is essential for encryption, identi cation and authentication. We present a new cryptographic primitive called pseudorandom synthesizer and show how to use it in order to get a parallel construction of a pseudo-random function. We show several NC 1 implementations of synthesizers based on concrete intractability assumptions as factoring and the Di e-Hellman assumption. This yields the rst parallel pseudorandom functions… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS
18 Citations
52 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 52 references

New directions in cryptography

  • W. Di e, M. Hellman
  • IEEE Trans. Inform. Theory,
  • 1976
Highly Influential
20 Excerpts

Algorithms for Black-Box elds and their application to cryptography, Ad- vances in Cryptology

  • D. Boneh, R. Lipton
  • CRYPTO '96, LNCS,
  • 1996
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…