Abstract by Benjamin Szamosfalvi
Physics and Astronomy
Jean-Francois Van Huele
Breaking Low-level RSA encryption Using an IBM Quantum Computer
A large quantum computer should be able to break encryptions that rely on the difficulty of factoring large prime numbers on classical computers, e.g. RSA encryption. If a quantum computer can break RSA encryption then a revision of publicly used encryption schemes will become necessary as quantum computers develop. We investigate the capability of a quantum computer to utilize Shor’s algorithm to break encryption on a short message. We implement a quantum circuit using QISkit Terra alongside a classical algorithm to decrypt an arbitrary encrypted message and analyze the correlation between the original and the decrypted string.