Rigorous time/space trade-offs for inverting functions

SIAM Journal on Computing

Volumn 29, Issue 3, 2000, Pages 790-803

  Fiat, Amos ^a   Naor, Moni ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Cryptanalysis; Cryptography; Hashing data encryption standard; One way functions; Random graphs; Randomized algorithms

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; GRAPH THEORY; PROBABILITY; PROBLEM SOLVING;

CRYPTANALYSIS; HASHING DATA ENCRYPTION STANDARD; ONE WAY FUNCTIONS; RANDOM GRAPHS; RANDOMIZED ALGORITHMS;

FUNCTIONS;

EID: 0033294770     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795280512     Document Type: Article

References (20)

1. A. AHO, J. HOPCROFT, AND J. D. ULLMAN, Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A. AHO AND D. LEE, Storing a dynamic sparse table, in Proceedings 27th IEEE Symposium on Foundations of Computer Science, Chicago, 1986, pp. 55-60.
3. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized algorithm for the maximal independent set problem, J. Algorithms, 7 (1987), pp. 567-583.
4. N. ALON AND J. SPENCER, The Probabilistic Method, John Wiley, New York, 1992.
5. H. R. AMIRAZIZI AND M. E. HELLMAN, Time-memory-processor trade-off, IEEE Trans. Inform. Theory, 34 (1988), pp. 505-512.
6. J. L. CARTER AND M. N. WEGMAN, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp. 143-154.
7. B. CHOR AND O. GOLDREICH, On the power of two-point based sampling, J. Complexity, 5 (1989), pp. 96-106.
8. B. CHOR, O. GOLDREICH, J. HASTAD, J. FRIEDMAN, S. RUDICH, AND R. SMOLENSKY, The bit extraction problem or t-resilient functions, in Proceedings 26th IEEE Symposium on Foundations of Computer Science, Portland, OR, 1985, pp. 396-407.
9. M. DIETZFELBINGER, A. KARLIN, K. MEHLHORN, F. MEYER AUF DER HEIDE, H. ROHNERT, AND R. E. TARJAN, Dynamic perfect hashing: Upper and lower bounds, SIAM J. Comput., 23 (1994), pp. 738-761.
10. A. FIAT, S. MOSES, A. SHAMIR, I. SHIMSHONI, AND G. TARDOS, Planning and learning in permutation groups, in Proceedings 30th IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, pp. 274-279.
11. M. L. FREDMAN, J. KOMLÓS, AND E. SZEMERÉDI, Storing a sparse table with O(1) worst case access time, J. ACM, 31 (1984), pp. 538-544.
12. M. E. HELLMAN, A cryptanalytic time memory trade-off, IEEE Trans. Inform. Theory, 26 (1980), pp. 401-406.
13. M. E. HELLMAN AND J. M. REYNERI, Drainage and the DES, summary, in Advances in Cryptology-Proceedings of Crypto '82, Plenum Press, New York, 1982, pp. 129-131.
14. M. LUBY, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053.
15. R. C. MERKLE AND M. E. HELLMAN, Hiding information and signatures in trapdoor functions, IEEE Trans. Inform. Theory, 24 (1978), pp. 525-530.
16. S. C. POHLIG AND M. E. HELLMAN, An improved algorithm for computing logarithms over GF[p] and its cryptographic significance, IEEE Trans. Inform. Theory, 24 (1978), pp. 106-110.
17. n/4) algorithm for certain NP-complete problems, SIAM J. Comput., 10 (1981), pp. 456-464.
18. A. SHAMIR AND J. SPENCER, manuscript.
19. A. SIEGEL, On universal classes of fast high performance hash functions, their time-space tradeoff and their applications, in Proceedings 30th IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, pp. 20-25.
20. A. C. YAO, Coherent functions and program checkers, in Proc. 22nd ACM Symposium on Theory of Computing, New York, 1990, pp. 84-94.