一种简化求商的高基Montgomery模乘阵列结构  

High Radix Montgomery Modular Multiplication Array Structures of Simplifying Quotient Determination

作　　者：邬贵明 郑方 谢向辉 严忻恺 

机构地区：[1]数学工程与先进计算国家重点实验室,无锡214125

出　　处：《高性能计算技术》2014年第4期1-4,共4页

摘　　要：模乘运算是RSA和ECC等公钥密码系统中的基本操作，其性能决定着整个系统的性能。原始的Montgomery模乘算法求商操作复杂，对应的硬件结构延迟较长。本文针对Orup提出的简化求商的高基Montgomery模乘算法，提出了一种简化求商的高基Montgomery模乘阵列结构，该结构具有低延迟、低实现代价等优势。基于Virtex-5XC5VLX330FPGA实现了提出的阵列结构，实验结果显示，简化求商的高基Montgomery模乘阵列结构与原始结构相比。吞吐率相近而实现代价仅为原始结构的1／2。Modular multiplication is one of basic operations in the public key cryptosystem. It determines the performance of the whole system. The original Montgomery modular multiplication has complex quotient determination, making the latency of the according hardware design longer. In this paper, we present a hardware structure to implement the algorithm simplifying quotient determination proposed by Orup. Our structure has the advantage of shorter latency and lower hardware cost. We implemented our structure on a Virtex-5 XC5VLX330 FPGA. The experimental results show that our structure has the close throughput and the half cost, compared to the original structure.

关 键 词：MONTGOMERY模乘 阵列结构 FPGA 

分 类 号：TP303[自动化与计算机技术—计算机系统结构]