We use PRG to encrypt the message $m$ in the case of Pseudo one time pad instead of random string as in one time pad. Assuming G is PRG we prove that the scheme Pseudo one time pad is computationally indistinguishable with probability $\frac{1}{2}+$ negligible.
What will be success probability of...
The Side Channel
The Side Channel