arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2509.08067cs.AR
收藏

分析HLS和RTL工具在FPGA Montgomery乘法器设计中的能力

Analyzing the capabilities of HLS and RTL tools in the design of an FPGA Montgomery Multiplier

Rares Ifrim, Decebal Popescu

AI总结:

本文分析FPGA上Montgomery乘法器的多种设计,对比RTL与HLS方法在频率、延迟和资源上的表现,并评估其在高性能椭圆曲线密码操作中的潜力。

摘要:

我们展示了Montgomery模乘器的各种FPGA设计实现的分析,该乘法器与BLS12-381椭圆曲线兼容,采用粗粒度集成操作数扫描方法处理不同数字大小下的完整部分积。所设计实现的目标是获得一个高频率、高吞吐量的解决方案,能够每秒计算数百万次操作,为点加和点乘等不同椭圆曲线密码操作提供坚实基础。我们设计的一个重要约束是仅使用FPGA DSP原语来执行CIOS算法中数字间的算术运算,因为这些原语在适当流水线化后可以高频率运行,同时减少FPGA LUT和FF的资源消耗。分析的目标是了解在使用最新的AMD-Xilinx工具和Alveo FPGA板卡进行RTL-HLS混合方法时,不同的设计选择和工具配置如何影响频率、延迟和资源消耗。我们比较了三类设计:一种Verilog朴素方法,依赖Vivado综合器自动选择何时何地使用DSP;一种Verilog优化方法,手动实例化DSP原语;以及一种完整的高级综合方法。我们还将FPGA实现与用Rust编写的相同Montgomery乘法器的优化软件实现进行了比较。

英文摘要:

We present the analysis of various FPGA design implementations of a Montgomery Modular Multiplier, compatible with the BLS12-381 elliptic curve, using the Coarsely Integrated Operand Scanning approach of working with complete partial products on different digit sizes. The scope of the implemented designs is to achieve a high-frequency, high-throughput solution capable of computing millions of operations per second, which can provide a strong foundation for different Elliptic Curve Cryptography operations such as point addition and point multiplication. One important constraint for our designs was to only use FPGA DSP primitives for the arithmetic operations between digits employed in the CIOS algorithm as these primitives, when pipelined properly, can operate at a high frequency while also relaxing the resource consumption of FPGA LUTs and FFs. The target of the analysis is to see how different design choices and tool configurations influence the frequency, latency and resource consumption when working with the latest AMD-Xilinx tools and Alveo FPGA boards in an RTL-HLS hybrid approach. We compare three categories of designs: a Verilog naive approach where we rely on the Vivado synthesizer to automatically choose when and where to use DSPs, a Verilog optimized approach by manually instantiating the DSP primitives ourselves and a complete High-Level Synthesis approach. We also compare the FPGA implementations with an optimized software implementation of the same Montgomery multiplier written in Rust.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑