SPRING: Fast Pseudorandom Functions from Rounded Ring Products Abhishek Banerjee1 - -ring - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2018-06-14 07:12:40 Mathematics Algebra Cryptography Post-quantum cryptography Polynomials Lattice-based cryptography Coding theory SWIFFT BCH code Polynomial ring Learning with errors Binomial coefficient		SPRING: Fast Pseudorandom Functions from Rounded Ring Products Abhishek Banerjee1? , Hai Brenner2?? , Ga¨etan Leurent3 , Chris Peikert1? ? ? , and Alon Rosen2† 1 Add to Reading List Source URL: who.rocq.inria.fr Download Document from Source Website File Size: 401,66 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