The following pages link to Simple permutations mix well (Q2581269):
Displaying 10 items.
- Local random quantum circuits are approximate polynomial-designs (Q506483) (← links)
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers (Q2092793) (← links)
- The \(t\)-wise independence of substitution-permutation networks (Q2139644) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions (Q3191585) (← links)
- Simple permutations mix even better (Q3503604) (← links)
- (Q3619929) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Automata, Languages and Programming (Q5466512) (← links)
- Complexity theory. Abstracts from the workshop held June 2--7, 2024 (Q6671624) (← links)
