[1] [1] PLANTARD T, SUSILO W, ZHANG Z. Fully homomorphic encryption using hidden ideal lattice ［J］. IEEE Trans Inform Forens Secur, 2013, 8(12): 2127-2137.

[2] [2] GENTRY C, HALEVI S. Implementing Gentry’s fully-homomorphic encryption scheme ［C］ // EUROCRYPT’11. Tallinn, Estonia. 2011: 129-148.

[3] [3] WANG W, HUANG X M. FPGA implementation of a large-number multiplier for fully homomorphic encryption ［C］ // IEEE Int Symp Circ Syst. 2013: 2589-2592.

[4] [4] XING X, HUANG X M, LING S, et al. FPGA design and implementation of large integer multiplier ［J］. J Elec Inform Tech, 2019, 41(8): 1855-1860.

[5] [5] HUANG X M, WANG W. A novel and efficient design for an RSA cryptosystem with a very large key size ［J］. IEEE Trans Circ Syst Ⅱ: Expr Bri, 2015, 62(10): 972-976.

[6] [6] YE J H, SHIEH M D. Low-complexity VLSI design of large integer multipliers for fully homomorphic encryption ［J］. IEEE Trans VLSI Syst, 2018, 26(9): 1727-1736.

[7] [7] WANG W, HUANG X M. VLSI design of a large-number multiplier for fully homomorphic encryption ［J］. IEEE Trans VLSI Syst, 2014, 22(9): 1879-1887.

[8] [8] ZHANG N, QIN Q, YUAN H, et al. NTTU: an area-efficient low-power NTT-uncoupled architecture for NTT-based multiplication ［J］. IEEE Trans Comput, 2020, 69(4): 520-533.

[9] [9] LUO H F, LIU Y J,SHIEH M D. Efficient memory-addressing algorithms for FFT processor design ［J］. IEEE Trans VLSI Syst, 2015, 23(10): 2162-2172.

[10] [10] FENG X, LI S G. Design of an area-efficient million-bit integer multiplier using double modulus NTT ［J］. IEEE Trans VLSI Syst, 2017, 25(9): 2658-2662.

[11] [11] FENG X, LI S G. Accelerating an FHE integer multiplier using negative wrapped convolution and PingPong FFT ［J］. IEEE Trans Circ Syst Ⅱ: Expr Bri, 2019, 66(1): 121-125.