Algoritmes quàntics i criptografia

dc.contributor.advisorTravesa i Grau, Artur
dc.contributor.authorMoreno Pulido, Cristian
dc.date.accessioned2017-07-04T07:18:01Z
dc.date.available2017-07-04T07:18:01Z
dc.date.issued2017-01
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2017, Director: Artur Travesa i Grauca
dc.description.abstractFrom 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.ca
dc.format.extent57 p.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/2445/113282
dc.language.isocatca
dc.rightscc-by-nc-nd (c) Cristian Moreno Pulido, 2017
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es
dc.sourceTreballs Finals de Grau (TFG) - Matemàtiques
dc.subject.classificationAlgorismes computacionals
dc.subject.classificationTreballs de fi de grau
dc.subject.classificationOrdinadors quànticsca
dc.subject.classificationXifratge (Informàtica)ca
dc.subject.otherComputer algorithms
dc.subject.otherBachelor's theses
dc.subject.otherQuantum computersen
dc.subject.otherData encryption (Computer science)en
dc.titleAlgoritmes quàntics i criptografiaca
dc.typeinfo:eu-repo/semantics/bachelorThesisca

Fitxers

Paquet original

Mostrant 1 - 1 de 1
Carregant...
Miniatura
Nom:
memoria.pdf
Mida:
703.9 KB
Format:
Adobe Portable Document Format
Descripció:
Memòria