Скачать или смотреть Quantum Computing and How it Breaks RSA | Ep. 1 - Quantum Learning Series

On October 7, 2025, the Nobel Prize in Physics was awarded to John Clarke, Michel H. Devoret, and John M. Martinis for their work with superconducting circuits and Josephson junctions—experiments that proved quantum mechanics can govern entire electronic systems, not just individual particles. Their discoveries laid the foundation for today’s quantum computers.

Quantum computing is now redefining what’s possible in data security. In Episode 1 of the Quantum Learning Series, we explore what quantum computing really is—and why it poses such a powerful threat to modern encryption.

Learn how qubits, superposition, and entanglement allow quantum systems to perform calculations far beyond classical limits, and how Shor’s algorithm could break RSA encryption as we know it. We’ll also cover the rise of post-quantum cryptography (PQC)—new standards from NIST designed to protect data against future quantum attacks—and how a data-centric security approach helps organizations prepare today.

In this episode:

How quantum computing differs from classical computing
What qubits, superposition, and entanglement mean
How Shor’s algorithm breaks factorization and threatens RSA
What post-quantum cryptography (PQC) is and why it matters
How data-centric encryption protects information at all points of risk

Subscribe to stay ahead of the post-quantum shift and learn how to protect your data in the quantum era.

Connect with Arjun at ‪@arjunkudinoor‬. Production work by Tui Leauanae.