First Page | Document Content | |
---|---|---|
Date: 2011-10-10 23:51:30Electronic commerce Computational hardness assumptions Hidden Field Equations Pseudorandom generator RSA XTR Learning with errors Clique problem One-way function Cryptography Finite fields Public-key cryptography | Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡Add to Reading ListSource URL: www.boazbarak.orgDownload Document from Source WebsiteFile Size: 497,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 |