Dieulefait, L. V. (Luis Victor)Rosselló Gelabert, Bernadı́2022-05-172022-05-172021-06-20https://hdl.handle.net/2445/185651Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Luis Victor Dieulefait[en] Cryptography is based on practically unsolvable problems computationally. We will study elliptic curves and the discrete logarithm problem that is defined over these curves. We will see some ways to take advantage of this problem to obtain encoding systems and finally we will see 2 ways to attack the curve reducing the discrete logarithm problem over elliptic curves to the discrete logarithm problem over finite fields.35 p.application/pdfcatcc-by-nc-nd (c) Bernadı́ Rosselló Gelabert, 2021http://creativecommons.org/licenses/by-nc-nd/3.0/es/CriptografiaTreballs de fi de grauCorbes el·líptiquesLogaritmesGeometria algebraica aritmèticaCryptographyBachelor's thesesElliptic curvesLogarithmsArithmetical algebraic geometryinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess