Radix-3 NTT-Based Polynomial Multiplication for Lattice-Based Cryptography

Date

2025-01-01

Author

Hassan, Chenar
Yayla, Oğuz

Metadata

Show full item record

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

Item Usage Stats

24
views

13
downloads

Cite This

The lattice-based cryptography is considered a strong candidate amongst many other pro- posed quantum-safe schemes for the currently deployed asymmetric cryptosystems that do not seem to stay secure when quantum computers come into play. Lattice-based algo- rithms possess a time-consuming operation of polynomial multiplication. As it is relatively the highest time-consuming operation in lattice-based cryptosystems, one can obtain fast polynomial multiplication by using number theoretic transform (NTT). In this paper, we focus on and develop a radix-3 NTT polynomial multiplication and compute its computa- tional complexity. In addition, utilizing the ring structure, we propose two parameter sets of CRYSTALS-KYBER, one of the four round-three finalists in the NIST Post-Quantum Competition

Subject Keywords

Number Theoretic Transformation, Polynomial Multiplication, Kyber, Lattice- Based Cryptography

URI

https://eprint.iacr.org/2022/726
https://hdl.handle.net/11511/118001

Collections

Graduate School of Applied Mathematics, Article