First Page | Document Content | |
---|---|---|
![]() Date: 2005-05-19 04:51:22Finite fields Error detection and correction Hash function XTR RSA MD5 Prime number Collision resistance Cryptography Search algorithms Public-key cryptography | Source URL: www.win.tue.nlDownload Document from Source WebsiteFile Size: 253,05 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 |