dc.contributor.advisor | Silde, Tjerand | |
dc.contributor.advisor | Pan, Jiaxin | |
dc.contributor.author | Rodríguez Rodríguez, Alejandro Royher | |
dc.date.accessioned | 2022-07-28T17:19:42Z | |
dc.date.available | 2022-07-28T17:19:42Z | |
dc.date.issued | 2022 | |
dc.identifier | no.ntnu:inspera:103848036:98255415 | |
dc.identifier.uri | https://hdl.handle.net/11250/3009053 | |
dc.description.abstract | | |
dc.description.abstract | The thesis is about implementation of LWE/MLWE encryption schemes in C++
and the use of the Number Theoretic Transform (NTT) in order to get faster mul-
tiplication operations over certain rings. We explore how much speed up we get
by using NTT in our different schemes, comparing performance of our NTT im-
plementation with the MulMod function of the NTL Library and the schoolbook
multiplication. We use Cooley-Turkey algorithm in the NTT forward step and
Gentleman-Sande algorithm in the NTT inverse step with ordinary modular re-
duction. After some experiments we came to the conclusion that, when we are
working on R_q = Z_q[X ]/(X^N + 1), for relative small N with our NTT implemen-
taion we get a performance similar compared to the MulMod function and for all
N we get much better results compared to the schoolbook multiplication. | |
dc.language | eng | |
dc.publisher | NTNU | |
dc.title | Implementing Lattice-Based Cryptography | |
dc.type | Bachelor thesis | |