arvutuslik eristamatus

olemus
eristamatus krüptograafias:
kaks tõenäosusjaotust $$D_1$$ ja $$D_2$$ on $$S$$-eristamatud,
kui iga ajas $$t$$ töötava eristusalgoritmi $$A$$ korral
$$| \mathsf{P}[A(X_1)=1] - \mathsf{P}[A(X_2)=1] | < \frac{t}{S}$$,
kus $$X_1\leftarrow D_1$$ ja $$X_2\leftarrow D_2$$
=
in cryptography, two families of distributions are computationally indistinguishable if no efficient algorithm can tell the difference between them except with negligible probability

ülevaateid
https://en.wikipedia.org/wiki/Computational_indistinguishability

https://www.cs.purdue.edu/homes/hmaji/teaching/Fall%202015/lectures/04.pdf

https://kodu.ut.ee/~swen/courses/crypto-ii/03-indistinguishability.pdf

https://www.cs.cornell.edu/courses/cs6830/2009fa/scribes/lec08.pdf

https://eprint.iacr.org/2006/148.pdf

vt ka
- krüptogrammide eristamatus

arvutuslik eristamatus

olemus
eristamatus krüptograafias:
kaks tõenäosusjaotust $$D_1$$ ja $$D_2$$ on $$S$$-eristamatud,
kui iga ajas $$t$$ töötava eristusalgoritmi $$A$$ korral
$$| \mathsf{P}[A(X_1)=1] - \mathsf{P}[A(X_2)=1] | < \frac{t}{S}$$,
kus $$X_1\leftarrow D_1$$ ja $$X_2\leftarrow D_2$$
=
in cryptography, two families of distributions are computationally indistinguishable if no efficient algorithm can tell the difference between them except with negligible probability

ülevaateid
https://en.wikipedia.org/wiki/Computational_indistinguishability

https://www.cs.purdue.edu/homes/hmaji/teaching/Fall%202015/lectures/04.pdf

https://kodu.ut.ee/~swen/courses/crypto-ii/03-indistinguishability.pdf

https://www.cs.cornell.edu/courses/cs6830/2009fa/scribes/lec08.pdf

https://eprint.iacr.org/2006/148.pdf

vt ka
- krüptogrammide eristamatus

Palun oodake...

arvutuslik eristamatus

olemus
eristamatus krüptograafias:
kaks tõenäosusjaotust $$D_1$$ ja $$D_2$$ on $$S$$-eristamatud,
kui iga ajas $$t$$ töötava eristusalgoritmi $$A$$ korral
$$| \mathsf{P}[A(X_1)=1] - \mathsf{P}[A(X_2)=1] | < \frac{t}{S}$$,
kus $$X_1\leftarrow D_1$$ ja $$X_2\leftarrow D_2$$
=
in cryptography, two families of distributions are computationally indistinguishable if no efficient algorithm can tell the difference between them except with negligible probability

ülevaateid
https://en.wikipedia.org/wiki/Computational_indistinguishability

https://www.cs.purdue.edu/homes/hmaji/teaching/Fall%202015/lectures/04.pdf

https://kodu.ut.ee/~swen/courses/crypto-ii/03-indistinguishability.pdf

https://www.cs.cornell.edu/courses/cs6830/2009fa/scribes/lec08.pdf

https://eprint.iacr.org/2006/148.pdf

vt ka
- krüptogrammide eristamatus

Andmete allalaadimisel või töötlemisel esines tehniline tõrge.
Vabandame!