Computational indistinguishability
(重定向自Computationally indistinguishable)
In computational complexity, if and
are two distribution ensembles indexed by a security parameter n (which usually refers to the length of the input), then we say they are computationally indistinguishable if for any non-uniform probabilistic polynomial time algorithm A, the following quantity is a negligible function in n: