Nearly One-Sided Tests and the Goldreich-Levin Predicate Gustav Hast Department of Numerical Analysis and Computer Science Royal Institute of Technology, [removed]Stockholm, Sweden [removed]

First Page		Document Content
Date: 2008-09-15 00:54:52 Pseudorandomness Probabilistic complexity theory Coding theory Error detection and correction Hard-core predicate Pseudorandom generator theorem List decoding Randomized algorithm Averaging argument Theoretical computer science Applied mathematics Computational complexity theory		Nearly One-Sided Tests and the Goldreich-Levin Predicate Gustav Hast Department of Numerical Analysis and Computer Science Royal Institute of Technology, [removed]Stockholm, Sweden [removed] Add to Reading List Source URL: www.iacr.org Download Document from Source Website File Size: 178,50 KB Share Document on Facebook

	Lecture 9: Tues Feb 14: Superdense Coding OK, now on to some new stuff! Superdense Coding is the first protocol we’ll see that requires entanglement. Basic information theory (Shannon) tells us that “by sending bits, DocID: 1xVqR - View Document
	QcBits: constant-time small-key code-based cryptography Tung Chou Technische Universiteit Eindhoven, The Netherlands Coding theory DocID: 1vexc - View Document
	a Cimpa-ICTP research school on Lattices and application to cryptography and coding theory Saigon University, Ho Chi Minh City, August 1st-12th 2016 International Participants 1 Ankur DocID: 1uNEl - View Document
	Preventing Pollution Attacks in Multi-Source Network Coding Dan Boneh† Stanford University, USA Shweta Agrawal∗ DocID: 1uibH - View Document