Broadcom Inc. Common Stock The Six Five Summit: AI Unleashed 2026

Yeah, it's great to be here.

Yeah, sure. Actually, let's start by bounding this a little bit. When we talk about post-quantum cryptography, we're not talking about cryptography that is done with a quantum computer or by a quantum computer. We're talking about cryptography that classical computers can use that is resistant to attacks from quantum computers. Everything we're going to be talking about today is about the cryptographic algorithms that run on classical computers. In terms of why this is a business problem versus a technology problem, it wasn't that long ago where cryptography was really a niche technology. I think the industry that was probably the biggest user of cryptography in the early days was the banking industry, where protecting ATMs and financial services transactions. If we look at the last, I would say, 10 to 15 years, cryptography has really evolved and has become ubiquitous.

It's really been an enabling technology for the larger IT transformation that's been taking place. Looking at web-based applications, APIs, hybrid cloud, and even emerging technologies like cryptocurrency and asset tokenization, they all rely on cryptography, and cryptography really serves as the foundation of trust for our modern IT world. Going back to your question, this is a business problem, right? Because it has evolved to become that foundation of trust, and if it gets broken, we have a business problem and a business challenge to address.

The elevator pitch, so I guess we got 3 minutes to get from the ground floor to the 22nd floor or something like that. The elevator pitch is, when you look at cryptography like RSA or elliptic curve cryptography, the security of that cryptography relies in the fact that there are certain mathematical problems that are difficult to solve and the public and private keys are mathematically related for these algorithms. For classical computers, solving these problems is measured on the orders of millions, if not billions of years. With quantum computing, the door and aperture opens to new sets of algorithms that you can't run practically on classical computers, which means this math that we were relying on to be really tough to solve, and if you can solve that math, then you can break the cryptography. That math becomes easy to do on a quantum computer.

When you have such a quantum computer, they refer to that as a cryptographically relevant quantum computer. So it has enough qubits to run, as you alluded to, something like Peter Shor's algorithm that can do the integer factorization and break RSA cryptography.

Yeah. The net of it is the public key and the private key are computed using the same components. If you can calculate those components from the public key, then you can go calculate the private key. That's really what we're worried about.