Number-theoretic constructions of efficient pseudo-random functions.

We describe efficient constructions for various cryptographic primitives in private-key as well as public-key cryptography. Our main results are two new constructions of pseudo-random functions. We prove the pseudo-randomness of one construction under the assumption that factoring (Blum integers) is...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the ACM 51, 2 (2004).
1. Verfasser:	Naor, Moni
Format:	Artikel
Sprache:	English
Schlagworte:	Data. Data encryption. Theory of computation. Computation by abstract devices. Complexity measures and classes. Analysis of algorithms and problem complexity. Mathematics of computing. Probability and statistics. Mathematical software. Algorithms. Security. Theory.