.png){kind=icon}
.png){kind=icon}
Return
Resource-aware Montgomery modular multiplication optimization for digital signal processing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sysarc.2024.103142.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Homomorphic encryption is an important technology for protecting data privacy, and the performance of modular multiplication directly affects the efficiency of homomorphic encryption. Currently, there are numerous FPGA-based acceleration techniques targeting modular multiplication. However, many of these implementations require substantial hardware resources or suffer from resource imbalance. This leads to a lower throughput. Therefore, we present a novel FPGA-based implementation of Montgomery Modular Multiplication aimed at addressing these challenges. Our design employs a suitable radix bit width and word size based on the digital signal processing (DSP) bit width rather than the conventional binary powers of two. We aim to instantiate more modular multipliers using limited resources while minimizing latency. We also introduce a novel DSP cascade structure, called parallel grouping cascade DSP, which reduces the number of clock cycles of internal multipliers. To balance the ratio of lookup table (LUT) and DSP usage, we also use multipliers implemented in the LUT to replace some DSPs. Our results, implemented on Xilinx Virtex-7 field -programmable gate array (FPGA), demonstrate more than 27% improvement in throughput on 1024bit modular multiplication and more than 70% improvement on 2048 -bit compared to the best previous state-of-the-art references.
Keywords:
Cryptosystem
Large integer arithmetic
Field Programmable Gate Array
Digital signal processing
Montgomery modular multiplication
Journal
IF:
4.1
Papers:
3.0K
Citations:
4.2K