First Page | Document Content | |
---|---|---|
![]() Date: 2010-05-10 03:44:31Finite fields Post-quantum cryptography McEliece cryptosystem Error detection and correction Forward error correction Key size XTR RSA Quantum computer Cryptography Public-key cryptography Electronic commerce | Source URL: eprint.iacr.orgDownload Document from Source WebsiteFile Size: 392,83 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 |