The t-wise independence of substitution-permutation networks

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Analysis of Boolean Functions
On the Indifferentiability of Key-Alternating Ciphers
Minimizing the Two-Round Even-Mansour Cipher
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
Higher Order Derivatives and Differential Cryptanalysis
Tight Security Bounds for Key-Alternating Ciphers
Differential cryptanalysis of DES-like cryptosystems
Is the data encryption standard a group? (Results of cycling experiments on DES)
Biclique Cryptanalysis of the Full AES
Perfect nonlinear functions and cryptography
Security Analysis of Key-Alternating Feistel Ciphers
On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
Provable security against a differential attack
Markov Ciphers and Differential Cryptanalysis
Decorrelation: a theory for block cipher security
Advanced Encryption Standard – AES
Fast Software Encryption
The interpolation attack on block ciphers
Proving the Security of AES Substitution-Permutation Network
Generators for Certain Alternating Groups with Applications to Cryptography
An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
A weak cipher that generates the symmetric group
Simple permutations mix well
Simple permutations mix even better
Indistinguishability Amplification
Understanding Two-Round Differentials in AES
Provable security of (tweakable) block ciphers based on substitution-permutation networks
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis
Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
Indifferentiability of Confusion-Diffusion Networks
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
Tight security analysis of 3-round key-alternating cipher with a single permutation
A Synthetic Indifferentiability Analysis of Interleaved Double-Key Even-Mansour Ciphers

Cited In (3)

Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers
Title not available (Why is that?)
Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis

Uses Software

MiMC

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)