Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds

DOI10.1007/S000370100002zbMath1039.68053OpenAlexW1995511496MaRDI QIDQ1405738

Stefan Lucks, Matthias Krause

Publication date: 26 August 2003

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000370100002

zbMATH Keywords

lower boundspseudorandomnessfunction generators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

McCulloch-Pitts Brains and Pseudorandom Functions ⋮ Natural Proofs versus Derandomization ⋮ Unnamed Item

This page was built for publication: Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds