Extractors with weak random seeds
From MaRDI portal
Recommendations
- Extractors and pseudo-random generators with optimal seed length
- Extractors and pseudorandom generators
- Extractors for weak random sources and their applications
- scientific article; zbMATH DE number 6963652
- An introduction to randomness extractors
- Construction of extractors using pseudo-random generators (extended abstract)
- Computational extractors and pseudorandomness
- Extracting randomness from extractor-dependent sources
- Simple extractors via constructions of cryptographic pseudo-random generators
- Automata, Languages and Programming
Cited in
(48)- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- Extractors for weak random sources and their applications
- Extractors: low entropy requirements colliding with non-malleability
- Deterministic extractors for affine sources over large fields
- Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
- Deterministic extractors for small-space sources
- scientific article; zbMATH DE number 7650110 (Why is no real title available?)
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- scientific article; zbMATH DE number 7250143 (Why is no real title available?)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws
- Extracting Randomness from Multiple Independent Sources
- Improving the Hadamard extractor
- Pseudo-random number generation with -encoders
- Improved Extractors for Recognizable and Algebraic Sources
- Increasing the output length of zero-error dispersers
- Improved computational extractors and their applications
- From affine to two-source extractors via approximate duality
- On generating independent random strings
- Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
- Non-malleable extractors and non-malleable codes: partially optimal constructions
- Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs
- Extractors and lower bounds for locally samplable sources
- Zero-fixing extractors for sub-logarithmic entropy
- Local correlation breakers and applications to three-source extractors and mergers
- Extracting Randomness Using Few Independent Sources
- Extractors for sumset sources
- Explicit two-source extractors and resilient functions
- Seed-protecting extractors
- Extracting Computational Entropy and Learning Noisy Linear Functions
- Extracting randomness from extractor-dependent sources
- How to extract useful randomness from unreliable sources
- Low error efficient computational extractors in the CRS model
- Multi-source non-malleable extractors and applications
- Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy
- Extractors for small zero-fixing sources
- Explicit directional affine extractors and improved hardness for linear branching programs
- Two-source and affine non-malleable extractors for small entropy
- Leakage-resilient coin tossing
- An introduction to randomness extractors
- Secure Sketch and Fuzzy Extractor with Imperfect Randomness: An Information-Theoretic Study
- How to get more mileage from randomness extractors
- Increasing the Output Length of Zero-Error Dispersers
- Nonmalleable extractors and codes, with their many tampered extensions
- Analyzing linear mergers
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Two-source extractors secure against quantum adversaries
This page was built for publication: Extractors with weak random seeds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581381)
