Explore the implications of quantum computing on classical encryption algorithms in this 57-minute conference talk. Delve into Shor's algorithm, formulated by Peter Shor in 1994, and discover how it efficiently factorizes numbers using quantum mechanics. Learn about the Quantum Fourier Transform and its ability to exploit interference patterns in parallel universes to determine modular exponentiation periodicity. Examine the potential consequences of RSA's obsolescence and investigate quantum-safe alternatives, including the provably secure BB84 protocol that relies on light photon polarization. Witness a demonstration of Shor's algorithm implementation using Q#, gain insights into BB84 and classical quantum-safe algorithms, and enjoy an engaging presentation that combines complex concepts with entertaining delivery.