Pages that link to "Item:Q2819542"
From MaRDI portal
The following pages link to Construction of extractors using pseudo-random generators (extended abstract) (Q2819542):
Displaying 18 items.
- Variations on Muchnik's conditional complexity theorem (Q639853) (← links)
- Reducing the seed length in the Nisan-Wigderson generator (Q879167) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Storing information with extractors. (Q1853081) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Long term confidentiality: a survey (Q2448088) (← links)
- Pseudorandom generators without the XOR lemma (extended abstract) (Q2819586) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Simple extractors for all min-entropies and a new pseudorandom generator (Q3546310) (← links)
- Extractors with weak random seeds (Q3581381) (← links)
- Extractors for weak random sources and their applications (Q5054851) (← links)
- Automata, Languages and Programming (Q5716748) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- Short leakage resilient and non-malleable secret sharing schemes (Q6097261) (← links)
