.
powerful enough to render classical cryptosystems obsolete. Shor’s algorithm, developed by American mathematician Peter Shor in 1994, is an algorithm that can factorize an integer on a ‘feasible’ quantum computer in polynomial time. Shor’s algorithm breaks the RSA cryptosystem. Even worse, the main