 Since the adversary knows all but bits, this is almost optimal.More precisely, the leftover hash lemma tells us that we can extract a length asymptotic to formula_1 (the min-entropy of ) bits from a random variable that are almost uniformly distributed.In other words, an adversary who has some partial knowledge about , will have almost no knowledge about the extracted value.