• Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor...
    40 KB (5,812 words) - 21:44, 17 June 2025
  • quantum algorithms exploit generally cannot be efficiently simulated on classical computers (see Quantum supremacy). The best-known algorithms are Shor's algorithm...
    39 KB (4,560 words) - 14:59, 23 April 2025
  • an algorithm created to run on a quantum computer. In 1994, further progress toward quantum supremacy was made when Peter Shor formulated Shor's algorithm...
    54 KB (5,929 words) - 18:17, 23 May 2025
  • Thumbnail for Peter Shor
    particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical...
    14 KB (1,085 words) - 00:48, 18 March 2025
  • algorithms, such as Shor's algorithm,: 131  the quantum algorithm for linear systems of equations, and the quantum counting algorithm. The algorithm operates...
    14 KB (2,887 words) - 06:19, 25 February 2025
  • Thumbnail for Quantum computing
    classical algorithms. Quantum algorithms that offer more than a polynomial speedup over the best-known classical algorithm include Shor's algorithm for factoring...
    113 KB (12,430 words) - 14:39, 13 June 2025
  • purpose – would be able to factor in polynomial time, breaking RSA; see Shor's algorithm. Finding the large primes p and q is usually done by testing random...
    60 KB (7,783 words) - 17:51, 26 May 2025
  • on Shor's algorithm and Grover's algorithm. Of the two, Shor's offers the greater risk to current security systems. Derivatives of Shor's algorithm are...
    29 KB (3,225 words) - 01:39, 6 June 2025
  • it in polynomial time. Shor's algorithm takes only O(b3) time and O(b) space on b-bit number inputs. In 2001, Shor's algorithm was implemented for the...
    25 KB (2,983 words) - 11:39, 19 April 2025
  • running Shor's algorithm or possibly alternatives. As of 2024, quantum computers lack the processing power to break widely used cryptographic algorithms; however...
    63 KB (6,418 words) - 03:08, 19 June 2025
  • Shor and Shorshor, a 1926 Soviet film Shor's algorithm, a quantum algorithm for integer factorization Toots Shor's Restaurant, New York City Schor (disambiguation)...
    2 KB (180 words) - 16:56, 7 February 2025
  • Hidden subgroup problem (category Quantum algorithms)
    it especially important in the theory of quantum computing because Shor's algorithms for factoring and finding discrete logarithms in quantum computing...
    12 KB (2,031 words) - 13:15, 26 March 2025
  • taken by Grover's algorithm. Amplitude amplification Brassard–Høyer–Tapp algorithm (for solving the collision problem) Shor's algorithm (for factorization)...
    32 KB (4,691 words) - 00:04, 16 May 2025
  • computer. The quantum algorithm solving Simon's problem, usually called Simon's algorithm, served as the inspiration for Shor's algorithm. Both problems are...
    17 KB (3,247 words) - 12:46, 24 May 2025
  • popular public-key cryptosystems, it is resistant to attacks using Shor's algorithm. NTRUEncrypt was patented, but it was placed in the public domain in...
    12 KB (1,215 words) - 21:39, 20 April 2025
  • Quantum annealing (category Optimization algorithms and methods)
    universal quantum computer and, in particular, cannot execute Shor's algorithm because Shor's algorithm requires precise gate operations and quantum Fourier transforms...
    32 KB (3,406 words) - 23:39, 18 June 2025
  • (to break 128 bits of security). In comparison, using Shor's algorithm to break the RSA algorithm requires 4098 qubits and 5.2 trillion Toffoli gates for...
    39 KB (4,677 words) - 13:04, 20 May 2025
  • Thumbnail for Quantum engineering
    that could break current cryptography systems using methods such as Shor's algorithm. These methods include quantum key distribution (QKD), a method of...
    22 KB (2,248 words) - 05:33, 23 May 2025
  • Quantum Fourier transform (category Quantum algorithms)
    many quantum algorithms, notably Shor's algorithm for factoring and computing the discrete logarithm, the quantum phase estimation algorithm for estimating...
    20 KB (3,302 words) - 15:43, 25 February 2025
  • Thumbnail for Prime number
    general-purpose algorithm is RSA-240, which has 240 decimal digits (795 bits) and is the product of two large primes. Shor's algorithm can factor any integer...
    117 KB (14,179 words) - 21:25, 8 June 2025
  • elliptic-curve cryptosystems — which could, theoretically, be defeated using Shor's algorithm on a quantum computer — some lattice-based constructions appear to...
    24 KB (2,853 words) - 16:44, 3 June 2025
  • RSA Factoring Challenge (category Integer factorization algorithms)
    advances in quantum computers make this prediction uncertain due to Shor's algorithm. In 2001, RSA Laboratories expanded the factoring challenge and offered...
    15 KB (853 words) - 21:19, 4 May 2025
  • algorithm prime factorization algorithm Quadratic sieve Shor's algorithm Special number field sieve Trial division Lenstra–Lenstra–Lovász algorithm (also...
    72 KB (7,951 words) - 17:13, 5 June 2025
  • immune to attacks using Shor's algorithm and – more generally – measuring coset states using Fourier sampling. The algorithm is based on the hardness...
    16 KB (2,092 words) - 15:59, 4 June 2025
  • Thumbnail for Cryptanalysis
    phases of research, have potential use in cryptanalysis. For example, Shor's Algorithm could factor large numbers in polynomial time, in effect breaking some...
    44 KB (5,215 words) - 02:48, 19 June 2025
  • Thumbnail for Phase kickback
    exponentially quicker than classical algorithms. This is essential for quantum algorithms such as Shor’s algorithm, where quantum phase estimation is used...
    13 KB (1,715 words) - 23:35, 25 April 2025
  • Modular exponentiation (category Cryptographic algorithms)
    quantum computing, modular exponentiation appears as the bottleneck of Shor's algorithm, where it must be computed by a circuit consisting of reversible gates...
    21 KB (2,759 words) - 07:00, 17 May 2025
  • lemma Bellman–Ford algorithm (to do) Euclidean algorithm Kruskal's algorithm Gale–Shapley algorithm Prim's algorithm Shor's algorithm (incomplete) Basis...
    6 KB (593 words) - 20:11, 5 June 2023
  • Thumbnail for Timeline of quantum computing and communication
    conventional computer. This algorithm introduces the main ideas which were then developed in Peter Shor's factorization algorithm. Peter Shor, at AT&T's Bell Labs...
    235 KB (22,862 words) - 16:00, 16 June 2025
  • of Computational Assumptions Used in Cryptography Broken or Not by Shor's Algorithm" (PDF). "NIST Released NISTIR 8105, Report on Post-Quantum Cryptography"...
    40 KB (3,015 words) - 16:22, 12 June 2025