Exploring the Advantages and Challenges of Fermat NTT in FHE Acceleration-Reference-Cited by-同舟云学术

Exploring the Advantages and Challenges of Fermat NTT in FHE Acceleration

Published:2024 Issue: Volume: Page:76-106
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:en
Short-container-title:

Author:

Kim Andrey,Mert Ahmet Can,Mukherjee Anisha,Aikata Aikata,Deryabin Maxim,Kwon Sunmin,Kang Hyung Chul,Roy Sujoy Sinha

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-68382-4_3

Reference45 articles.

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

2. Agrawal, R., et al.: FAB: an FPGA-based accelerator for bootstrappable fully homomorphic encryption. In: IEEE International Symposium on High-Performance Computer Architecture, HPCA 2023, Montreal, 25 February–1 March 2023, pp. 882–895. IEEE (2023). https://doi.org/10.1109/HPCA56546.2023.10070953

3. Aikata, A., Mert, A.C., Kwon, S., Deryabin, M., Roy, S.S.: Reed: chiplet-based scalable hardware accelerator for fully homomorphic encryption. arXiv preprint arXiv:2308.02885 (2023)

4. Al Badawi, A., et al.: OpenFHE: open-source fully homomorphic encryption library. In: Proceedings of the 10th Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC 2022), pp. 53–63. Association for Computing Machinery, New York (2022).https://doi.org/10.1145/3560827.3563379

5. Barrett, P.: Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311–323. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-47721-7_24