71 search results - page 14 / 15 » Bijective Linear Time Coding and Decoding for k-Trees |
JOC
2008
13 years 7 months ago
2008
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract-- This work analyzes the high-SNR asymptotic error performance of outage-limited communications with fading, where the number of bits that arrive at the transmitter during...
CC
2008
Springer
13 years 7 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
CRYPTO
2004
Springer
14 years 25 days ago
2004
Springer
We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correla...
STOC
2000
ACM
13 years 11 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...