Moni Naor Weizmann Institute of Science Rehovot 76100, Israel....  Home/Search
Context Related
| iacr.org/2001/075.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 lengthpreserving 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... (Update)
Context of citations to this paper: More
.... to Naor and Reingold [NR97] and is based on the decisional Diffie Hellman (DDH) assumption (for related construction based on factoring, see [NRR00] This assumption in some group G of prime order q states that given elements g, g and g of (where g is the generator of G ) it...
Cited by: More
Efficient Construction of (Distributed) Verifiable Random Functions - Dodis (2002) (Correct)
Similar documents (at the sentence level):
62.7%: Pseudo-Random Functions and Factoring - Naor, Reingold, Rosen (2000) (Correct)
Active bibliography (related documents): More All
0.2: Number-Theoretic Constructions of Efficient Pseudo-Random.. - Naor, Reingold (1997) (Correct)
0.1: Provably Authenticated Group Diffie-Hellman Key Exchange - Bresson, Chevassut.. (Correct)
0.1: On the Security of Modular Exponentiation with Application.. - Goldreich, Rosen (2000) (Correct)
Similar documents based on text: More All
0.4: Synthesizers and Their Application to the Parallel.. - Naor, Reingold (1995) (Correct)
0.3: On the Construction of Pseudo-Random Permutations.. - Naor, Reingold (1997) (Correct)
0.3: From Unpredictability to Indistinguishability: A Simple.. - Naor, Reingold (1998) (Correct)
Related documents from co-citation: More All
2: Provably authenticated group diffiehellman key exchange --- the dynamic case - Bresson, Chevassut et al.
BibTeX entry: (Update)
Moni Naor, Omer Reingold, and Alom Rosen. Pseudo-random functions and factoring. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pages 11--20, Portland, Oregon, 21--23 May 2000. http://citeseer.ist.psu.edu/naor01pseudorandom.html More
@article{ naor01pseudorandom,
author = "Moni Naor and Omer Reingold and Alon Rosen",
title = "Pseudo-Random Functions and Factoring",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
volume = "8",
number = "064",
year = "2001",
url = "citeseer.ist.psu.edu/naor01pseudorandom.html" }
Citations (may not include all citations):334 How to generate cryptographically strong sequence of pseudo-.. (context) - Blum, Micali - 1984
63 An Efficient Probabilistic Public-key Encryption Scheme Whic.. (context) - Blum, Goldwasser - 1985
62 RSA and Rabin functions: certain parts are as hard as the wh.. (context) - Alexi, Chor et al. - 1988
40 The decision Diffie-Hellman problem - Boneh - 1998
19 Provable security of cryptosystems:A survey (context) - Angluin, Lichtenstein - 1983
12 A Simple Secure Unpredictable Pseudo-Random Number Generator (context) - Blum, Blum et al. - 1984
10 Breaking generalized Diffie-Hellman modulo a composite is no.. - Biham, Boneh et al. - 1999
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC