%0 Journal Article
%T 基于FPGA的SM9数字签名算法的快速实现<br>Fast Implementation of SM9 Digital Signature Algorithm Based on FPGA
%A 梅峰
%A 李子臣
%J Computer Science and Application
%P 134-144
%@ 2161-881X
%D 2025
%I Hans Publishing
%R 10.12677/csa.2025.154086
%X SM9算法是由我国推出的基于双线性对的标识密码算法&#65292;其中使用的R-ate双线性对在计算效率上优于Weil对和Tate对&#65292;但在实际应用中仍有不足。针对上述问题&#65292;为了提升SM9中双线性对的计算效率&#65292;提出了一种在FPGA平台上使用滑动窗口改进R-ate对运算的方法。该方法以蒙哥马利模乘为基础改进扩域模逆运算并通过滑动窗口算法优化R-ate双线性对运算中的Miller循环部分。同时根据蒙哥马利模乘特性减少椭圆曲线上点运算计算量提升签名算法运算效率。仿真结果表明&#65292;采用该方法可以将SM9中R-ate对的运算效率提升约18.46%&#65292;对SM9签名算法效率提升约为13.55%。<br>SM9 algorithm is an identity-based cryptographic algorithm based on bilinear pairing introduced by our country, in which the R-ate pairing used is better than Weil pairing and Tate pairing in terms of computational efficiency, but it still has deficiencies in practical applications. To improve the computational efficiency of the bilinear pairing in SM9, a method was proposed to improve the R-ate pairing operation by using a sliding window on the FPGA platform. The method was based on the Montgomery modular multiplication to enhance the modular inverse operation in the twelfth extension field and optimize the Miller loop in the R-ate pairing operation through the sliding window algorithm. At the same time, the computational efficiency of the signature algorithm was improved by reducing the number of point operations on elliptic curves according to the Montgomery modular multiplication property. Simulation results showed that this method could improve the computational efficiency of R-ate pairing in SM9 by approximately 18.46%, and the efficiency of the SM9 signature algorithm by approximately 13.55%.
%K SM9&#65292
%K R-ate对&#65292
%K 蒙哥马利模乘&#65292
%K 滑动窗口算法<br>SM9
%K R-ate Pairing
%K Montgomery Modular Multiplication
%K Sliding Window Algorithm
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=111710