Simple permutations mix even better

DOI10.1002/rsa.20194zbMath1149.05001arXivmath/0411098OpenAlexW3083295155MaRDI QIDQ3503604

Alex Brodsky, Shlomo Hoory

Publication date: 5 June 2008

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0411098

zbMATH Keywords

cryptographymulticommodity flowreversible computationmixing-time\(k\)-wise independent permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (8)

The \(t\)-wise independence of substitution-permutation networks ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ Derandomized constructions of \(k\)-wise (almost) independent permutations ⋮ Layout graphs, random walks and the \(t\)-wise independence of SPN block ciphers ⋮ Local random quantum circuits are approximate polynomial-designs ⋮ Random quantum circuits are approximate 2-designs ⋮ Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers ⋮ Simple permutations mix well

Cites Work

• Unnamed Item
• Unnamed Item
• Diameter, covering index, covering radius and eigenvalues
• A new family of Cayley expanders (?)
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• A universal two-bit gate for quantum computation
• Automata, Languages and Programming
• Theory of Cryptography

This page was built for publication: Simple permutations mix even better