Travesa i Grau, ArturAlbàs Boix, Carles2020-09-102020-09-102020-06-21https://hdl.handle.net/2445/170469Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2020, Director: Artur Travesa i Grau[en] Homomorphic cryptography has as its main objective being able to do operations on ciphertexts without knowing their contents or compromising their security. In this thesis we present an introduction to this new research area by exploring its fundamental principles, the Gentry’s scheme, the Learning With Errors problem and the BGV scheme, as well as the required theoretical tools necessary to understand them. Finally, we make a little implementation of the BGV scheme in order to analyze the associated algorithms and to see some practical applications.80 p.application/pdfcatcc-by-nc-nd (c) Carles Albàs Boix, 2020http://creativecommons.org/licenses/by-nc-nd/3.0/es/CriptografiaTreballs de fi de grauXifratge (Informàtica)Teoria dels feixosCamps finits (Àlgebra)CryptographyBachelor's thesesData encryption (Computer science)Sheaf theoryFinite fields (Algebra)info:eu-repo/semantics/bachelorThesisinfo:eu-repo/semantics/openAccess