Sciweavers

41 search results - page 2 / 9
» On extracting common random bits from correlated sources
Sort
View
TIT
1998
89views more  TIT 1998»
13 years 5 months ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
Sivarama Venkatesan, Venkat Anantharam
FOCS
2004
IEEE
13 years 9 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
FPGA
2004
ACM
234views FPGA» more  FPGA 2004»
13 years 9 months ago
An embedded true random number generator for FPGAs
Field Programmable Gate Arrays (FPGAs) are an increasingly popular choice of platform for the implementation of cryptographic systems. Until recently, designers using FPGAs had le...
Paul Kohlbrenner, Kris Gaj
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 5 months ago
The Multiple Access Channel with Feedback and Correlated Sources
Abstract-- In this paper, we investigate communication strategies for the multiple access channel with feedback and correlated sources (MACFCS). The MACFCS models a wireless sensor...
Lawrence Ong, Mehul Motani
FOCS
2000
IEEE
13 years 9 months ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson