Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2017, Director: Artur Travesa i Grau
From Shor's algorithm follows an algorithm that would allow us, in a proper quantum computer, to factorize integers e ectively. This could break the RSA encryption algorithm. This paper tries to study this algorithm as well as some further variations that improve Shor's algorithm in certain conditions or are able to attack other
cryptographic systems.