Simple extractors via constructions of cryptographic pseudo-random generators

DOI10.1016/J.TCS.2009.10.020MaRDI QIDQ2268098zbMATH OpenOpenAlexFDO

Authors Marius Zimand

Publication date 10 March 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.10.020

zbMATH Keywords

pseudo-random generatorone-way permutationrandomness extractor

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Automata, Languages and Programming
• Construction of extractors using pseudo-random generators (extended abstract)
• Extractors and pseudorandom generators
• Simple extractors for all min-entropies and a new pseudorandom generator
• Computational extractors and pseudorandomness

Cites work

• scientific article; zbMATH DE number 1820017 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• scientific article; zbMATH DE number 2133317 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
• Combinatorial bounds for list decoding
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Construction of extractors using pseudo-random generators (extended abstract)
• Encryption against storage-bounded adversaries from on-line strong extractors
• Extracting all the randomness and reducing the error in Trevisan's extractors
• Extractor codes
• Extractors and pseudorandom generators
• Extractors from Reed-Muller codes
• Hardness vs randomness
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• On the distribution of the number of roots of polynomials and explicit weak designs
• Optimal randomizer efficiency in the bounded-storage model
• Simple extractors for all min-entropies and a new pseudorandom generator
• Some Applications of Coding Theory in Computational Complexity

Cited in

(10)

• Computational extractors and pseudorandomness
• Simple extractors for all min-entropies and a new pseudorandom generator
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• Construction of extractors using pseudo-random generators (extended abstract)
• Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
• Automata, Languages and Programming
• Extractors with weak random seeds
• On Obtaining Pseudorandomness from Error-Correcting Codes
• Extractors and pseudorandom generators
• Extractors Using Hardness Amplification

This page was built for publication: Simple extractors via constructions of cryptographic pseudo-random generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268098)