Root Causes 676: The Quantum Choir - Simulating Grover's Algorithm, Part 2

Jason uses a quantum simulator to show us how a cryptographically relevant quantum comptuer (CRQC) would employ Shor's algorithm to attack RSA. Part two of two, with guest Bruno Coulliard.

Jason uses a quantum simulator to show us how a cryptographically relevant quantum comptuer (CRQC) would employ Shor's algorithm to attack RSA. Part one of two, with guest Bruno Coulliard.

In this first of two episodes, Jason walks guest Bruno Coulliard and me through his real-world experience building quantum simulators, including some of the lessons he learned.

Repeat guest Bruno Coulliard of Crypto4A joins us to discuss the accelerating pace of change in digital technology, which is going at a rate unprecedented in human history. How do we as people adjust to the hyperspeed of today's technology landscape? And how do we apply these ideas to cryptography?

Researchers have used AI to decode two German Enigma messages that have remained unbroken since the second world war. We describe how this was accomplished.