Explore relationships

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.

Use + to expand a branch. Click a topic name to open its summary.