Generalized splitting-ring number theoretic transform

IF 3.4 3区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Frontiers of Computer Science Pub Date : 2024-04-08 DOI:10.1007/s11704-024-3288-9

Zhichuang Liang, Yunlei Zhao, Zhenfeng Zhang

引用次数: 0

Abstract

In this paper, we propose GSR-NTT and demonstrate that K-NTT, H-NTT, and G3-NTT are specific instances of GSR-NTT. We introduce a succinct methodology for complexity analysis, and utilize our GSR-NTT to accelerate polynomial multiplications in NTTRU and power-of-three cyclotomic rings.

查看原文本刊更多论文

广义分环数论变换

本文提出了 GSR-NTT，并证明 K-NTT、H-NTT 和 G3-NTT 是 GSR-NTT 的具体实例。我们介绍了一种简洁的复杂性分析方法，并利用我们的 GSR-NTT 加速了 NTTRU 和三次幂环中的多项式乘法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Frontiers of Computer Science COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING

CiteScore

8.60

自引率

2.40%

发文量

799

审稿时长

6-12 weeks

期刊介绍： Frontiers of Computer Science aims to provide a forum for the publication of peer-reviewed papers to promote rapid communication and exchange between computer scientists. The journal publishes research papers and review articles in a wide range of topics, including: architecture, software, artificial intelligence, theoretical computer science, networks and communication, information systems, multimedia and graphics, information security, interdisciplinary, etc. The journal especially encourages papers from new emerging and multidisciplinary areas, as well as papers reflecting the international trends of research and development and on special topics reporting progress made by Chinese computer scientists.