Topic summary
Computationally indistinguishable
Extracted from the Wikipedia article Computational indistinguishability.
In computational complexity and cryptography, two families of distributions are computationally indistinguishable if no efficient algorithm can tell the difference between them except with negligible probability.