How fast does the inverse walk approximate a random permutation?
From MaRDI portal
Cites work
- A Note on Permutations in an Arbitrary Field
- Biclique Cryptanalysis of the Full AES
- Carlitz rank and index of permutation polynomials
- Comparison techniques for random walk on finite groups
- Comparison theorems for reversible Markov chains
- Cryptanalysis of block ciphers with overdefined systems of equations
- Differential cryptanalysis of DES-like cryptosystems
- Differentially uniform mappings for cryptography
- Generating a random permutation with random transpositions
- Groups of permutation polynomials over finite fields
- Higher Order Derivatives and Differential Cryptanalysis
- scientific article; zbMATH DE number 503329 (Why is no real title available?)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Integral cryptanalysis
- Layout graphs, random walks and the t-wise independence of SPN block ciphers
- Logarithmic Sobolev inequality for some models of random walks
- Modified logarithmic Sobolev inequalities for some models of random walk
- On a theorem of Carlitz
- On the Carlitz rank of permutation polynomials
- Permutations in a finite field
- Proving the Security of AES Substitution-Permutation Network
- Refined estimates for some basic random walks on the symmetric and alternating groups
- Regularized modified log-Sobolev inequalities and comparison of Markov chains
- The \(t\)-wise independence of substitution-permutation networks
- The Carlitz rank of permutations of finite fields: a survey
- The design of Rijndael. AES -- the Advanced Encryption Standard
- The interpolation attack on block ciphers
- The random k cycle walk on the symmetric group
- Truncated and higher order differentials
This page was built for publication: How fast does the inverse walk approximate a random permutation?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443551)