Sciweavers

45 search results - page 5 / 9
» Randomized Quicksort and the Entropy of the Random Source
Sort
View
CHES
2009
Springer
171views Cryptology» more  CHES 2009»
14 years 8 months ago
The Frequency Injection Attack on Ring-Oscillator-Based True Random Number Generators
We have devised a frequency injection attack which is able to destroy the source of entropy in ring-oscillator-based true random number generators (TRNGs). A TRNG will lock to freq...
A. Theodore Markettos, Simon W. Moore
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
On Extractors and Exposure-Resilient Functions for Sublogarithmic Entropy
We study deterministic extractors for bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions for small min-entropy. That is, of the n bits given as input...
Yakir Reshef, Salil P. Vadhan
DCC
2010
IEEE
14 years 2 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
TIT
2008
83views more  TIT 2008»
13 years 7 months ago
The Information Lost in Erasures
Abstract--We consider sources and channels with memory observed through erasure channels. In particular, we examine the impact of sporadic erasures on the fundamental limits of los...
Sergio Verdú, Tsachy Weissman
CORR
2007
Springer
101views Education» more  CORR 2007»
13 years 7 months ago
Variable-Rate Distributed Source Coding in the Presence of Byzantine Sensors
— The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown number of sensors have been reprogrammed by a...
Oliver Kosut, Lang Tong