Dear cryptographic community,

I have a question about Theorem 5. The theorem states that you can have a computational extractor with a circuit size S’=S *\epsilon’ . In most cryptographic scenarios, we want \epsilon’ to be negligible, which make the circuit of size approximately zero. So, the theorem is not applicable to cryptographic scenarios.

Am I right?