^abGirish, Uma, and Ran Raz. "Eliminating Intermediate Measurements using Pseudorandom Generators." ...
pseudorandom generators existenceregular functionsAlgorithm design and analysisComputer scienceCouncilsA fresh view at the question of randomness was taken in the theory of computing: It has been postulated that a distribution is pseudorandom if it cannot be told apart from the uniform distribution by ...
pseudo-random number generators是伪随机数发生器的意思,主要用于在系统需要随机数的时候,通过一系列种子值计算出来的伪随机数。因为生成一个真正意义上的“随机数”对于计算机来说是不可能的,伪随机数也只是尽可能地接近其应具有的随机性,但是因为有“种子值”,所以伪随机数在一定程度上是可控可预测的。 通过程序得...
关键词: pseudo-random generators probabilistic algorithms Markov chains 被引量: 151 摘要: Methodology and concomitant circuitry to generate cryptographically strong pseudo-random bit streams utilize secure block cypher encoders. Each block cypher encoder has a random key and a first seed as an input,...
As will be shown in this chapter, pseudo random generators based on fast superconducting switches present a new solution to this problem of generating noise power spectra. They allow the output noise power to be defined in terms of the measurements of a voltage, a resistance and a frequency. ...
pseudorandom generatorsswitching lemmascircuit complexityunconditional derandomizationWe give the best known pseudorandom generators for two touchstone classes in unconditional derandomization: small-depth circuits and sparse F_2 polynomials. Our main results are an epsilon-PRG for the class of size-M depth...
which includes a trulyrandom seed. Although sequences that are closer to truly random can be generated usinghardware random number generators,pseudorandomnumbers are important in practice for their speed in number generation and their reproducibility, and they are thus central in applications such as ...
Robust Pseudorandom Generators ∗ Yuval Ishai † Eyal Kushilevitz ‡ Xin Li § Rafail Ostrovsky ¶ Manoj Prabhakaran Amit Sahai ∗∗ David Zuckerman †† Abstract Let G : {0, 1} n →{0, 1} m be a pseudorandom generator. We say that a circuit implementa- tion of G is ...
Vadhan, Pseudorandom generators without the XOR lemma [abstract], in, Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, Atlanta, GA, May 1999, p, 4. Google Scholar STV99b M. Sudan, L. Trevisan, and S. Vadhan, Pseudorandom generators without the XOR lemma [...
Pseudorandom generators from regular one-way functions: New constructions with improved parameters We revisit the problem of basing pseudorandom generators on regular one-way functions, and present the following constructions:For any known-regular one-wa... Y Yu,X Li,J Weng - 《Theoretical ...