Skip to main content
Log in

An efficient hardware accelerator for NTT-based polynomial multiplication using FPGA

  • Research Article
  • Published:
Journal of Cryptographic Engineering Aims and scope Submit manuscript

Abstract

The number theoretic transform (NTT) is used to efficiently execute polynomial multiplication. It has become an important part of lattice-based post-quantum methods and the subsequent generation of standard cryptographic systems. However, implementing post-quantum schemes is challenging since they rely on intricate structures. This paper demonstrates how to develop a high-speed NTT multiplier highly optimized for FPGAs with few logical resources. We describe a novel architecture for NTT that leverages unique precomputation. Our method efficiently maps these specific pre-computed values into the built-in Block RAMs, which greatly reduces the area and time required for implementation when compared to previous works. We have chosen Kyber parameters to implement the proposed architectures. Compared to the most well-known approach for implementing Kyber’s polynomial multiplication using NTT, the AC (area \(\times \) latency) is reduced by \(33\%\), and AT (area \(\times \) time) is improved by \(18\%\) as a result of the pre-computation we suggest in this study.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Algorithm 1
Fig. 1
Algorithm 2
Algorithm 3
Algorithm 4
Algorithm 5
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Göttert, N., Feller, T., Schneider, M., Buchmann, J., Huss, S.A.: On the design of hardware building blocks for modern lattice-based encryption schemes. CHES 7428, 512–529 (2012)

    MATH  Google Scholar 

  2. Pöppelmann, T., Güneysu, T.: Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware. LATINCRYPT 7533, 139–158 (2012)

    MATH  Google Scholar 

  3. Pöppelmann, T., Güneysu, T.: Towards practical lattice-based public-key encryption on reconfigurable hardware. Sel. Areas Cryptogr. 8282, 68–85 (2013)

    MATH  Google Scholar 

  4. Aysu, A., Patterson, C., Schaumont, P.: Low-cost and area-efficient FPGA implementations of lattice-based cryptography. In: HOST, pp. 81–86 (2013)

  5. Roy, S.S., Vercauteren, F., Mentens, N., Chen, D.D., Verbauwhede, I.: Compact ring-LWE cryptoprocessor. CHES 8731, 371–391 (2014)

    MATH  Google Scholar 

  6. Zhang, N., Yang, B., Chen, C., Yin, S., Wei, S., Liu, L.: Highly efficient architecture of Newhope-NIST on FPGA using low-complexity NTT/INTT. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(2), 49–72 (2020)

    Article  MATH  Google Scholar 

  7. Longa, P., Naehrig, M.: Speeding up the number theoretic transform for faster ideal lattice-based cryptography. CANS 10052, 124–139 (2016)

    MathSciNet  MATH  Google Scholar 

  8. Banerjee, U., Ukyab, T.S., Chandrakasan, A.P.: Sapphire: a configurable crypto-processor for post-quantum lattice-based protocols. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(4), 17–61 (2019)

    Article  Google Scholar 

  9. Chen, Z., Ma, Y., Chen, T., Lin, J., Jing, J.: Towards efficient Kyber on FPGAS: a processor for vector of polynomials. In: ASP-DAC, pp. 247–252 (2020)

  10. Mert, A.C., Karabulut, E., Öztürk, E., Savas, E., Becchi, M., Aysu, A.: A flexible and scalable NTT hardware : applications from homomorphically encrypted deep learning to post-quantum cryptography. In: DATE, pp. 346–351 (2020)

  11. Mert, A.C., Karabulut, E., Öztürk, E., Savas, E., Aysu, A.: An extensive study of flexible design methods for the number theoretic transform. IEEE Trans. Comput. 71(11), 2829–2843 (2022)

    Article  MATH  Google Scholar 

  12. Karabulut, E., Aysu, A.: RANTT: A RISC-V architecture extension for the number theoretic transform. In: FPL, pp. 26–32 (2020)

  13. Fritzmann, T., Sepúlveda, J.: Efficient and flexible low-power NTT for lattice-based cryptography. In: HOST, pp. 141–150 (2019)

  14. Xing, Y., Li, S.: An efficient implementation of the newhope key exchange on FPGAS. IEEE Trans. Circuits Syst. I Regul. Pap. 67–I(3), 866–878 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  15. Du, C., Bai, G., Wu, X.: High-speed polynomial multiplier architecture for ring-LWE based public key cryptosystems. In: ACM Great Lakes Symposium on VLSI, pp. 9–14 (2016)

  16. Kuo, P., Chen, Y., Hsu, Y., Cheng, C., Li, W., Yang, B.: High performance post-quantum key exchange on FPGAS. J. Inf. Sci. Eng. 38(4), 1211–1229 (2022)

    MATH  Google Scholar 

  17. Nguyen, D.T., Dang, V.B., Gaj, K.: A high-level synthesis approach to the software/hardware codesign of NTT-based post-quantum cryptography algorithms. In: FPT, pp. 371–374 (2019)

  18. Nguyen, D.T., Dang, V.B., Gaj, K.: High-level synthesis in implementing and benchmarking number theoretic transform in lattice-based post-quantum cryptography using software/hardware codesign. ARC Lecture Notes Comput. Sci. 12083, 247–257 (2020)

    Article  MATH  Google Scholar 

  19. Di Matteo, S., Gerfo, M.L., Saponara, S.: VLSI design and FPGA implementation of an NTT hardware accelerator for homomorphic seal-embedded library. IEEE Access 11, 72498–72508 (2023)

    Article  Google Scholar 

  20. Shahmirzadi, A.R., Bozilov, D., Moradi, A.: New first-order secure AES performance records. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(2), 304–327 (2021)

    Article  Google Scholar 

  21. Morales-Sandoval, M., Flores, L.A.R., Cumplido, R., Garcia-Hernandez, J.J., Feregrino, C., Algredo-Badillo, I.: A compact FPGA-based accelerator for curve-based cryptography in wireless sensor networks. J. Sensors 2021, 8860413–1886041313 (2021)

    Article  MATH  Google Scholar 

  22. Avanzi, R., Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J.M., Schwabe, P., Seiler, G., Stehlé, D.: Crystals-kyber algorithm specifications and supporting documentation. NIST PQC Round 2(4), 1–43 (2017)

    MATH  Google Scholar 

  23. Pöppelmann, T., Oder, T., Güneysu, T.: High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers. LATINCRYPT 9230, 346–365 (2015)

    MathSciNet  MATH  Google Scholar 

  24. Bisheh-Niasar, M., Azarderakhsh, R., Mozaffari-Kermani, M.: High-speed ntt-based polynomial multiplication accelerator for post-quantum cryptography. In: 2021 IEEE 28th symposium on computer arithmetic (ARITH), pp. 94–101. IEEE (2021)

  25. Alkim, E., Evkan, H., Lahr, N., Niederhagen, R., Petri, R.: ISA extensions for finite field arithmetic accelerating Kyber and newhope on RISC-V. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(3), 219–242 (2020)

    Article  Google Scholar 

  26. Huang, Y., Huang, M., Lei, Z., Wu, J.: A pure hardware implementation of CRYSTALS-KYBER PQC algorithm through resource reuse. IEICE Electron. Express 17(17), 20200234 (2020)

    Article  MATH  Google Scholar 

  27. Fritzmann, T., Sigl, G., Sepúlveda, J.: RISQ-V: tightly coupled RISC-V accelerators for post-quantum cryptography. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(4), 239–280 (2020)

    Article  MATH  Google Scholar 

  28. Xing, Y., Li, S.: A compact hardware implementation of CCA-secure key exchange mechanism CRYSTALS-KYBER on FPGA. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(2), 328–356 (2021)

    Article  MATH  Google Scholar 

  29. Yaman, F., Mert, A.C., Öztürk, E., Savaş, E.: A hardware accelerator for polynomial multiplication operation of crystals-kyber pqc scheme. In: 2021 design, automation & test in Europe conference & exhibition (DATE), pp. 1020–1025 (2021)

  30. Ni, Z., Khalid, A., Liu, W., O’Neill, M.: Towards a lightweight crystals-kyber in FPGAS: an ultra-lightweight bram-free ntt core. In: IEEE international symposium on circuits and systems (ISCAS), IEEE (2023)

  31. Zhang, C., Liu, D., Liu, X., Zou, X., Niu, G., Liu, B., Jiang, Q.: Towards efficient hardware implementation of NTT for Kyber on FPGAS. In: 2021 IEEE international symposium on circuits and systems (ISCAS), pp. 1–5. IEEE (2021)

Download references

Author information

Authors and Affiliations

Authors

Contributions

Raziyeh Salarifard and Hadi soleimany wrote the main manuscript, prepared figures and tables, and reviewed the manuscript.

Corresponding author

Correspondence to Raziyeh Salarifard.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Salarifard, R., Soleimany, H. An efficient hardware accelerator for NTT-based polynomial multiplication using FPGA. J Cryptogr Eng 14, 415–426 (2024). https://doi.org/10.1007/s13389-024-00357-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13389-024-00357-1

Keywords

Navigation