A NEW EFFICIENT TMVP ALGORITHM AND AN APPLICATION FOR POST-QUANTUM CRYPTOGRAPHY

Date

2023-9-25

Author

Gökce, Anıl Burak

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

387
views

113
downloads

Cite This

With the advancements in quantum computing, traditional cryptography is considered to have little life in the future. That's why NIST initiated a Post-quantum cryptography-related project in order to standardize quantum-secure cryptography. With the latest report on this project, the dominating quantum-secure problems appear to stem from lattice structures. Thus, efficient implementation techniques on multiplications of lattice elements, which is the bottleneck of lattice-based cryptography, emerged as an important topic. In this thesis, we propose a new 5-way split TMVP algorithm and its application to lattice multiplications with an implementation of the lattice-based algorithm NTRU KEM. The results are promising, showing up to $34\%$, $35\%$, and $157\%$ speed-up against Toom4-Karatsuba implementation in key generation, encapsulation, and decapsulation, respectively.

Subject Keywords

Post-Quantum Cryptography, TMVP, Polynomial Multiplication, NTRU KEM, Lattice-based Cryptography

URI

https://hdl.handle.net/11511/105378

Collections

Graduate School of Applied Mathematics, Thesis