An efficient CSA architecture for montgomery modular multiplication
Microprocessors and Microsystems(2007)
摘要
Montgomery multipliers of carry save adder (CSA) architecture require a full addition to convert the carry save representation of the result into a conventional form. In this paper, we reuse the CSA architecture to perform the result format conversion, which leads to small area and fast speed. The results of implementation on FPGAs show that the new Montgomery multiplier is about 113.4Mbit/s for 1024-bit operands at a clock of 114.2MHz.
更多查看译文
关键词
montgomery multiplier,efficient csa architecture,result format conversion,new montgomery multiplier,fpgas show,full addition,conventional form,montgomery modular multiplication,csa architecture,small area,1024-bit operands,carry save adder,csa,modular multiplication,fpga,addition
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要