(Enter summary)
Abstract: We provide rigorous time/space tradeoffs for inverting any function. Given a function f , we
give a time/space tradeoff of TS
q(f ), where q(f) is the probability that two random
elements (taken with replacement) are mapped to the same image under f . We also give a
more general tradeoff, TS
, that can invert any function at any point. (Update)
Context of citations to this paper: More
...be tiny. A more sophisticated construction permits evaluating F ( with a much smaller number of applications of F ( as follows [11, 8]. For j = 1: l, S would precompute m pairs (x; h j (x) where h j (x) g j (F (x) and each g j ( is an auxiliary function. The integers...
Cited by: More
Parallel Collision Search with Cryptanalytic Applications - van Oorschot, Wiener (1996)
(Correct)
On Memory-Bound Functions for Fighting Spam - Dwork, Goldberg, Naor (2003)
(Correct)
Moderately Hard, Memory-bound Functions - Abadi, Burrows, Manasse, Wobber (2003)
(Correct)
Similar documents (at the sentence level):
40.8%: Rigorous Time/Space Tradeoffs for Inverting Functions - Fiat, Naor (2000)
(Correct)
Active bibliography (related documents): More All
0.2: Checking the Correctness of Memories - Blum, Evans, Gemmell, Kannan, Naor (1995)
(Correct)
0.2: Improving Implementable Meet-in-the-Middle Attacks by.. - van Oorschot, Wiener (1996)
(Correct)
0.1: Using Tadpoles to Reduce Memory and Communication.. - Cooperman, Tselman (1997)
(Correct)
Similar documents based on text: More All
0.5: Broadcast Encryption - Fiat, Naor (1994)
(Correct)
0.4: Synthesizers and Their Application to the Parallel.. - Naor, Reingold (1995)
(Correct)
0.4: Universal One-Way Hash Functions and their Cryptographic.. - Naor, Yung (1989)
(Correct)
Related documents from co-citation: More All
4: Private communication (context) - Abadi - 1992
3: A cryptanalytic time--memory trade-off (context) - Hellman - 1980
3: Exhaustive Cryptanalysis of the NBS Data Encryption Standard (context) - Diffie, Hellman - 1977
BibTeX entry: (Update)
A. Fiat and M. Naor. Rigorous time/space trade-offs for inverting functions. SIAM Journal on Computing, 29(3):790--803, June 2000. http://citeseer.ist.psu.edu/524362.html More
@inproceedings{ fiat91rigorous,
author = "Amos Fiat and Moni Naor",
title = "Rigorous time/space tradeoffs for inverting functions",
pages = "534--541",
year = "1991",
url = "citeseer.ist.psu.edu/524362.html" }
Citations (may not include all citations):
1450
Design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
957
The Probabilistic Method (context) - Alon, Spencer - 1992
358
Universal classes of hash functions (context) - Carter, Wegman - 1979
199
A simple parallel algorithm for the maximal independent set (context) - Luby - 1986
168
An improved algorithm for computing logarithms over GF [p] a.. (context) - Pohlig, Hellman - 1978
148
Storing a Sparse Table with O (context) - Fredman, Koml'os et al. - 1984
81
The bit extraction problem or t-resilient functions
- Chor, Goldreich et al. - 1985
70
the power of two-point based sampling
- Chor, Goldreich - 1989
44
On universal classes of fast high performance hash functions (context) - Siegel - 1989
24
A cryptanalytic time memory trade-off (context) - Hellman - 1980
20
A fast and simple randomized algorithm for the maximal indep.. (context) - Alon, Babai et al. - 1987
12
algorithm for certain NP- complete problems (context) - Schroepel, Shamir - 1981
8
Storing a dynamic sparse table (context) - Aho, Lee - 1986
6
Time-memory-processor trade-off (context) - Amirazizi, Hellman - 1988
4
and program checkers. Proc. 22nd ACM Symposium on Theory of .. (context) - Coherent - 1990
2
Advances in Cryptology - Proceedings of Crypto (context) - Hellman, Reyneri et al.
2
Meyer auf der Heide and R (context) - Dietzfelbinger, Karlin et al. - 1994
2
Hiding information and signatures in trapdoor functions (context) - Merkle, Hellman - 1978
2
th IEEE Symposium on Foundations of Computer Science (context) - Fiat, Moses et al. - 1989
Documents on the same site (http://www.wisdom.weizmann.ac.il/~naor/onpub.html): More
Deniable Encryption - Canetti, Dwork, Naor, Ostrovsky (1996)
(Correct)
Certificate Revocation and Certificate Update - Naor, Nissim (1998)
(Correct)
Verification of a human in the loop or Identification via the.. - Naor (1996)
(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