Computational indistinguishability: Algorithms vs. circuits

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We present a simple proof of the existence of a probability ensemble with tiny support which cannot be distinguished from the uniform ensemble by any recursive computation. Since the support is tiny (i.e., sub-polynomial), this ensemble can be distinguished from the uniform ensemble by a (non-uniform) family of small circuits. It also provides an example of an ensemble which cannot be (recursively) distinguished from the uniform by one sample, but can be so distinguished by two samples. In case we only wish to fool probabilistic polynomial-time algorithms the ensemble can be constructed in super-exponential time.

Cite

CITATION STYLE

APA

Goldreich, O., & Meyer, B. (1998). Computational indistinguishability: Algorithms vs. circuits. Theoretical Computer Science, 191(1–2), 215–218. https://doi.org/10.1016/S0304-3975(97)00162-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free