Show simple item record

dc.contributor.advisorGjøsteen, Kristian
dc.contributor.authorSperre, Harald Elias Bjerke
dc.date.accessioned2017-09-04T14:05:29Z
dc.date.available2017-09-04T14:05:29Z
dc.date.created2017-07-22
dc.date.issued2017
dc.identifierntnudaim:16869
dc.identifier.urihttp://hdl.handle.net/11250/2453098
dc.description.abstractIn this paper we consider fully homomorphic encryption based on the learning with errors problem. We present the problem as introduced by Oded Regev in 2009 and explain a simple public key cryptosystem based on it. We show how the scheme can be modified to be more suitable for homomorphic operations, and introduce bootstrapping, using the ideas proposed by Craig Gentry in 2009. Finally we examine bootstrapping techniques proposed by Chilotti et al. in 2016, which is the main topic of this paper.
dc.languageeng
dc.publisherNTNU
dc.subjectFysikk og matematikk, Industriell matematikk
dc.titleFully Homomorphic Encryption
dc.typeMaster thesis


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record