Travesa i Grau, ArturMoreno Pulido, Cristian2017-07-042017-07-042017-01https://hdl.handle.net/2445/113282Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2017, Director: Artur Travesa i GrauFrom 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.57 p.application/pdfcatcc-by-nc-nd (c) Cristian Moreno Pulido, 2017http://creativecommons.org/licenses/by-nc-nd/3.0/esAlgorismes computacionalsTreballs de fi de grauOrdinadors quànticsXifratge (Informàtica)Computer algorithmsBachelor's thesesQuantum computersData encryption (Computer science)info:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess