"It's a quantum algorithm used for integer factorization. It's important because it can, in theory, be used to break the widely used public-key cryptography scheme known as RSA. RSA is based on the assumption that factoring large numbers is computationally infeasible. This assumption is valid for classical computers. No classical algorithm is known that can factor in polynomial time... Professor Rush?"

This unnamed student studied under Dr. Nicholas Rush at the University of California, Berkeley. (SGU: "Human")

Community content is available under CC-BY-SA unless otherwise noted.