Simple permutations mix well

DOI10.1016/j.tcs.2005.09.016zbMath1081.68063OpenAlexW1985614194MaRDI QIDQ2581269

Shlomo Hoory, Avner Magen, Steven Myers, Charles W. Rackoff

Publication date: 9 January 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.016

zbMATH Keywords

permutationsrandom walk\(k\)-wise independencefast mixing

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Combinatorial probability (60C05)

Related Items (6)

The \(t\)-wise independence of substitution-permutation networks ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Local random quantum circuits are approximate polynomial-designs ⋮ Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers ⋮ The Complexity of Public-Key Cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Simple permutations mix even better
• Generators for Certain Alternating Groups with Applications to Cryptography
• Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S.
• Stratified random walks on then-cube
• An Almost m-wise Independent Random Permutation of the Cube
• Theory of Cryptography

This page was built for publication: Simple permutations mix well