The t-wise independence of substitution-permutation networks
From MaRDI portal
Publication:2139644
Recommendations
- Proving the Security of AES Substitution-Permutation Network
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- scientific article; zbMATH DE number 1304107
- Tight security for key-alternating ciphers with correlated sub-keys
- Tight security bounds for key-alternating ciphers
Cites work
- scientific article; zbMATH DE number 2089131 (Why is no real title available?)
- scientific article; zbMATH DE number 1808212 (Why is no real title available?)
- scientific article; zbMATH DE number 5771375 (Why is no real title available?)
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 503329 (Why is no real title available?)
- scientific article; zbMATH DE number 1455090 (Why is no real title available?)
- scientific article; zbMATH DE number 1759276 (Why is no real title available?)
- scientific article; zbMATH DE number 2085199 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- A synthetic indifferentiability analysis of interleaved double-key Even-Mansour ciphers
- A weak cipher that generates the symmetric group
- Advanced Encryption Standard – AES
- Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions
- An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
- Analysis of Boolean Functions
- Biclique Cryptanalysis of the Full AES
- Decorrelation: a theory for block cipher security
- Differential cryptanalysis of DES-like cryptosystems
- Generators for Certain Alternating Groups with Applications to Cryptography
- Higher Order Derivatives and Differential Cryptanalysis
- Improving the upper bound on the maximum differential and the maximum linear hull probability for SPN structures and AES.
- Indifferentiability of confusion-diffusion networks
- Indistinguishability Amplification
- Is the data encryption standard a group? (Results of cycling experiments on DES)
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
- Markov Ciphers and Differential Cryptanalysis
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- Minimizing the two-round Even-Mansour cipher
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
- On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis
- On the indifferentiability of key-alternating ciphers
- Perfect nonlinear functions and cryptography
- Provable security against a differential attack
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Proving the Security of AES Substitution-Permutation Network
- Security analysis of key-alternating Feistel ciphers
- Simple permutations mix even better
- Simple permutations mix well
- Substitution-permutation networks, pseudorandom functions, and natural proofs
- The interpolation attack on block ciphers
- Tight security analysis of 3-round key-alternating cipher with a single permutation
- Tight security bounds for key-alternating ciphers
- Understanding Two-Round Differentials in AES
Cited in
(10)- scientific article; zbMATH DE number 1500488 (Why is no real title available?)
- Sequential indifferentiability of confusion-diffusion networks
- Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers
- Avalanche characteristics of substitution-permutation encryption networks
- Substitution-permutation networks, pseudorandom functions, and natural proofs
- Provable security of (tweakable) block ciphers based on substitution-permutation networks
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Proving the Security of AES Substitution-Permutation Network
- On a generalization of substitution-permutation networks: the HADES design strategy
- Tight security for key-alternating ciphers with correlated sub-keys
This page was built for publication: The \(t\)-wise independence of substitution-permutation networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139644)
