As famously noted by the Greek philosopher Heraclitus, “the only constant in life is change.” This idea couldn’t be more true in today’s digital security world, where new technologies emerge, old ones fade, and every breakthrough brings both opportunity and risk.
Nowadays, this constant change is especially evident in the rise of quantum computing. A recent 2025 State of Quantum report by IQM Quantum Computers highlights how quickly the field is advancing. The report projects that the global quantum computing market will surpass $22 billion by 2032, driven by commercial adoption and its integration with AI and high-performance computing (HPC). This rise didn’t appear overnight, it traces back to the 1980s, when physicists like Richard Feynman and David Deutschfirst imagined using quantum computers to simulate quantum systems.
Four decades later, that vision has left the lab and turned into a global race across research and industry. Quantum computing now promises breakthroughs in medicine, materials, finance, and beyond. At the same time, its immense computational power introduces new risks, particularly for the security systems that protect everything from national infrastructure to private data.
Before we can face that future, we need to understand what’s at stake. That means asking a few key questions.
- What is cryptography, and why do we rely on it?
- What makes quantum computers so different from the machines we use today?
- And most importantly, how can we build security systems that are ready for what’s coming next?
Finding those answers will point us toward a stronger and more adaptable approach to digital security that can evolve with whatever comes next.
What is Cryptography?
Imagine you’re in a crowded room. You lean toward your friend to share something private, but you don’t want anyone else to understand. So, you both switch to a language only the two of you know. Everyone can hear you, but no one can make sense of what you’re saying. That’s cryptography in spirit, turning open communication into something only the intended person can understand.
In technical terms, cryptography is the science of securing information by transforming it into an unreadable format that only authorized individuals can decipher. As Monther Tarawneh explains in Cryptography: Recent Advances and Research Perspectives, this process, known as encryption, underpins nearly everything we trust online, from personal messages to banking systems and classified data.
To truly understand how cryptography works today, it’s helpful to look at where it all began. Cryptography has come a long way from its early beginnings. In ancient times, it involved simple techniques like rearranging letters or replacing them with symbols to keep messages secret. One of the oldest known methods is the Caesar cipher, used by Julius Caesar to send military messages in code. Over the centuries, these techniques grew more sophisticated, especially during wartime and in diplomacy. However, a true transformation in cryptography came with the rise of computers in the 20th century, which enabled a shift from simple, paper-based codes to complex mathematical algorithms that now power today’s digital security.
If you want to dive deeper into this field, Understanding Cryptography by Christof Paar and Jan Pelzl is a solid place to start. It’s written for students and professionals. However here, we’ll stay focused on the broader concepts like how cryptography actually works in the modern world.
As I said before unlike the ancient codes written on paper, modern cryptography is built on complex mathematics. At its core lies what experts call Computational Hardness Assumptions, problems so difficult that solving them without the proper tools would take an unrealistic amount of time. At the center of it everything revolves around keys. Which are unique pieces of information used to lock (encrypt) and unlock (decrypt) data. So without the correct key, even an intercepted message is nothing more than noise.
To understand how these ideas are applied in practice we need to look at the two main forms of cryptography used today: symmetric and asymmetric.
In symmetric cryptography, the same key locks and unlocks the message, like a diary that opens with a single key. It’s fast and efficient, making it perfect for encrypting large volumes of data. The problem isn’t speed — it’s trust. Both parties must already share the same secret key, and sending that key securely is the tricky part. If it falls into the wrong hands, the entire system collapses.
Asymmetric cryptography flips the model. Instead of one shared key, it uses a pair: a public key that anyone can use, and a private key that only you control. Someone can encrypt a message using your public key, but only your private key can unlock it. There’s no need to exchange a secret beforehand, which solves the key distribution problem that symmetric systems struggle with.
Now that we understand how cryptography works, the next question is, why does it matter so much in our everyday lives?
Why Cryptography Matters?
This question isn’t just theoretical; it touches our lives more than we realize. Think about it: We live in a world where sharing personal information has become second nature. Every time we unlock a phone, send a message, make a payment, or upload photos to the cloud, we hand pieces of our private lives to digital systems. Yet few of us stop to think about what keeps that data safe. The answer is cryptography — an invisible lock that ensures only the right person, device, or service can open what belongs to you.
Take a moment to imagine this: waking up to find your online wallet emptied overnight. That’s exactly what thousands of users experienced in 2022 when attackers slipped past Crypto.com’s defenses, bypassed two-factor authentication, and drained over $33 million in cryptocurrency.
And it wasn’t an isolated case. Remember the Heartbleed bug? A small flaw buried deep inside OpenSSL — one of the world’s most trusted encryption libraries — quietly exposed private keys and sensitive data across the internet. Fixing it took months and affected everything from websites to routers, showing how a single vulnerability can ripple through global systems.
Even today, the lesson repeats itself. Cybersecurity researcher Jeremiah Fowler recently found a database with more than 184 million account credentials — no passwords, no encryption, just plain text usernames and emails from platforms like Google, Apple, and Facebook. It was a digital open door, proving what happens when cryptography is missing altogether.
These real-world failures remind us of a simple truth: encryption isn’t just a technical feature — it’s the foundation of digital trust. It’s what keeps our data, identities, and systems intact in a world where everything is connected. Without it, both individuals and organizations would stand exposed in a world where every new innovation expands the attack surface.
The Strength of Today’s Cryptography — and Its Limits
After hearing about all those breaches, it’s natural to wonder if anything online is truly secure. The good news is that most failures don’t come from flaws in the encryption itself, but from weak passwords, outdated software, or human mistakes. The mathematics behind modern cryptography remains remarkably strong — so strong, in fact, that breaking it with today’s computers would take millions of years.
To see this in perspective, consider AES‑256, one of the most widely used encryption standards in the world. Banks, governments, and cloud providers rely on it to keep sensitive information safe. Even if someone used the world’s fastest supercomputers, like El Capitan at the Lawrence Livermore National Laboratory, which has over 11 million cores and can perform more than a billion billion calculations per second, cracking a single AES‑256 key would take an astronomically long time, on the order of 1⁰⁵¹ years. That’s far longer than the age of the universe.
In simple terms, AES‑256 is like a lock with so many combinations that no amount of brute-force guessing could ever open it in a human lifetime. This incredible strength gives us confidence that our messages, payments, and personal data remain secure in today’s digital world.
That confidence, however, rests on a single assumption: that today’s computers, even the fastest in the world, are not powerful enough to break these encryption systems. However, emerging technologies, especially Quantum Computing, call this belief into question.
In the next few sections, we’ll take a closer look at quantum computing — what it is, how it works, and why experts are so concerned about the potential impact it could have on the encryption systems we rely on every day.
What is Quantum Computing? Why the World is Concerned?
Let’s be honest — quantum computing can sound intimidating. But don’t worry, we’re not going to drown in equations or physics here. If you want to go really deep, I highly recommend the book Serious Cryptography — A Practical Introduction to Modern Encryption by Jean-Philippe Aumasson. It’s a great guide for anyone curious about how modern encryption works and how quantum computing might change the game.
For now, let’s keep it simple here. Imagine you’re standing in a massive library, searching for a single book among millions of shelves. A regular computer is like a person walking up and down each aisle, checking every shelf one by one. It will eventually find the book, but it could take a very long time. Now, imagine you had a magical friend who could look at every shelf all at once and instantly tell you where the book is. That’s a little like what a quantum computer can do.
Quantum computers operate using quantum bits, or qubits, which can exist in multiple states at the same time. This property, called superposition, allows them to explore many possibilities simultaneously. Qubits can also be entangled, meaning the state of one qubit is linked to another, no matter how far apart they are. Together with a phenomenon called interference, these properties let quantum computers process information in a highly coordinated and parallel way — something no classical computer can do.
This extraordinary power is exactly why experts are paying close attention. Quantum computers don’t just promise faster calculations — they could eventually do things that are essentially impossible today. Specialized algorithms like Shor’s and Grover’s have already been tested on smaller, outdated key sizes of current encryption standards, proving that they can break encryption in practice. If scaled up to a sufficiently large and stable quantum computer, these same algorithms could threaten the key sizes currently recommended for public-key cryptosystems, such as RSA-2048, which secure much of today’s digital world.
Right now, quantum computers exist, but they are still small, error-prone, and far from practical for breaking encryption. These machines are part of what researchers call the NISQ era — Noisy Intermediate-Scale Quantum — where qubits are limited and prone to mistakes. A fully capable, cryptographically relevant quantum computer (CRQC) would need thousands or even millions of highly stable, error-corrected qubits — a feat that remains a massive engineering challenge.
Even though these super-powerful quantum machines aren’t here yet, the potential impact is something we all need to pay attention to. Think about everything you do online today — your emails, chat messages, photos, bank details, or even documents you store in the cloud. It might seem harmless now, but years from now, that same information could still be extremely valuable. Like Old emails could reveal secrets, financial records could be exploited, and personal information could be used for identity theft, fraud, or even to trick you or others in clever scams.
The bottom line is this: the quantum machines of today can’t yet break the encryption that keeps our data safe, but the ones of tomorrow could. That’s why the conversation isn’t about “if” but “when” and “how” we prepare. In the next section, we will look at the approach, Post Quantum Cryptography, that the world is currently focusing on, which is being developed to protect our digital information against the next generation of computing power.
How Post-Quantum Cryptography Aims to Protect Us from Quantum Computing?
We’ve seen how quantum computers could one day challenge the very foundations of today’s encryption. It might feel like a recent concern, but the roots of this story go way back. Physicists like Feynman and Manin were already imagining quantum computers in the early 1980s. Nobody knew exactly what these machines would do, but the idea lingered — quietly shaping conversations about what “security” might mean in the future.
Then, in the mid-1990s, Shor published the algorithm that changed everything. It showed that RSA and ECC — two pillars of modern cryptography — would collapse if large quantum computers became real. That wasn’t a small revelation. It lit up the entire field and forced cryptographers to look at their toolbox with fresh eyes. What was broken? What might survive? What was needed was something completely new?
Here’s the twist: most of the approaches that later became “post-quantum cryptography” didn’t start as quantum-resistant ideas at all. Code-based and hash-based schemes were around in the 1970s, right next to the birth of RSA. The first multivariate designs showed up in the late 80s. Even lattice-based cryptography — today’s superstar — appeared just two years after Shor’s algorithm. None of them were created for a quantum world, but they turned out to be perfect candidates once the need became obvious.
As the implications of Shor’s work sank in, the research community shifted gears. New workshops popped up. The first dedicated conference on post-quantum cryptography happened in 2006. Ideas matured. Some early hopes faded — Rainbow, for example, didn’t survive real-world cryptanalysis. But others kept gaining traction. Gradually, the field solidified into the major branches we know today: lattices, hashes, codes, multivariates, and isogeny-based schemes.
By 2016, the momentum was strong enough that NIST launched a global competition to standardize the next generation of cryptographic algorithms. Anyone could join. Researchers sent in 82 proposals, representing decades of work from every corner of the world. After three rounds of intense scrutiny, only four made it through:
Kyber (now ML-KEM), Dilithium (now ML-DSA), SPHINCS+ (now SLH-DSA), and Falcon (waiting for final standardization).
These weren’t just upgrades. They were a different way of thinking — algorithms built for today’s computers but strong enough to face tomorrow’s quantum machines. ML-KEM gives us a practical, mostly drop-in replacement for key agreement. ML-DSA, SLH-DSA, and FN-DSA give us a spectrum of signature schemes, each with different strengths and trade-offs. None of them is perfect, but together they form a solid first generation of standards.
Getting the algorithms ready was only half the journey. The real world has to use them, and every protocol — from TLS to DNSSEC to X.509 — needs to decide how these building blocks fit into actual systems. Some transitions happened fast. Hybrid key agreements like X25519MLKEM768 are already widely deployed in major browsers, operating systems, and TLS libraries. In contrast, signatures have been much harder to standardize. Choices about prehashing, private key formats, and hybrid certificates triggered long debates, with drafts ballooning to eighteen variants before slowly being narrowed down.
And that’s where we are today: in an odd in-between phase. A huge portion of Internet traffic is already protected by post-quantum key agreement. Yet not a single publicly trusted post-quantum certificate exists. CAs, browsers, root programs, and hardware vendors are all preparing, but the earliest real PQC certificates will likely arrive in 2026 — and widespread trust may not come until 2027 or later.
So even with the first generation of PQC standards ready, and even with strong algorithms in hand, the transition is far from simple.
That brings us to the next big question:
If the world finally has quantum-safe algorithms, what’s stopping us from switching everything over right now?
To answer that, we need to look at the past transitions in the cryptographic world to see how hard it is to move an entire global ecosystem forward overnight.
Why Adoption of PQC Isn’t Instant?
Moving the world’s cryptography to post-quantum standards is not a switch you flip. It is a long, cautious migration, and history shows why.
When weaknesses in DES became undeniable in the late 1990s, the industry did not replace it overnight. Instead, it introduced Triple DES as a stopgap, buying time while AES was designed, standardized, and gradually deployed. The delay was not a denial. It was risk management. Replacing a core cryptographic primitive meant updating hardware, software, compliance processes, and operational playbooks.
The same pattern appeared with asymmetric cryptography. RSA and Diffie-Hellman enabled secure communication over untrusted networks, but adoption was slow and uneven. Existing systems were built around symmetric keys, certificate management introduced new operational complexity, and early hardware struggled with the computational cost. Even later, when elliptic-curve cryptography offered efficiency and strong security, migration away from RSA required careful coordination and hybrid deployments to preserve interoperability. Progress happened, but always incrementally.
Post-quantum cryptography faces these same structural constraints, only at a larger scale. Algorithms such as ML-KEM and ML-DSA are designed to resist quantum attacks, but they come with larger keys, bigger certificates, and different performance trade-offs. Deploying post-quantum algorithms affects every layer of the stack. Protocols must accommodate new algorithm identifiers and much larger handshake messages. Cryptographic libraries need new implementations and API changes, while existing hardware accelerators often cannot efficiently support PQC workloads. Browsers and servers must balance interoperability with legacy peers, and internal operational systems, from certificate issuance to monitoring, require updates to handle new key and signature formats. Larger message sizes stress network assumptions, and protocol ossification and backward compatibility constraints further slow deployment.
At the same time, post-quantum cryptography is still new. Although these algorithms have gone through extensive analysis and standardization, they have not yet benefited from decades of real-world deployment and adversarial testing in the way classical cryptography has. At Internet scale, that uncertainty matters.
This is why PQC deployment has largely followed a hybrid approach. By combining post-quantum algorithms with well-understood classical ones, systems can gain early quantum resistance while limiting the risk of relying entirely on cryptographic primitives that are still proving themselves in practice. Even today, adoption varies widely across ecosystems, not because the threat is misunderstood, but because changing cryptography at Internet scale is inherently complex — and because doing it safely requires caution as much as urgency.
This leaves a practical question. If the transition will take years and the crypto landscape may keep shifting, how do we avoid repeating the same painful migrations again and again?
Cryptographic Agility
Cryptographic agility is the answer to that problem. It is not a new algorithm. It is a design choice.
An agile system treats cryptography as a replaceable component. Algorithms can be introduced, configured, and retired without redesigning the application, breaking the protocol, or rebuilding the entire environment. The goal is to make a change routine rather than a crisis.
This matters in the post-quantum transition because we are operating in a long in-between phase. Hybrids, new certificate formats, and evolving guidance will continue for years. Systems that hard-code a single cryptographic choice will keep getting stuck. Systems designed for agility can move with the standards, respond to new findings, and upgrade with less disruption.
In the next section, we will look at what agility means in practice, where it shows up in real stacks like TLS and PKI, and what organizations can do to make cryptographic change safer and faster.
What Cryptographic Agility Looks Like in Practice
Cryptographic agility is easy to describe in theory, but it only becomes meaningful when it is reflected in real systems. In practice, agility is less about new algorithms and more about architectural choices that decide how tightly cryptography is bound to everything else.
Cryptographic agility is easy to describe in theory, but it only becomes meaningful when it is reflected in real systems. In practice, agility is less about new algorithms and more about architectural choices that decide how tightly cryptography is bound to everything else.
The first place this becomes visible is at the protocol level. Modern security protocols increasingly avoid hard-coding a single algorithm and instead rely on negotiation. During a TLS handshake, for example, the client and server agree on which cryptographic primitives to use rather than assuming a fixed choice. What began as a mechanism for compatibility has become a key enabler for post-quantum and hybrid deployments, allowing new algorithms to be introduced gradually without breaking communication with older peers.
The second pillar of agility sits one layer lower, in the cryptographic engines and their integration points. When applications interact with cryptography through stable, abstract interfaces, algorithms can evolve underneath them. Libraries such as NSS and OpenSSL become the control plane: they select algorithms, route operations, and enforce policy. The more modular these layers are, the easier it is to introduce new cryptography without rewriting applications.
This is where the idea of a shallow loadable module matters. In a shallow design, the module does not “own” the cryptography in the traditional sense. It does not embed a monolithic, fixed implementation of each algorithm. Instead, it focuses on integration: exposing algorithms through a stable interface, translating calls, and delegating the actual cryptographic computation to underlying libraries. That separation is what makes the system adaptable. If implementations change, mature, or need to be swapped, the surrounding stack does not have to be redesigned.
A concrete example of this approach can be seen in QUBIP’s Quantum-Secure Internet Browsing pilot. On the client side, the pilot extends Firefox’s cryptographic core (NSS) by loading an external module at runtime. That module, qryptotoken, is intentionally built as a shallow module. It plugs into NSS through the standard interface, advertises post-quantum and hybrid mechanisms, and routes operations such as encapsulation and signing to the chosen backend implementations. From Firefox’s perspective, the cryptographic boundary stays the same. What changes is the set of capabilities available behind it.
The same architectural principle appears on the server side with OpenSSL. QUBIP’s aurora module uses OpenSSL’s provider model in the same shallow spirit. It exposes post-quantum and hybrid algorithms through the standard EVP APIs, while delegating the heavy cryptographic work to external implementations. This keeps application code stable, reduces the surface area of change, and makes it easier to update or replace algorithm backends as the ecosystem evolves.
Taken together, these examples show what cryptographic agility looks like when it is real. It is not only algorithm negotiation in protocols. It is also modular integration, shallow modules and providers, and the ability to swap cryptographic backends without dragging the entire system through another painful redesign. That is the kind of flexibility the post-quantum transition demands — and the kind of design that will matter for whatever comes after it.
Conclusion: Designing for Change, Not Certainty
The challenge posed by quantum computing is often framed as a race to deploy new algorithms before old ones fail. But the deeper lesson is more subtle. Cryptography has never been static, and it never will be. What post-quantum cryptography exposes is not just a future threat, but a long-standing weakness in how security systems have been built around the assumption of permanence.
Post-quantum algorithms such as ML-KEM and ML-DSA represent an important step forward, but they are not a final destination. Their deployment highlights familiar constraints: slow transitions, operational risk, backward compatibility, and uncertainty that can only be resolved through time and real-world use. Hybrid approaches have emerged not as a compromise, but as a rational response to these realities, balancing urgency with caution.
What ultimately matters is not how quickly a single algorithm is adopted, but whether systems are prepared to evolve. Cryptographic agility shifts the focus from choosing the “right” primitive to designing architectures that can change without breaking. Modular integration, shallow modules and providers, negotiable protocols, and adaptable operational practices turn cryptographic change from a crisis into a manageable process.
In this sense, post-quantum cryptography is a stress test. It reveals which systems are flexible enough to absorb change and which are not. The systems that succeed will be those that treat cryptography as a living component of infrastructure, not a fixed dependency frozen in time.
The quantum era will arrive gradually, not suddenly. Preparing for it does not mean betting everything on new algorithms today. It means building security systems that are ready for whatever comes next — not just quantum computers, but the next shift we cannot yet predict.
Security researcher and engineer focused on offensive security. I spend my time understanding how systems break, tracing vulnerabilities and attack paths, and sharpening those skills through hands-on penetration testing labs on Hack The Box and TryHackMe.