= Computational indistinguishability
{wiki=Computational_indistinguishability}
Computational indistinguishability is a concept from theoretical computer science and cryptography that describes a relationship between two probability distributions or random variables. Two distributions \\( P \\) and \\( Q \\) are said to be computationally indistinguishable if no polynomial-time adversary (or algorithm) can distinguish between them with a significant advantage, that is, if every probabilistic polynomial-time algorithm produces similar outputs when given samples from either distribution.
Back to article page