用于全同态加密的数论变换乘法蝶形运算优化及实现  

Optimization and Implementation of Number Theoretical Transform Multiplier Butterfly Operation for Fully Homomorphic Encryption

作　　者：华斯亮 张惠国[1] 王书昶[1] HUA Siliang;ZHANG Huiguo;WANG Shuchang(Changshu Institute of Technology,Suzhou 215500,China)

机构地区：[1]常熟理工学院,苏州215500

出　　处：《电子与信息学报》2021年第5期1381-1388,共8页Journal of Electronics & Information Technology

基　　金：江苏省自然科学基金(BK20191027)。

摘　　要：全同态加密(FHE)可以真正从根本上解决云计算时将数据及其操作委托给第三方时的数据安全问题。针对全同态加密中占较大比例的大整数乘法运算优化需求,该文提出一种数论变换乘法蝶形运算的操作数合并算法,利用取模操作的快速算法,分别可将基16和基32运算单元的操作数减少到43.8%和39.1%。在此基础上,设计并实现了数论变换基32运算单元的硬件设计架构,在SMIC 90 nm工艺下的综合结果显示,电路的最高工作频率为600 MHz,面积1.714 mm^(2)。实验结果表明,该优化算法提升了数论变换乘法蝶形运算的计算效率。Fully Homomorphic Encryption(FHE)allows data to be encrypted and out-sourced to commercial cloud environments for processing,while encrypted which diminishes privacy concerns.For the optimization requirements of large integer multiplication operations in fully homomorphic encryption,an operand merge algorithm of a Number Theory Transform(NTT)multiplier butterfly operation unit is proposed.By using a fast algorithm of modulo operation,the operands of the Radix-16 and Radix-32 units are reduced to 43.8%and 39.1%.The hardware architecture of the NTT Radix-32 unit is designed and implemented.The proposed design is synthesized using 90 nm process technology.The results show that the maximum frequency of the circuit is 600 MHz with die area 1.714 mm^(2).The results also show that the optimization algorithm improves the computational efficiency of NTT multiplier butterfly operation.

关 键 词：全同态加密 大整数乘法 数论变换 蝶形运算 

分 类 号：TN918.91[电子电信—通信与信息系统] TN492[电子电信—信息与通信工程]