Back to Results
First PageMeta Content
Cryptography / Mathematics / Algebra / Finite fields / Computational hardness assumptions / Integer factorization algorithms / Emerging technologies / Quantum computing / RSA / Euclidean algorithm / Quantum algorithm / XTR


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 lets
Add to Reading List

Document Date: 2018-08-26 18:23:27


Open Document

File Size: 614,35 KB

Share Result on Facebook