|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'502'364
Articles rated: 2609
23 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Pseudorandom Generators against CFL/n | | Tomoyuki Yamakami
; | | Date: |
16 Feb 2009 | | Abstract: | Pseudorandomness has played a central role in modern cryptography, finding
theoretical and practical applications to various fields of computer science. A
function that generates such pseudorandom strings from shorter but truly random
seeds is known as a pseudorandom generator. Our generators are designed to fool
languages, rather than probabilistic algorithms. In particular, our generators
take context-free languages with advice as their adversaries. We present an
explicit example of such a pseudorandom generator, which can be also computed
by a single-tape deterministic Turing machine running in time O(n^2). In
contrast, we show that there is no almost 1-1 pseudorandom generator against
even context-free languages (without advice) if we demand it should be computed
by a nondeterministic pushdown automaton equipped with a write-only output
tape. Our proofs are all elementary, requiring no complicated proof techniques
as in a polynomial-time setting, and utilize a specific feature of
nondeterministic pushdown automata, which is interesting on its own light. | | Source: | arXiv, 0902.2774 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER