Computational indistinguishability

（重定向自Computationally indistinguishable）

In computational complexity, if $\scriptstyle\{ D_n \}_{n \in \mathbb{N}}$ and $\scriptstyle\{ E_n \}_{n \in \mathbb{N}}$ 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:

单词	Computationally indistinguishable
释义	Computationally indistinguishable 英语百科 Computational indistinguishability （重定向自Computationally indistinguishable） In computational complexity, if $\scriptstyle\{ D_n \}_{n \in \mathbb{N}}$ and $\scriptstyle\{ E_n \}_{n \in \mathbb{N}}$ 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:
随便看	OBDMS Obdormition obdt obdt. obducantur obduce obducen obducens obducent obducent cartilage obduct obduction plate obductions obduction zone obdulcorate obdurability obduracy obdurate obdurately obdurateness obduratenesses obduration obduratious obdure obdured