First Page | Document Content | |
---|---|---|
![]() Date: 2006-02-20 20:05:19Homomorphic encryption Paillier cryptosystem Goldwasser–Micali cryptosystem ElGamal encryption RSA XTR Communication complexity Oblivious transfer Blum–Goldwasser cryptosystem Cryptography Public-key cryptography Electronic commerce | 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 |