Mostra el registre parcial de l'element
| dc.contributor | Travesa i Grau, Artur | |
| dc.creator | Moreno Pulido, Cristian | |
| dc.date | 2017-07-04T07:18:01Z | |
| dc.date | 2017-07-04T07:18:01Z | |
| dc.date | 2017-01 | |
| dc.date.accessioned | 2024-12-16T10:24:35Z | |
| dc.date.available | 2024-12-16T10:24:35Z | |
| dc.identifier | http://hdl.handle.net/2445/113282 | |
| dc.identifier.uri | http://fima-docencia.ub.edu:8080/xmlui/handle/123456789/17960 | |
| dc.description | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2017, Director: Artur Travesa i Grau | |
| dc.description | 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. | |
| dc.format | 57 p. | |
| dc.format | application/pdf | |
| dc.language | cat | |
| dc.rights | cc-by-nc-nd (c) Cristian Moreno Pulido, 2017 | |
| dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/es | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.source | Treballs Finals de Grau (TFG) - Matemàtiques | |
| dc.subject | Algorismes computacionals | |
| dc.subject | Treballs de fi de grau | |
| dc.subject | Ordinadors quàntics | |
| dc.subject | Xifratge (Informàtica) | |
| dc.subject | Computer algorithms | |
| dc.subject | Bachelor's theses | |
| dc.subject | Quantum computers | |
| dc.subject | Data encryption (Computer science) | |
| dc.title | Algoritmes quàntics i criptografia | |
| dc.type | info:eu-repo/semantics/bachelorThesis |
| Fitxers | Grandària | Format | Visualització |
|---|---|---|---|
|
No hi ha fitxers associats a aquest element. |
|||