Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorTravesa i Grau, Artur-
dc.contributor.authorAlbàs Boix, Carles-
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2020, Director: Artur Travesa i Grauca
dc.description.abstract[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
dc.format.extent80 p.-
dc.rightscc-by-nc-nd (c) Carles Albàs Boix, 2020-
dc.subject.classificationTreballs de fi de grau-
dc.subject.classificationXifratge (Informàtica)ca
dc.subject.classificationTeoria dels feixosca
dc.subject.classificationCamps finits (Àlgebra)ca
dc.subject.otherBachelor's thesis-
dc.subject.otherData encryption (Computer science)en
dc.subject.otherSheaf theoryen
dc.subject.otherFinite fields (Algebra)en
dc.titleUna introducció a la criptografia homomòrfica: implementació de l’esquema BGVca
Appears in Collections:Programari - Treballs de l'alumnat
Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
codi_font.zipCodi font30.46 kBzipView/Open
170469.pdfMemòria889.53 kBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons