Files

tfg_rosello_gelabert_bernadi.pdf (1.26 MB)

Document type

Bachelor thesis

Publication date

2021-06-20

Publication license

cc-by-nc-nd (c) Bernadı́ Rosselló Gelabert, 2021
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/185651

Logaritme discret i pairings en corbes el·líptiques amb aplicacions a la criptografia

Journal Title

Authors

Director/Tutor

Journal ISSN

Volume Title

Related resource

Abstract

[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.

Description

Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2021, Director: Luis Victor Dieulefait

Subject

Criptografia, Treballs de fi de grau, Corbes el·líptiques, Logaritmes, Geometria algebraica aritmètica

Subject (English)

Cryptography, Bachelor's theses, Elliptic curves, Logarithms, Arithmetical algebraic geometry

Citation

Collections

Treballs Finals de Grau (TFG) - Matemàtiques

Citation

ROSSELLÓ GELABERT, Bernadı́. Logaritme discret i pairings en corbes el·líptiques amb aplicacions a la criptografia. [consulted: 8 of June of 2026]. Available at: https://hdl.handle.net/2445/185651

Export metadata

JSON - METS

Share record