EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Lazy Modular Reduction for NTT

Geumtae Kim, Eunyoung Seo, Yongwoo Lee, Young-Sik Kim, Jong-Seon No

Electronics · 11.12.2024 · 13 (24) · 4887

DOI: 10.3390/electronics13244887 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Electronics, online erschienen am 11.12.2024. Verfasst von Geumtae Kim und 4 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Korean government(MSIT).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The number theoretic transform (NTT) is a fundamental operation in cryptography, especially for lattice-based cryptographic schemes. This paper introduces LazyNTT, a novel method that reduces the number of Montgomery multiplications required in the NTT computation by replacing some of them with standard multiplication without modular reduction. This approach enhances the performance of the NTT computation and modular polynomial multiplication in lattice-based cryptographic schemes. The proposed LazyNTT can be generalized by increasing the number of standard multiplications. The experimental results show that the proposed LazyNTT improves the cycle counts of the NTT by up to 28% and 9%, respectively, by allowing two and one standard multiplications.

Förderung

  • Korean government(MSIT)

Zitieren

APA

Kim, G., Seo, E., Lee, Y., Kim, Y., & No, J. (2024). Lazy Modular Reduction for NTT. Electronics, 13(24), 4887. https://doi.org/10.3390/electronics13244887

Vancouver

Kim G, Seo E, Lee Y, Kim Y, No J. Lazy Modular Reduction for NTT. Electronics. 2024;13(24):4887. doi:10.3390/electronics13244887

BibTeX
@article{Kim2024,
  author = {Kim, Geumtae and Seo, Eunyoung and Lee, Yongwoo and Kim, Young-Sik and No, Jong-Seon},
  title = {Lazy Modular Reduction for NTT},
  journal = {Electronics},
  year = {2024},
  volume = {13},
  number = {24},
  pages = {4887},
  doi = {10.3390/electronics13244887}
}
Kostenlos starten →