Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
From MaRDI portal
Publication:5891772
DOI10.1007/978-3-642-32009-5_5zbMath1294.94065OpenAlexW2405068754MaRDI QIDQ5891772
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_5
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 (7)
Exploring crypto dark matter: new simple PRF candidates and their applications ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Sequential indifferentiability of confusion-diffusion networks ⋮ Natural Proofs versus Derandomization ⋮ The Complexity of Public-Key Cryptography
This page was built for publication: Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
