Pseudo-random generators for all hardnesses

Pseudo-random generators for all hardnesses
复制标题

适用于所有硬度的伪随机生成器

DOI:
10.1145/509907.509997
复制
发表时间:
2002
期刊:
Proceedings 17th IEEE Annual Conference on Computational Complexity
影响因子:
--
通讯作者:
C. Umans
C. Umans
中科院分区:
--
文献类型:
--
作者:
C. Umans

文献摘要

被引文献

相似文献

(数学)我们构建了第一个具有对数种子长度的伪随机生成器,该发电机将硬度的S块转换为SΩ(1)位的2侧伪随机度,以改善任何S}。 [15]中的最佳硬度与随机性权衡是我们构造中的关键要素。
(MATH) We construct the first pseudo-random generators with logarithmic seed length that convert s bits of hardness into sΩ(1) bits of 2-sided pseudo-randomness for any s}. This improves [8] and gives a direct proof of the optimal hardness vs. randomness tradeoff in [15]. A key element in our construction is an augmentation of the standard low-degree extension encoding that exploits the field structure of the underlying space in a new way.