The definition of "computational indistinguishability" for probabilistic ensembles, and the main workhorse in crypto proofs: the Hybrid Argument. Lecture 25b of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resource for this lecture:
"A course in cryptography" by Pass and Shelat.
Taught by Ryan O'Donnell ([ Ссылка ])
Course homepage on CMU's Diderot system: [ Ссылка ]
Thumbnail photo by Rebecca Kiger ([ Ссылка ])
