Simple permutations mix even better
From MaRDI portal
Publication:3503604
DOI10.1002/rsa.20194zbMath1149.05001arXivmath/0411098MaRDI QIDQ3503604
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
cryptography; multicommodity flow; reversible computation; mixing-time; \(k\)-wise independent permutations
05A05: Permutations, words, matrices
Related Items
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, The \(t\)-wise independence of substitution-permutation networks, Derandomized constructions of \(k\)-wise (almost) independent permutations, Simple permutations mix well, Fast Pseudorandom Functions Based on Expander Graphs
Cites Work