Skip to main content
SpringerLink
Log in

Generalized splitting-ring number theoretic transform

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Conclusions

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Pollard J M. The fast Fourier transform in a finite field. Mathematics of Computation, 1971, 25(114): 365–374

    Article  MathSciNet  Google Scholar 

  2. Agarwal R C, Burrus C S. Number theoretic transforms to implement fast digital convolution. Proceedings of the IEEE, 1975, 63(4): 550–560

    Article  MathSciNet  Google Scholar 

  3. Zhu Y M, Liu Z, Pan Y B. When NTT meets Karatsuba: preprocess-then-NTT technique revisited. In: Proceedings of the 23rd International Conference on Information and Communications Security. 2021, 249–264

  4. Liang Z C, Shen S Y, Shi Y T, Sun D N, Zhang C X, Zhang G Y, Zhao Y L, Zhao Z X. Number theoretic transform: generalization, optimization, concrete analysis and applications. In: Proceedings of the 16th International Conference on Information Security and Cryptology. 2020, 415–432

  5. Lyubashevsky V, Seiler G. NTTRU: truly fast NTRU using NTT. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2019, 2019(3): 180–201

    Article  Google Scholar 

  6. Nussbaumer H. Fast polynomial transform algorithms for digital convolution. IEEE Transactions on Acoustics, Speech, and Signal Processing, 1980, 28(2): 205–215

    Article  MathSciNet  Google Scholar 

  7. Hassan C A, Yayla O. Radix-3 NTT-based polynomial multiplication for lattice-based cryptography. IACR Cryptology ePrint Archive, 2022, 726

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Grant No. 61877011), the National Key Research and Development Program of China (No. 2022YFB2701600), the Shanghai Science and Technology Innovation Action Plan (No. 21DZ2200500), and the Shandong Provincial Key Research and Development Program of China (Nos. 2017CXG0701 and 2018CXGC0701).

Author information

Authors and Affiliations

  1. School of Computer Science, Fudan University, Shanghai, 200433, China

    Zhichuang Liang & Yunlei Zhao

  2. State Key Laboratory of Cryptology, Beijing, 100036, China

    Yunlei Zhao

  3. Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China

    Zhenfeng Zhang

Authors
  1. Zhichuang Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yunlei Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhenfeng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yunlei Zhao.

Ethics declarations

Competing interests The authors declare that they have no competing interests or financial conflicts to disclose.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liang, Z., Zhao, Y. & Zhang, Z. Generalized splitting-ring number theoretic transform. Front. Comput. Sci. 18, 184818 (2024). https://doi.org/10.1007/s11704-024-3288-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-024-3288-9

Search

Navigation