Candidate weak pseudorandom functions in AC 0 ○ MOD 2
Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen · 2014
Pseudorandom functions (PRFs) play a fundamental role in symmetric-key cryptography. However, they are inherently complex and cannot be implemented in the class AC0 (MOD2). Weak pseudorandom functions (weak PRFs) do not suffer from this complexity limitation, yet they suffice for many cryptographic applications.