An Almost m-wise Independent Random Permutation of the Cube
From MaRDI portal
Publication:4715261
Recommendations
Cites work
- Approximate inclusion-exclusion
- Approximating the Permanent
- Fast uniform generation of regular graphs
- Geometric bounds for eigenvalues of Markov chains
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Pseudorandom bits for constant depth circuits
- Pseudorandom generators for space-bounded computation
- Simple Constructions of Almost k-wise Independent Random Variables
Cited in
(13)- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Simple permutations mix well
- Weak oblivious transfer from strong one-way functions
- Fast pseudorandom functions based on expander graphs
- Shift-Generated Random Permutations and The M/D/1 Queue
- The Complexity of Public-Key Cryptography
- On hereditarily indecomposable Banach spaces
- Complexity theory. Abstracts from the workshop held June 2--7, 2024
- Pseudorandomness properties of random reversible circuits
- Towards general-purpose program obfuscation via local mixing
- Dynamics of pseudoentanglement
- When simple permutations mix poorly. Limited independence does not imply pseudorandomness
- Efficient quantum pseudorandomness from Hamiltonian phase states
This page was built for publication: An Almost m-wise Independent Random Permutation of the Cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4715261)