## Abstract

We study the task of deterministically extracting randomness from sources containing computational entropy. The sources we consider have the form of a conditional distribution (f(X)|X), for some function f and some distribution X, and we say that such a source has computational min-entropy k if any circuit of size 2^{k} can only predict f(x) correctly with probability at most 2^{-k} given input x sampled from X. We first show that it is impossible to have a seedless extractor to extract from one single source of this kind. Then we show that it becomes possible if we are allowed a seed which is weakly random (instead of perfectly random) but contains some statistical min-entropy, or even a seed which is not random at all but contains some computational min-entropy. This can be seen as a step toward extending the study of multisource extractors from the traditional, statistical setting to a computational setting. We reduce the task of constructing such extractors to a problem in computational learning theory: learning linear functions under arbitrary distribution with adversarial noise, and we provide a learning algorithm for this problem. In fact, this problem is a well-recognized one in computational learning theory and variants of this problem have been studied intensively before. Thus, in addition to its application to extractors, our learning algorithm also has independent interest of its own, and it can be considered as the main technical contribution of this paper.

Original language | English |
---|---|

Article number | 5961829 |

Pages (from-to) | 5485-5496 |

Number of pages | 12 |

Journal | IEEE Transactions on Information Theory |

Volume | 57 |

Issue number | 8 |

DOIs | |

State | Published - 1 Aug 2011 |

## Keywords

- computational complexity
- Computational min-entropy
- learning linear functions
- randomness extractors