Shor’s Algorithm is a quantum algorithm that can solve integer factoring and discrete logarithm problems far more efficiently than known classical algorithms. Those mathematical problems underpin important public-key cryptographic systems, including RSA and elliptic-curve cryptography (ECC). A sufficiently powerful, fault-tolerant quantum computer could therefore undermine cryptographic systems that banks and other financial institutions rely on today.
For a bank CISO, CIO, CTO, or security leader, this is not simply an academic topic. RSA and ECC are used across many security protocols and trust systems, including TLS, digital certificates, authentication, digital signatures, and public-key infrastructure (PKI). Understanding what Shor’s Algorithm can do – and what it cannot do – is an important starting point for understanding post-quantum cryptography (PQC) migration.
What Is Shor’s Algorithm?
Shor’s Algorithm is a quantum algorithm developed by mathematician Peter Shor in 1994. It provides an efficient quantum approach to integer factorization and also to discrete logarithm problems. These problems are important in cryptography because the difficulty of solving them with classical computers is part of the security foundation of RSA and ECC.
For RSA, the relevant problem is integer factorization. Generating the product of two large primes is relatively easy, while recovering those primes from the product is computationally difficult for classical computers at cryptographically relevant sizes. Shor’s Algorithm changes that picture: on a sufficiently powerful fault-tolerant quantum computer, factoring can be performed in polynomial time.
The important point is not that a quantum computer simply “tries more keys.” Shor’s Algorithm changes the computational method used to solve the underlying mathematical problem.
How Does Shor’s Algorithm Work?
Shor’s Algorithm does not factor a large number by testing every possible factor one at a time. Instead, it reduces the factoring problem to a related mathematical problem called order finding.
The Factoring Problem
Suppose an RSA modulus is created by multiplying two large prime numbers. Recovering those prime factors from the public modulus is difficult for classical computers at cryptographically relevant sizes.
The best known classical factoring methods are substantially less efficient than Shor’s quantum algorithm as the problem size increases. RSA security depends on this classical computational difficulty.
Order Finding
Shor’s key insight is that integer factoring can be reduced to finding the order of a number modulo the integer being factored.
In simple terms, the order describes when a modular sequence repeats. Once the relevant period is identified, classical mathematical operations can use that information to derive factors of the original number with high probability.
The difficult part is finding that period efficiently. This is where the quantum portion of Shor’s Algorithm becomes important.
The Role of the Quantum Fourier Transform
The Quantum Fourier Transform helps extract information about the periodic structure of the function used by Shor’s Algorithm.
A quantum computer prepares and processes a superposition of states, and quantum interference concentrates useful information about the period. Measurement then provides information that, together with classical post-processing, can be used to determine the order and ultimately the factors.
This quantum-classical combination is what gives Shor’s Algorithm its theoretical advantage over classical factoring methods.
What Is Quantum Factoring?
Quantum factoring means using a quantum algorithm to solve integer factorization problems. Shor’s Algorithm is the best-known quantum algorithm for this purpose.
Classical factoring algorithms become increasingly difficult to run as the size of the integer grows. Shor’s Algorithm offers a polynomial-time quantum solution under the fault-tolerant quantum computing model.
That distinction matters to RSA. RSA is designed around the assumption that factoring large integers remains computationally difficult. If sufficiently capable quantum computers become available, Shor’s Algorithm would undermine that assumption.
How Shor’s Algorithm Threatens RSA Encryption
RSA uses a public modulus derived from large prime factors. The security of the private key depends on the difficulty of recovering those factors from the public information.
A sufficiently powerful quantum computer running Shor’s Algorithm could factor an RSA modulus and thereby recover information needed to derive the corresponding private key. That would undermine RSA’s security for applications that depend on the private key remaining computationally protected.
ECC faces a related problem. Elliptic-curve systems such as ECDSA and ECDH rely on the difficulty of the elliptic curve discrete logarithm problem. Shor’s Algorithm also provides an efficient quantum approach to discrete logarithms.
This means RSA and ECC are exposed to the same broad class of quantum threat, even though they rely on different mathematical constructions.
For financial institutions, that matters because RSA and ECC can appear in public-key infrastructure, digital certificates, key establishment, authentication, digital signatures, and other security protocols.
Does Shor’s Algorithm Break All Encryption?
No.
Shor’s Algorithm primarily threatens public-key cryptography based on integer factorization and discrete logarithms, including RSA and ECC. It does not provide the same type of attack against symmetric encryption such as AES.
Symmetric cryptography faces a different quantum consideration through Grover’s Algorithm, which provides a theoretical quadratic speedup for unstructured search. That is materially different from Shor’s polynomial-time attack on factoring and discrete logarithms.
NIST’s current guidance indicates that existing AES key sizes can continue to be used while it assesses when a transition of symmetric-key algorithms is needed. The immediate PQC migration priority is therefore largely centered on vulnerable public-key cryptography rather than replacing AES simply because of Shor’s Algorithm.
The practical takeaway is:
Shor’s Algorithm threatens the public-key trust and key-establishment layer; it does not simply break every form of encryption.
Shor’s Algorithm vs. Grover’s Algorithm
| Algorithm | Primary Problem | Cryptographic Impact |
| Shor’s Algorithm | Integer factoring and discrete logarithms | Threatens RSA, ECC and other public-key systems based on these problems |
| Grover’s Algorithm | Unstructured search | Provides a quadratic speedup for generic key search against symmetric cryptography |
Understanding this distinction prevents an important misconception: quantum computing does not mean every encryption algorithm becomes equally vulnerable.
Why Shor’s Algorithm Matters to Banks
Public-key cryptography is part of the trust infrastructure behind many banking systems. RSA and ECC may support TLS connections, digital certificates, authentication, digital signatures, PKI, and secure communications.
Banks also have to consider the longevity of sensitive information. Account records, loan documentation, transaction histories, identity information, legal records, and other financial data can remain sensitive for years or decades.
A second challenge is dependency. A financial institution may rely on cryptographic functionality inside applications, APIs, certificates, network equipment, hardware security modules, cloud services, core banking platforms, payment systems, and third-party products. A PQC migration therefore cannot be treated as a single algorithm replacement.
The combination of public-key cryptographic dependencies, long-lived sensitive information, and third-party technology makes quantum readiness a strategic issue for financial institutions.
Can Shor’s Algorithm Break RSA Today?
No.
There is no public evidence that today’s quantum computers can break production-scale RSA-2048 or ECC at practical scale. Running Shor’s Algorithm against cryptographically relevant key sizes requires a large-scale, fault-tolerant quantum computer with sufficient error-corrected resources.
Current demonstrations of Shor’s Algorithm have focused on small numbers and proof-of-concept implementations. They do not demonstrate the ability to break real-world RSA or ECC deployments.
That distinction is important. The risk is not that banks should assume RSA has already been broken by a quantum computer. The risk is that cryptographic migration takes time, while the exact arrival date of a cryptographically relevant quantum computer remains uncertain.
Why Banks Should Prepare Before Q-Day
The uncertainty around the exact timing of a cryptographically relevant quantum computer is one reason organizations should not treat migration as a last-minute project.
There are two timelines to consider.
The Migration Timeline
Replacing or upgrading cryptography across a financial institution can involve legacy applications, vendor integrations, PKI, certificates, hardware security modules, APIs, network systems, and third-party dependencies.
Before migration begins, organizations need visibility into where vulnerable cryptography is used and which systems depend on it. Testing, interoperability, vendor coordination, governance, and phased deployment can add significant time.
The Harvest Now, Decrypt Later Timeline
Harvest Now, Decrypt Later (HNDL) describes a scenario in which adversaries collect encrypted information today and retain it for possible decryption in the future.
For information that needs to remain confidential for many years, the future availability of quantum decryption capability can affect today’s security decisions.
That is why the relevant planning question is not only:
“When will a quantum computer break RSA?”
It is also:
“How long must our sensitive information remain confidential, and how much time will our organization need to migrate?”
How Post-Quantum Cryptography Addresses the Shor Threat
Post-quantum cryptography (PQC) refers to cryptographic algorithms designed to provide security against both classical and quantum attacks.
The relationship to Shor’s Algorithm is straightforward:
Shor’s Algorithm threatens certain existing public-key systems → PQC provides alternative public-key algorithms designed for the post-quantum threat model.
Instead of relying on integer factorization or discrete logarithms, standardized PQC algorithms use different mathematical constructions. For example, NIST’s first finalized PQC standards include lattice-based key establishment and digital signatures, as well as a hash-based digital signature standard.
PQC does not require a quantum computer. It is designed to run on conventional computing infrastructure and protocols, which is why migration can begin before cryptographically relevant quantum hardware exists.
What NIST PQC Means for Financial Institutions
In August 2024, NIST finalized three Federal Information Processing Standards for post-quantum cryptography:
- FIPS 203 – ML-KEM: a module-lattice-based key-encapsulation mechanism standard used for key establishment.
- FIPS 204 – ML-DSA: a module-lattice-based digital signature standard.
- FIPS 205 – SLH-DSA: a stateless hash-based digital signature standard.
These standards provide a foundation for replacing vulnerable public-key cryptography with quantum-resistant alternatives.
It is important to distinguish NIST standards from private-sector legal mandates. FIPS standards apply directly to U.S. federal systems and are also influential references for technology providers and organizations planning PQC migration. Private financial institutions should evaluate the specific laws, regulations, contractual requirements, supervisory expectations, and industry guidance that apply to them.
NIST is also actively developing migration guidance. Its current PQC program advises organizations to begin migrating systems toward quantum-resistant cryptography and to identify where vulnerable algorithms are being used.
Quantum Infinite’s Financial-Sector Experience
Quantum Infinite has also addressed post-quantum readiness directly with financial-sector stakeholders through the Texas Bankers ISAO session “Quantum Risk to Quantum Resilience: A Practical Session for Financial Institutions.” The official Texas Bankers ISAO event listing identifies Ravi Kumar, CTO of Quantum Infinite, as the presenter and describes the session as an executive-focused presentation for TX ISAO members, banks, financial institutions, and stakeholders.
View the Texas Bankers ISAO session
The webinar is relevant here as evidence of Quantum Infinite’s engagement with the financial sector. The technical explanation in this article is independently grounded in NIST and other authoritative sources.
What Banks Should Assess Before PQC Migration
PQC migration is not simply a matter of choosing a new algorithm. Financial institutions first need visibility into their cryptographic environment and the dependencies surrounding it.
Cryptographic Inventory
Identify where RSA, ECC, and other cryptographic algorithms are used across applications, infrastructure, certificates, protocols, and vendor systems.
Cryptographic Dependencies
Map the systems, applications, business processes, and third-party technologies that depend on those cryptographic implementations.
PKI and Certificate Dependencies
Assess certificate authorities, trust chains, keys, digital certificates, authentication systems, and certificate lifecycles. These dependencies can be deeply embedded across an enterprise.
HNDL Exposure
Identify data with long confidentiality requirements and assess whether it could be valuable to an adversary even if decryption is not currently possible.
Risk-Based Migration Prioritization
Not every system needs to move at exactly the same time. Prioritization should consider data sensitivity, confidentiality lifetime, business criticality, cryptographic exposure, regulatory requirements, and technical dependencies.
PQC Migration Roadmap
Develop a phased migration plan that connects cryptographic discovery to testing, interoperability, vendor coordination, deployment, governance, and ongoing crypto-agility.
How Quantum Infinite Supports Quantum-Ready Migration
Quantum Infinite positions its services around PQC readiness assessment, cryptographic discovery, Cryptographic Bill of Materials (CBOM) development, HNDL exposure analysis, dependency mapping, risk-based migration planning, pilot validation, and NIST-aligned PQC migration for financial institutions.
Its service model emphasizes a zero-data, air-gapped approach in which sensitive customer or transactional data remains within the institution’s controlled environment during the engagement. This approach is designed to support data sovereignty while organizations assess and plan their quantum-resistant migration.
For financial institutions evaluating their broader PQC migration strategy, Quantum Infinite’s PQC service offering provides more detail on its approach.
Frequently Asked Questions About Shor’s Algorithm
What is Shor’s Algorithm?
Shor’s Algorithm is a quantum algorithm that can efficiently solve integer factoring and discrete logarithm problems on a sufficiently powerful quantum computer. These problems underpin the security of RSA and ECC.
How does Shor’s Algorithm work?
It reduces integer factoring to a period-finding problem. Quantum techniques, including the Quantum Fourier Transform, help estimate the period, after which classical calculations can derive factors from the result.
What is quantum factoring?
Quantum factoring is the use of a quantum algorithm, particularly Shor’s Algorithm, to solve integer factorization problems more efficiently than known classical methods.
Can Shor’s Algorithm break RSA?
In principle, yes. A sufficiently powerful, fault-tolerant quantum computer running Shor’s Algorithm could factor an RSA modulus and undermine the security of the corresponding RSA key.
Can Shor’s Algorithm break encryption today?
No. Current quantum computers do not have the scale and fault tolerance required to attack production-scale RSA or ECC in practice.
Does Shor’s Algorithm break AES?
No. Shor’s Algorithm does not target AES. Symmetric cryptography is affected by different quantum attacks, particularly Grover’s Algorithm, which offers a quadratic speedup for generic search.
What is the difference between Shor’s Algorithm and Grover’s Algorithm?
Shor’s Algorithm targets integer factoring and discrete logarithms, creating a major threat to public-key systems such as RSA and ECC. Grover’s Algorithm provides a quadratic speedup for unstructured search, affecting the security margin of symmetric cryptography.
Why does Shor’s Algorithm matter to banks?
Banks use public-key cryptography in areas such as TLS, certificates, authentication, digital signatures, and PKI. These systems can depend on RSA or ECC, making quantum-resistant migration strategically important.
How does Post-Quantum Cryptography protect against Shor’s Algorithm?
PQC uses alternative mathematical constructions designed to resist known classical and quantum attacks. NIST’s finalized PQC standards provide standardized options for key establishment and digital signatures.
What are the NIST PQC standards?
NIST’s first three finalized PQC standards are FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), and FIPS 205 (SLH-DSA). ML-KEM is a key-encapsulation mechanism, while ML-DSA and SLH-DSA are digital signature standards.