Cryptography from Post-Quantum Assumptions Raza Ali Kazmi Doctor of Philosophy

First Page		Document Content
Date: 2015-04-18 18:23:29 Homomorphic encryption Post-quantum cryptography Learning with errors Quantum computer Zero-knowledge proof Public-key cryptography RSA Random self-reducibility Oblivious transfer Cryptography Lattice-based cryptography Lattice problem		Cryptography from Post-Quantum Assumptions Raza Ali Kazmi Doctor of Philosophy Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 418,73 KB Share Document on Facebook

	Lecture 19, Thurs March 30: RSA and Shor’s Algorithm Today we’ll see Shor’s algorithm. Given a positive integer N, which we’ll assume for simplicity is a product of two primes \|and , this algorithm lets DocID: 1xVSj - View Document
	PDF Document DocID: 1xRwQ - View Document
	PDF Document DocID: 1xu6k - View Document
	PDF Document DocID: 1x9q3 - View Document
	PDF Document DocID: 1x1dn - View Document