HW1 - question 2c

HW1 - question 2c

amit_bergman 10 Nov 2019 11:31

Hi,
I think (hope) I understood how to prove the claim.
But I did not understand why the conclusion that is written there is a result of the claim.
I am referring to the conclusion on the fact that we can treat non uniform algorithms as deterministic.

Thanks!

Re: HW1 - question 2c

nbitansky 10 Nov 2019 14:42

If there is a non-uniform probabilistic distinguisher for two specific distributions, then there is also a deterministic one —- just fix its randomness to the one that maximizes the advantage.