Editing Computational indistinguishability (section)

==Related notions==
Implicit in the definition is the condition that the algorithm, <math>A</math>, must decide based on a single sample from one of the distributions. One might conceive of a situation in which the algorithm trying to distinguish between two distributions, could access as many samples as it needed. Hence two ensembles that cannot be distinguished by polynomial-time algorithms looking at multiple samples are deemed '''indistinguishable by polynomial-time sampling'''.<ref name=Goldreich>[[Oded Goldreich|Goldreich, O.]] (2003). Foundations of cryptography. Cambridge, UK: Cambridge University Press.</ref>{{rp|107}} If the polynomial-time algorithm can generate samples in polynomial time, or has access to a [[random oracle]] that generates samples for it, then indistinguishability by polynomial-time sampling is equivalent to computational indistinguishability.<ref name=Goldreich />{{rp|108}}