Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
We study time space tradeoffs in the complexity of attacks against one-way functions and pseudorandom generators.
Fiat and Naor  show that for every function f: [N]→[N], there is an algorithm that inverts f everywhere using (ignoring lower order factors) time, space and advice at most N 3/4.
(Both the results of Fiat and Naor and ours are formulated as more general trade-offs between the time and the space and advice length of the algorithm. The results quoted above correspond to the interesting special case in which time equals space and advice length.)
We also show that for every length-increasing generator G:[N] →[2N] there is a algorithm that achieves distinguishing probability ε between the output of G and the uniform distribution and that can be implemented in polynomial (in logN) time and with advice and space O(ε 2 ·NlogN). We prove a lower bound of S·T ≥ Ω(ε 2 N) where T is the time used by the algorithm and S is the amount of advice. This lower bound applies even when the distinguisher has oracle access to G.
We prove stronger lower bounds in the common random string model, for families of one-way permutations and of pseudorandom generators.
KeywordsOne-way functions pseudorandom generators random permutations time-space tradeoffs
- 6.Capalbo, M.R., Reingold, O., Vadhan, S.P., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 659–668 (2002)Google Scholar
- 8.Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 305–313 (2000)Google Scholar
- 9.Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st ACM Symposium on Theory of Computing, pp. 25–32 (1989)Google Scholar
- 10.Golynski, A.: Cell probe lower bounds for succinct data structures. In: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms, pp. 625–634 (2009)Google Scholar
- 11.Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM Symposium on Theory of Computing, pp. 212–219 (1996)Google Scholar
- 14.Ostlin, A., Pagh, R.: Uniform hashing in constant time and linear space. In: Proceedings of the 35th ACM Symposium on Theory of Computing, pp. 622–628 (2003)Google Scholar
- 17.Wee, H.: On obfuscating point functions. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 523–532 (2005)Google Scholar
- 18.Yao, A.: Coherent functions and program checkers. In: Proceedings of the 22nd ACM Symposium on Theory of Computing, pp. 84–94 (1990)Google Scholar