50 search results - page 1 / 10 » Language Compression and Pseudorandom Generators |
COCO
2004
Springer
13 years 10 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
EUROCRYPT
2006
Springer
13 years 8 months ago
2006
Springer
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebrai...
FOCS
1995
IEEE
13 years 8 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...