Please use this identifier to cite or link to this item:
Title: Atac quàntic a la criptografia amb corbes el·líptiques
Author: Canal Guitart, Laia
Director/Tutor: Sans Gispert, Eloi
Keywords: Xifratge (Informàtica)
Treballs de fi de grau
Teoria quàntica
Corbes el·líptiques
Complexitat computacional
Data encryption (Computer science)
Bachelor's thesis
Quantum theory
Elliptic curves
Computational complexity
Issue Date: 21-Jun-2020
Abstract: [en] Generally, the majority of classical cryptography methods that use elliptical curves are based on the difficulty of classical computers to solve the discrete logarithm problem in polynomial time. Here we will study Peter Shor’s quantum attack derived from the algorithm for the discrete logarithm problem, published in 1994 [14]. We start with an introduction to elliptical curves and their use in criptography. Then we understand the mathematical foundations of the corresponding quantum computation to understand Shor’s algorithm, from which we will study how to reach it and why it works.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2020, Director: Elois Sans Gispert
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
176693.pdfMemòria720.59 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons