First Page | Document Content | |
---|---|---|
![]() Date: 2010-10-04 17:47:43Zero-knowledge proof RSA Goldwasser–Micali cryptosystem Pseudorandomness Computational indistinguishability Index of cryptography articles Cryptography Electronic commerce Public-key cryptography | Add to Reading List |
![]() | 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 |