Abstract : The RSA algorithm is one of the oldest widely used public-key encryption algorithm. It relies on the difficulty of factorizing primes, with the best-known classical algorithms performing in sub-exponential time. Shor’s algorithm, which relies on the laws of quantum mechanics, drastically reduces this time complexity to polynomial time, making RSA vulnerable if implemented. The goal of this talk is to introduce quantum computing with Shor’s algorithm as a guiding example.