Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Randomness Extractor"”.
-
Distributed computing and cryptography with general weak random sources
The use of randomness in computer science is ubiquitous. Randomized protocols have turned out to be much more efficient than their deterministic counterparts. In addition, many problems in distributed computing and cryptography are impossible to solve without randomness. However, these applications …
-
Topics in additive combinatorics
… a randomly chosen subset of a finite group is a randomness extractor with high probability. More precisely, we prove that for every fixed δ > 0, given a finite group <em>G</em> and <em>A</em> ⊂ <em>G</em> a random subset of density 1/2, we prove that with high probability for all subsets …
-
Extractors for Additive Structures and Space-bounded Computation
Randomness is a powerful resource in computer science, with rich applications in algorithm design, cryptography, distributed computing, etc. Most of the applications assume access to a sequence of uniform and independent random bits. However, the randomness we collect from nature (e.g., activity of …
-
Using and saving randomness
Randomness is ubiquitous and exceedingly useful in computer science. For example, in sparse recovery, randomized algorithms are more efficient and robust than their deterministic counterparts. At the same time, because random sources from the real world are often biased and defective with limited …
-
A ULTRA-FAST QUANTUM RANDOM NUMBER GENERATOR
We describe a series of Randomness Extractors for removing bias and residual correlations in random numbers generated from measurements on noisy physical systems. The structures of the randomness extractors are based on Linear Feedback Shift Registers (LFSR). This leads to a significant …