First Page | Document Content | |
---|---|---|
Date: 2015-04-18 18:23:29Homomorphic 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 PhilosophyAdd to Reading ListSource URL: eprint.iacr.orgDownload Document from Source WebsiteFile Size: 418,73 KBShare 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 letsDocID: 1xVSj - View Document | |
PDF DocumentDocID: 1xRwQ - View Document | |
PDF DocumentDocID: 1xu6k - View Document | |
PDF DocumentDocID: 1x9q3 - View Document | |
PDF DocumentDocID: 1x1dn - View Document |