arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0501075cs.CCcs.CR
收藏

通过构造密码伪随机发生器实现简单的提取器

Simple extractors via constructions of cryptographic pseudo-random generators

Marius Zimand

摘要:

Trevisan已经证明,从硬函数构造伪随机生成器(Nisan-Wigderson方法)也会产生提取器。我们表明,从单向排列(Blum-Micali-Yao方法)的伪随机生成器的构造也可以用于构建提取器。使用这种新技术,我们建立提取器,不使用设计和基于多项式的纠错码,是非常简单和有效的。例如,一个提取器在$O(\log^2 n)$时间内分别产生每个输出位。这些提取器工作于具有最小熵$λn$的弱源,对于任意常数$λ> 0$,具有种子长度$O(\log^2 n)$,并且它们的输出长度为$\approx n^{λ/3}$。

英文摘要:

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-random generators from one-way permutations (the Blum-Micali-Yao approach) can be used for building extractors as well. Using this new technique we build extractors that do not use designs and polynomial-based error-correcting codes and that are very simple and efficient. For example, one extractor produces each output bit separately in $O(\log^2 n)$ time. These extractors work for weak sources with min entropy $λn$, for arbitrary constant $λ> 0$, have seed length $O(\log^2 n)$, and their output length is $\approx n^{λ/3}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑