Academic
Publications
Number-theoretic Constructions of Efficient Pseudorandom Functions

Number-theoretic Constructions of Efficient Pseudorandom Functions,10.1109/SFCS.1997.646134,Moni Naor,Omer Reingold

Number-theoretic Constructions of Efficient Pseudorandom Functions   (Citations: 250)
BibTex | RIS | RefWorks Download
We describe efficient constructions for various cryptographic primitives (both in privatekeyand in public-key cryptography). We show these constructions to be at least as secure asthe decisional version of the Diffie-Hellman assumption or as the assumption that factoringis hard. Our major result is a new construction of pseudo-random functions such thatcomputing their value at any given point involves two multiple products. This is muchmore efficient than previous proposals. Furthermore,...
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: