Quantum Computing Is Coming

When most people hear quantum computing, they imagine faster computers. In reality, quantum computers represent something much more significant for cybersecurity—they have the potential to break many of the cryptographic systems that secure the internet today.

As part of my research on quantum-resistant cryptography, I explored how quantum algorithms threaten existing encryption methods and what can be done to prepare for a post-quantum world.

Why Today's Encryption Works

Modern public-key cryptography relies on mathematical problems that are easy to perform but extremely difficult to reverse.

Take RSA as an example. Its security comes from multiplying two very large prime numbers together. Multiplication is trivial, but given only the resulting number, finding those original prime factors is computationally infeasible for classical computers.

Even efficient classical algorithms eventually become impractical. A modern RSA key is generated using prime numbers hundreds of digits long, making brute-force factorization effectively impossible with today's hardware.

Enter Quantum Computing

Quantum computers don't simply execute instructions faster—they solve certain mathematical problems differently.

Using properties such as superposition and entanglement, quantum algorithms can evaluate many possibilities simultaneously instead of sequentially.

This difference becomes important because the security of RSA depends entirely on how difficult integer factorization is.

Shor's Algorithm Changes Everything

In 1994, mathematician Peter Shor introduced an algorithm capable of factoring large integers exponentially faster than classical approaches.

Instead of attacking RSA through brute force, Shor's algorithm transforms the problem into one of period finding. By exploiting periodic patterns in modular arithmetic and using the Quantum Fourier Transform, a sufficiently powerful quantum computer can efficiently recover the prime factors used to generate RSA keys.

As part of my project, I implemented classical demonstrations of factorization alongside simulations of Shor's algorithm. Even in simulation, the quantum approach demonstrated why quantum algorithms are fundamentally different rather than simply faster.

Does That Mean All Encryption Is Broken?

Fortunately, no.

Quantum computing primarily threatens public-key cryptography such as RSA, Diffie-Hellman, and Elliptic Curve Cryptography.

Symmetric encryption, including AES, is far more resilient. While quantum algorithms such as Grover's Algorithm reduce the effective security level of symmetric keys, increasing key sizes provides an effective defense. AES-256 remains widely regarded as a practical long-term solution.

The Real Threat Exists Today

One of the most overlooked quantum risks isn't future decryption—it's future access to data being collected today.

This concept is known as Store Now, Decrypt Later (SNDL).

Attackers may intercept encrypted communications today, even if they cannot decrypt them immediately. Once sufficiently capable quantum computers become available, that archived data could be decrypted years later.

For organizations handling healthcare records, financial transactions, legal documents, or government communications, this presents a long-term security concern.

Preparing for a Post-Quantum World

Rather than waiting for quantum computers to mature, researchers have been developing Post-Quantum Cryptography (PQC).

Unlike quantum cryptography, PQC runs on today's classical computers while relying on mathematical problems believed to resist both classical and quantum attacks.

Some of the leading approaches include:

Lattice-based cryptography

Hash-based digital signatures

Multivariate polynomial cryptography

Code-based cryptography

These algorithms are currently undergoing standardization and evaluation to replace vulnerable public-key systems in the coming years.

My Project

For my research project, I explored how post-quantum cryptography could be applied to secure communications in a healthcare setting.

I developed a proof-of-concept telemedicine application that combined a post-quantum key encapsulation mechanism (NewHope) with AES encryption. The idea was simple: use a quantum-resistant algorithm to securely exchange the encryption key while continuing to use AES for efficient data encryption.

Although the implementation was experimental and intended for research purposes, it demonstrated how existing communication systems could begin transitioning toward quantum-resistant architectures.

Looking Ahead

Quantum computers capable of breaking modern encryption are not yet available, but preparing for them cannot wait until they arrive.

Migrating global infrastructure—from browsers and banking systems to healthcare platforms and cloud services—will take years. Organizations that begin evaluating post-quantum cryptography today will be far better positioned for the future.

The quantum era isn't just about faster computation. It's about rethinking the mathematical foundations of digital trust.