Substitution-permutation networks, pseudorandom functions, and natural proofs
From MaRDI portal
Publication:5895071
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
Cited in
(11)- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- The \(t\)-wise independence of substitution-permutation networks
- Hardness magnification near state-of-the-art lower bounds
- Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
- Hardness magnification near state-of-the-art lower bounds
- Substitution-permutation networks, pseudorandom functions, and natural proofs
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Pseudorandom functions: three decades later
- On a generalization of substitution-permutation networks: the HADES design strategy
- Indifferentiability of 3-round confusion-diffusion networks
- Asymptotically quasi-optimal cryptography
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)