Dieulefait, L. V. (Luis Victor)Celma Miralles, Ariadna2022-06-032022-06-032022-01-24https://hdl.handle.net/2445/186292Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Dieulefait, L. V.[en] This work introduces the bases of quantic computation to describe Shor’s algorithm. This algorithm allows us to factor a number N with polynomial speed. This implies a qualitative increase in calculation speed, since a quantic computer could calculate in hours or days what a classic computer may calculate in milion years. For that reason, criptographies like RSA may become obsolete, because factoring its public key and deciphering the message would be too quick.37 p.application/pdfcatcc-by-nc-nd (c) Ariadna Celma Miralles, 2022http://creativecommons.org/licenses/by-nc-nd/3.0/es/Factorització (Matemàtica)Treballs de fi de grauOrdinadors quànticsTeoria de nombresAlgorismes computacionalsFactorization (Mathematics)Bachelor's thesesQuantum computersNumber theoryComputer algorithmsinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess