Definition 1. Let {Xn}, {Yn} be sequences of distributions withXn, Yn ranging over {0, 1}`(n) for some `(n) = nO(1). {Xn} and {Yn} are computationally indistinguishable (notation: Xn ≈ Yn) if for every polynomial-time A and polynomially-bounded , and sufficiently large n ∣∣Pr[A(Xn) = 1]− Pr[A(Yn) = 1]∣∣ ≤ (n) (If we want to nitpick, we’d give 1n as additional input to A to ensure it can run in ...