Paper 2022/726

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

Chenar Abdulla Hassan, Middle East Technical University
Oğuz Yayla, Middle East Technical University
Abstract

The lattice-based cryptography is considered a strong candidate amongst many other proposed quantum-safe schemes for the currently deployed asymmetric cryptosystems that do not seem to stay secure when quantum computers come into play. Lattice-based algorithms 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 computational 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
Keywords
Number Theoretic Transformation Polynomial Multiplication Kyber Lattice-Based Cryptography.
Contact author(s)
chenar80 @ hotmail com
oguz @ metu edu tr
History
2022-06-08: approved
2022-06-07: received
See all versions
Short URL
https://ia.cr/2022/726
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/726,
      author = {Chenar Abdulla Hassan and Oğuz Yayla},
      title = {Radix-3 NTT-Based Polynomial Multiplication for Lattice-Based Cryptography},
      howpublished = {Cryptology ePrint Archive, Paper 2022/726},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/726}},
      url = {https://eprint.iacr.org/2022/726}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.