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

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.