## Abstract

Many algorithms are proven to work under the assumption that they have access to a source of random, uniformly distributed bits. However, in practice, sources of randomness are often imperfect, giving n random bits that have only k < n min-entropy. The value n − k is called the entropy gap of the source. Randomness condensers are hash functions that hash any such source to a shorter source with reduced entropy gap д. The goal is to lose as little entropy as possible in this process. Condensers also have an error parameter ε and use a small seed of uniformly distributed bits whose length we desire to minimize as well. In this work, we study the exact dependencies between the different parameters of seeded randomness condensers. We obtain a non-explicit upper bound, showing the existence of condensers with entropy loss log(1 + ^{log}_{д}^{ε}^{1} ) + O(1) and seed length log(^{n}_{εд}^{−k} ) + O(1). In particular, this implies the existence of condensers with O(log _{ε}^{1} ) entropy gap and constant entropy loss. This extends (with slightly improved parameters) the non-explicit upper bound for condensers presented in the work of Dodis et al. (2014), which gives condensers with entropy loss at least log log _{ε}^{1} . We also give a non-explicit upper bound for lossless condensers, which have entropy gap д ≥ ^{log}_{ε}^{ε}^{1} + O(1) and seed length log(^{n}_{ε}^{−}_{2д}^{k} ) + O(1). Furthermore, we address an open question raised in (Dodis et al. 2014), where Dodis et al. showed an explicit construction of condensers with constant gap and O(log log _{ε}^{1} ) loss, using seed length O(n log _{ε}^{1} ). In the same article they improve the seed length to O(k log k) and ask whether it can be further improved. In this work, we reduce the seed length of their construction to O(log(^{n}_{ε} ) log(^{k}_{ε} )) by a simple concatenation. In the analysis, we use and prove a tight equivalence between condensers and extractors with multiplicative error. We note that a similar, but non-tight, equivalence was already proven by Dodis et al. (Dodis et al. 2014) using a weaker variant of extractors called unpredictability extractors. We also remark that this equivalence underlies the work of Ben-Aroya et al. (Ben-Aroya et al. 2016) and later work on explicit two-source extractors, and we believe it is interesting in its own right.

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

Article number | 15 |

Journal | ACM Transactions on Computation Theory |

Volume | 11 |

Issue number | 3 |

DOIs | |

State | Published - 2019 |

## Keywords

- Entropy gap
- Entropy loss
- Key derivation
- Randomness condensers
- Randomness extractors
- Unpredictability extractors