Improved Efficiency of a Linearly Homomorphic Cryptosystem
dc.contributor.advisor | Jacobson, Michael J. | |
dc.contributor.advisor | Scheidler, Renate | |
dc.contributor.author | Das, Parthasarathi | |
dc.contributor.committeemember | Cockett, J. Robin B. | |
dc.contributor.committeemember | Nguyen, Khoa D. | |
dc.date | 2019-11 | |
dc.date.accessioned | 2019-09-09T16:01:46Z | |
dc.date.available | 2019-09-09T16:01:46Z | |
dc.date.issued | 2019-08-29 | |
dc.description.abstract | We present an extended version of the Castagnos and Laguillaumie linearly homomorphic cryptosystem in which the non-maximal imaginary quadratic order is allowed to have conductor equal to a power of a product of distinct primes as opposed to a single prime. Numerical results obtained with an optimized C implementation demonstrate that this variation improves performance when large messages and exponents are used. When compared to the cryptosystems of Paillier and Bresson et al. at the same security levels, the basic version of Castagnos and Laguillaumie is the fastest at high security levels for small messages. | en_US |
dc.identifier.citation | Das, P. (2019). Improved Efficiency of a Linearly Homomorphic Cryptosystem (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. | en_US |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/36960 | |
dc.identifier.uri | http://hdl.handle.net/1880/110888 | |
dc.language.iso | eng | en_US |
dc.publisher.faculty | Science | en_US |
dc.publisher.institution | University of Calgary | en |
dc.rights | University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission. | en_US |
dc.subject | Cryptography | en_US |
dc.subject | Algebraic Number Theory | en_US |
dc.subject | Homomorphic Encryption | en_US |
dc.subject.classification | Education--Mathematics | en_US |
dc.subject.classification | Computer Science | en_US |
dc.title | Improved Efficiency of a Linearly Homomorphic Cryptosystem | en_US |
dc.type | master thesis | en_US |
thesis.degree.discipline | Computer Science | en_US |
thesis.degree.grantor | University of Calgary | en_US |
thesis.degree.name | Master of Science (MSc) | en_US |
ucalgary.item.requestcopy | true | en_US |