Rigorous Time/Space Trade-offs for Inverting Functions
Abstract
We provide rigorous time/space trade-offs for inverting any function. Given a function f, we give a time/space trade-off of T S2 = N3q (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 trade-off, T S3 = N3, that can invert any function at any point.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
A. Aho, Dž. Hopkroft, Dž. Ul’man, Postroenie i analiz vychislitelnykh algoritmov, “Mir”, 1979, 536–0, Translated by A. O. Slisenko; Edited by Ju. V. Matijasevič
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.
Noga Alon, László Babai, Alon Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), 567–583
4.
Michael Molloy, The probabilistic method, Algorithms Combin., Vol. 16, Springer, Berlin, 1998, 1–35
5.
Hamid Amirazizi, Martin Hellman, Time‐memory‐processor trade‐offs, IEEE Trans. Inform. Theory, 34 (1988), 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.
Benny Chor, Oded Goldreich, On the power of two‐point based sampling, J. Complexity, 5 (1989), 96–106
8.
B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky, The bit extraction problem or ‐resilient functions, in Proceedings 26th IEEE Symposium on Foundations of Computer Science, Portland, OR, 1985, pp. 396–407.
9.
Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Tarjan, Dynamic perfect hashing: upper and lower bounds, SIAM J. Comput., 23 (1994), 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.
Michael Fredman, János Komlós, Endre Szemerédi, Storing a sparse table with worst case access time, J. Assoc. Comput. Mach., 31 (1984), 538–544
12.
Martin Hellman, A cryptanalytic time‐memory trade‐off, IEEE Trans. Inform. Theory, 26 (1980), 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.
Michael Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), 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.
Stephen Pohlig, Martin Hellman, An improved algorithm for computing logarithms over and its cryptographic significance, IEEE Trans. Information Theory, IT‐24 (1978), 106–110
17.
R. SchroepPel and A. Shamir, A 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.
Information & Authors
Information
Published In
SIAM Journal on Computing
Pages: 790 - 803
ISSN (online): 1095-7111
Copyright
Copyright © 1999 Society for Industrial and Applied Mathematics.
History
Published online: 27 July 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashingcomputational complexity, Vol. 32, No. 2 | 13 September 2023
- Time and space efficient collinearity indexingComputational Geometry, Vol. 110 | 1 Mar 2023
- Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding CollisionsAdvances in Cryptology – EUROCRYPT 2023 | 15 April 2023
- Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short CollisionsAdvances in Cryptology – CRYPTO 2022 | 12 October 2022
- On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård HashingAdvances in Cryptology – CRYPTO 2022 | 12 October 2022
- Tight Quantum Time-Space Tradeoffs for Function Inversion2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- Lower Bounds on the Time/Memory Tradeoff of Function InversionTheory of Cryptography | 9 December 2020
- Quantum Random Oracle Model with Auxiliary InputAdvances in Cryptology – ASIACRYPT 2019 | 25 November 2019
- The Function-Inversion Problem: Barriers and OpportunitiesTheory of Cryptography | 22 November 2019
- Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower BoundTheory of Cryptography | 8 November 2018
- Random Oracles and Non-uniformityAdvances in Cryptology – EUROCRYPT 2018 | 31 March 2018
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, RevisitedAdvances in Cryptology – EUROCRYPT 2017 | 1 April 2017
- New Proofs for NMAC and HMAC: Security without Collision ResistanceJournal of Cryptology, Vol. 28, No. 4 | 10 June 2014
- High‐speed parallel implementations of the rainbow method based on perfect tables in a heterogeneous systemSoftware: Practice and Experience, Vol. 45, No. 6 | 18 February 2014
- Time–Memory Trade-Off Attack on the GSM A5/1 Stream Cipher Using Commodity GPGPUApplied Cryptography and Network Security | 9 January 2016
- Efficient Proofs of Secure ErasureSecurity and Cryptography for Networks | 1 Jan 2014
- Time/Memory/Data Tradeoffs for Variants of the RSA ProblemComputing and Combinatorics | 1 Jan 2013
- High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous SystemProgress in Cryptology - INDOCRYPT 2012 | 1 Jan 2012
- The cost of false alarms in Hellman and rainbow tradeoffsDesigns, Codes and Cryptography, Vol. 57, No. 3 | 21 February 2010
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGsAdvances in Cryptology – CRYPTO 2010 | 1 Jan 2010
- Characterization and Improvement of Time-Memory Trade-Off Based on Perfect TablesACM Transactions on Information and System Security, Vol. 11, No. 4 | 1 Jul 2008
- Basing Weak Public-Key Cryptography on Strong One-Way FunctionsTheory of Cryptography | 1 Jan 2008
- Security Weaknesses of Certain Broadcast Encryption SchemesDigital Rights Management. Technologies, Issues, Challenges and Systems | 1 Jan 2006
- Rigorous Bounds on Cryptanalytic Time/Memory TradeoffsAdvances in Cryptology - CRYPTO 2006 | 1 Jan 2006
- Moderately hard, memory-bound functionsACM Transactions on Internet Technology, Vol. 5, No. 2 | 1 May 2005
- New Applications of Time Memory Data TradeoffsAdvances in Cryptology - ASIACRYPT 2005 | 1 Jan 2005
- Time-Memory Trade-Offs: False Alarm Detection Using CheckpointsProgress in Cryptology - INDOCRYPT 2005 | 1 Jan 2005
- A Time-Memory Tradeo. Using Distinguished Points: New Analysis & FPGA ResultsCryptographic Hardware and Embedded Systems - CHES 2002 | 17 February 2003