OurBigBook About$ Donate
 Sign in Sign up

Shor's algorithm

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Quantum algorithms
 1 By others on same topic  0 Discussions Create my own version
Shor's algorithm is a quantum algorithm developed by mathematician Peter Shor in 1994 for efficiently factoring large integers. It is significant because factoring large numbers is a fundamental computational problem that underpins the security of many classical cryptographic systems, such as RSA (Rivest-Shamir-Adleman) encryption. The classical methods for factoring integers are inefficient for large numbers, typically requiring exponential time in the size of the number.

 Ancestors (6)

  1. Quantum algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Shor's algorithm by Ciro Santilli 40 Updated 2025-07-16
 View more
Video 1.
Shor's algorithm Explained by minutephysics (2019)
Source.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook