Files

memoria.pdf (492.85 KB)

Document type

Bachelor thesis

Publication date

2018-01-19

Publication license

cc-by-nc-nd (c) Daniel del Pozo Bueno, 2018
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/122537

L’algoritme de Schoof i la criptografia basada en corbes el·líptiques

Journal Title

Authors

Director/Tutor

Additional contribution

Journal ISSN

Volume Title

Abstract

[en] In this project we study elliptic curve cryptography, which uses groups of points of elliptic curves over finite fields, and Schoof’s algorithm for computing the cardinality of such groups. We introduce the mathematical concepts related to elliptic curves and their group of points, and we describe some elliptic curve based public key cryptosystems. In addition, we provide the necessary background for Schoof’s algorithm, which we describe and implement using the software Sage. We also discuss some criteria used in practice to choose suitable elliptic curves for cryptography, which show the importance of counting points algorithms in cryptographic applications.

Description

Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2018, Director: Xavier Guitart Morales

Related resource

Subject

Corbes el·líptiques, Treballs de fi de grau, Algorismes computacionals, Xifratge (Informàtica)

Subject (English)

Elliptic curves, Bachelor's theses, Computer algorithms, Data encryption (Computer science)

Citation

Collections

Treballs Finals de Grau (TFG) - Matemàtiques

Citation

DEL POZO BUENO, Daniel. L’algoritme de Schoof i la criptografia basada en corbes el·líptiques. [consulted: 11 of October of 2026]. Available at: https://hdl.handle.net/2445/122537

Export metadata

JSON - METS

Share record