Abstract
We study time space tradeoffs in the complexity of attacks against one-way functions and pseudorandom generators.
Fiat and Naor [7] 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.
We show that an algorithm using time, space and advice at most
exists that inverts f on at least an ε fraction of inputs. A lower bound of \(\tilde \Omega(\sqrt { \epsilon N })\) also holds, making our result tight in the “low end” of \(\epsilon \leq \sqrt[3]{\frac{1}{N}}\).
(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.
Chapter PDF
Similar content being viewed by others
References
Aaronson, S.: Lower bounds for local search by quantum arguments. SIAM Journal of Computing 35(4), 804–824 (2006)
Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3(3), 289–304 (1992)
Andreev, A.E., Clementi, A.E.F., Rolim, J.D.P.: Optimal bounds for the approximation of boolean functions and some applications. Theoretical Computer Science 180, 243–268 (1997)
Barkan, E., Biham, E., Shamir, A.: Rigorous bounds on cryptanalytic time/memory tradeoffs. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 1–21. Springer, Heidelberg (2006)
Bennett, C., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM Journal on Computing 26(5), 1510–1523 (1997)
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)
Fiat, A., Naor, M.: Rigorous time/space trade-offs for inverting functions. SIAM Journal on Computing 29(3), 790–803 (1999)
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)
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)
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)
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)
Hellman, M.: A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory 26(4), 401–406 (1980)
Joux, A., Lucks, S.: Improved generic algorithms for 3-collisions. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 347–363. Springer, Heidelberg (2009)
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)
Siegel, A.: On universal classes of extremely random constant-time hash functions. SIAM Journal of Computing 33(3), 505–543 (2004)
van Oorschot, P.C., Wiener, M.J.: Parallel Collision Search with Cryptanalytic Applications. Journal of Cryptology 12, 1–28 (1999)
Wee, H.: On obfuscating point functions. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 523–532 (2005)
Yao, A.: Coherent functions and program checkers. In: Proceedings of the 22nd ACM Symposium on Theory of Computing, pp. 84–94 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De, A., Trevisan, L., Tulsiani, M. (2010). Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. In: Rabin, T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14623-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-14623-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14622-0
Online ISBN: 978-3-642-14623-7
eBook Packages: Computer ScienceComputer Science (R0)