It’s easy to check that any specific string of length n has probability at most (1 − δ), hence SV-sources are n log 1 1−δ -sources. Also recall that SV-sources are (k, l) block sources where k = l log 1 1−δ . Suppose δ = log 1 1−δ , then k = δl. Take a hash-based extractor E : {0, 1} × {0, 1} → {0, 1}. Here, our weak-source is a SVsource over the strings of… (More)