Dieulefait, L. V. (Luis Victor)Gutiérrez Silva, Adrián2024-05-132024-05-132024-01-17https://hdl.handle.net/2445/211184Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2024, Director: L. V. Dieulefait[en] In this thesis, we provide a didactic introduction to pairing-based cryptography with elliptic curves, following the premises and methodologies outlined in Lawrence C. Washington’s book Elliptic Curves, Number Theory, and Cryptography. We introduce the algebraic structure of the curve and subsequently, we delve into the key concept of pairing, exploring its applications in the field of computer security. The distinctive element of this work is the presentation and analysis of a cryptographic secret sharing scheme titled Conjunctive Hierarchical Multi-Secret Sharing Scheme using Elliptic Curves, developed by Mohan Chintamani, Prabal Paul, and Laba Sa. With this contribution, we delve into the properties of elliptic curves and pairing, providing a deeper understanding of contemporary cryptographic techniques and their applications.50 p.application/pdfcatcc-by-nc-nd (c) Adrián Gutiérrez Silva, 2024http://creativecommons.org/licenses/by-nc-nd/3.0/es/Xifratge (Informàtica)Corbes el·líptiquesTeoria de la codificacióTreballs de fi de grauData encryption (Computer science)Elliptic curvesCoding theoryBachelor's thesesinfo:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess