Nowadays the use of cryptography is pervasive. It is an essential component of modern digital infrastructure and has various applications that goes from finance transactions to medical devices. Cryptographic systems are built on hard mathematical problems, hard since is assumed they require an exponential time to be solved. For example, the security of online communication relies on the hardness of the RSA, whose hardness is based on factorizing the product of two large prime numbers. The previous statement has been challenged by Peter Shor in 1994. He provided an algorithm that running on a quantum computer could solve the underling RSA problem in polynomial time.