Computational indistinguishability
id:
computational-indistinguishability-245-9469939
title:
Computational indistinguishability
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
In computer science, relationship between two families of distributions
original url:
https://en.wikipedia.org/wiki/Computational_indistinguishability
date created:
date modified:
2022-10-28T18:47:50Z
main entity:
{"identifier":"Q5157322","url":"https://www.wikidata.org/entity/Q5157322"}
image:
fields total:
13
integrity:
14