Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Anindya DeAffiliated withUniversity of California at Berkeley
- , Luca TrevisanAffiliated withUniversity of California at Berkeley and Stanford University
- , Madhur TulsianiAffiliated withInstitute for Advanced Study, Princeton
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
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Book Title
- Advances in Cryptology – CRYPTO 2010
- Book Subtitle
- 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15-19, 2010. Proceedings
- pp 649-665
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- One-way functions
- pseudorandom generators
- random permutations
- time-space tradeoffs
- Industry Sectors
- eBook Packages
- Tal Rabin (16)
- Editor Affiliations
- 16. IBM T.J.Watson Research Center
- Author Affiliations
- 17. University of California at Berkeley,
- 18. University of California at Berkeley and Stanford University,
- 19. Institute for Advanced Study, Princeton,
To view the rest of this content please follow the download PDF link above.