Substitution-permutation networks, pseudorandom functions, and natural proofs

DOI10.1145/2792978zbMATH Open1426.68084OpenAlexW2252149818WikidataQ114614123 ScholiaQ114614123MaRDI QIDQ5895071FDOQ5895071

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

Recommendations

• Substitution-permutation networks, pseudorandom functions, and natural proofs
• scientific article; zbMATH DE number 1304107
• Hardness preserving constructions of pseudorandom functions
• Provable security of (tweakable) block ciphers based on substitution-permutation networks
• Pseudorandom functions in almost constant depth from low-noise LPN

zbMATH Keywords

substitution-permutation networkpseudorandom functionadvanced encryption standardnatural proofs

Mathematics Subject Classification ID

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

Cited In (9)

• Pseudorandom Functions: Three Decades Later
• MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
• The \(t\)-wise independence of substitution-permutation networks
• Title not available (Why is that?)
• Asymptotically quasi-optimal cryptography
• On a generalization of substitution-permutation networks: the HADES design strategy
• Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
• Indifferentiability of 3-round confusion-diffusion networks
• Hardness magnification near state-of-the-art lower bounds

This page was built for publication: Substitution-permutation networks, pseudorandom functions, and natural proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895071)