Fast Bootstrapping in Z_q
| dc.contributor.author | Ruiz Lopez, Luis A | |
| dc.date.accessioned | 2015-08-28T18:47:47Z | |
| dc.date.embargountil | 2015-12-26T18:47:47Z | |
| dc.date.issued | 2015-08-28 | |
| dc.date.submitted | 2015 | |
| dc.description.abstract | In 2015, Ducas and Micciancio presented a novel technique to compute the NAND gate using the Learning With Errors cryptosystem (LWE), along with a novel bootstrapping technique that turns turns this cryptosystem into a fully-homomorphic encryption scheme that allows a very short and fast implementation. We present an extension of their bootstrapping technique that allows refreshing encryptions of elements in Z_p and the homomorphic computation of arbitrary gates, alongside with an implementation that exploits the power of parallel computation. | en |
| dc.description.embargoterms | 4 months | en |
| dc.identifier.uri | http://hdl.handle.net/10012/9617 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | |
| dc.subject | Cryptography | en |
| dc.subject | Fully-Homomorphic Encryption | en |
| dc.subject | FHEW | en |
| dc.subject | Parallelization | en |
| dc.subject | Cyclotomic fields | en |
| dc.subject.program | Combinatorics and Optimization | en |
| dc.title | Fast Bootstrapping in Z_q | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |