Lecture 2 : Pseudorandom Generators and Extractors
نویسندگان
چکیده
Intuitively, a pseudorandom generator (PRG) is a procedure that generates a pseudorandom distribution. A PRG shares the parameters of the underlying pseudorandom distribution: the class A of algorithms to which the generated distribution looks random, and a bound on how different the pseudorandom distribution can look from the uniform one for algorithms from A. Definition 1 (Pseudorandom generator). An (r)-pseudorandom generator for A is a sequence of mappings G = (Gr)r∈N where Gr : {0, 1}`(r) 7→ {0, 1}r such that (Gr(U`(r)))r∈N is (r)-pseudorandom for A.
منابع مشابه
Randomized Algorithms 2016 / 7 A Lecture 2
We saw one such extractor, for the case of a biased coin, whose bias is unknown. The von Neumann ‘trick’ of turning a biased coin into a fair one is from the period where randomized algorithms started [4]. A famous quote from that paper is “Any one who considers arithmetical methods for producing random digits is of course in a state of sin” and then goes on to discuss such methods (what we wou...
متن کاملExtractors and Pseudorandom generators using the hard core lemma
We present a construction of an extractor based exclusively on hardness amplification which extracts from sources with (some) polynomially small min-entropy. This improves upon a similar construction of the author with Trevisan ([DT09]) both in terms of the entropy rate and seed length. The extractor in [DT09] could extract from N -bit sources with entropy γN (for γ > 0) using a seed of length ...
متن کاملConstructions of Near-Optimal Extractors Using Pseudo-Random Generators
We introduce a new approach to construct extractors — combinatorial objects akin to expander graphs that have several applications. Our approach is based on error correcting codes and on the Nisan-Wigderson pseudorandom generator. An application of our approach yields a construction that is simple to describe and analyze, does not utilize any of the standard techniques used in related results, ...
متن کاملFoundations and Trends Pseudorandomness I
This is the first volume of a 2-part survey on pseudorandomness, the theory of efficiently generating objects that “look random” despite being constructed using little or no randomness. The survey places particular emphasis on the intimate connections that have been discovered between a variety of fundamental “pseudorandom objects” that at first seem very different in nature: expander graphs, r...
متن کاملCryptographic random and pseudorandom data generators
This dissertation thesis deals with cryptographic random and pseudorandom data generators in mobile computing environments (such as mobile phones, personal digital assistants, cryptographic smartcards). These mobile devices are typically bounded by the amount of energy, performance, memory or even silicon area. This lack of resources leads to very limited computing environments with: a) limited...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014