Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Shuffling Cards and Stopping Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating probability distributions using small sample spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-wise independent permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple permutations mix even better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Permutation Groups and Finite Simple Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost random graphs with simple hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, small-space algorithms for approximate histogram maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of Huge Random Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost <i>m</i>-wise Independent Random Permutation of the Cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sample size of <i>k</i> -restricted min-wise independent permutations and other <i>k</i> -wise distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3581398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric groups and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Small Sample Spaces Satisfying Given Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Construct Pseudorandom Permutations from Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixing time of the thorp shuffle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of pseudorandom permutations: Luby-Rackoff revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness is linear in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform hashing in constant time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composition Does Not Imply Adaptive Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom walks on regular digraphs and the RL vs. L problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Universal Classes of Extremely Random Constant-Time Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic derandomization via complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrandom Shuffling with Applications to the Game of Faro / rank
 
Normal rank

Latest revision as of 20:32, 1 July 2024

scientific article
Language Label Description Also known as
English
Derandomized constructions of \(k\)-wise (almost) independent permutations
scientific article

    Statements

    Derandomized constructions of \(k\)-wise (almost) independent permutations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    pseudo-randomness
    0 references
    card shuffling
    0 references
    block ciphers
    0 references
    random walk
    0 references
    connectivity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references