Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs

DOI10.1145/2792978zbMath1426.68084OpenAlexW2252149818WikidataQ114614123 ScholiaQ114614123MaRDI QIDQ5895071

Emanuele Viola, Eric Miles

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2792978

zbMATH Keywords

substitution-permutation networkpseudorandom functionadvanced encryption standardnatural proofs

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Classical models of computation (Turing machines, etc.) (68Q04) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (7)

The \(t\)-wise independence of substitution-permutation networks ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Asymptotically quasi-optimal cryptography ⋮ Unnamed Item ⋮ Hardness magnification near state-of-the-art lower bounds ⋮ Pseudorandom Functions: Three Decades Later ⋮ On a generalization of substitution-permutation networks: the HADES design strategy

This page was built for publication: Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs