莫一奉, 李树国. 基于余数系统RSA密码算法快速实现[J]. 微电子学与计算机, 2017, 34(11): 11-15.
引用本文: 莫一奉, 李树国. 基于余数系统RSA密码算法快速实现[J]. 微电子学与计算机, 2017, 34(11): 11-15.
MO Yi-feng, LI Shu-guo. Fast Implementation of RSA Algorithm Based on RNS[J]. Microelectronics & Computer, 2017, 34(11): 11-15.
Citation: MO Yi-feng, LI Shu-guo. Fast Implementation of RSA Algorithm Based on RNS[J]. Microelectronics & Computer, 2017, 34(11): 11-15.

基于余数系统RSA密码算法快速实现

Fast Implementation of RSA Algorithm Based on RNS

  • 摘要: 本文基于余数系统实现了RSA密码算法.为每一个计算单元选择形式相近的四个模, 基于这四个模的约减单元比常规方法选模对应的约减单元所需要面积更小, 延时而更短.按照本文提出的方法选模, 选了7组共28个位宽为74的模, 应用这些模基于Cox-Rower结构设计了余数系统蒙哥马利模乘器, 实现RSA密码算法.在SMIC 0.13 μm标准单元库下进行综合, 设计的RSA电路最高频率278 MHz.在该频率下, 中国剩余定理模式下的1 024、2 048位RSA以及常规模式下1 024位RSA解密分别需要710 μs、99 μs、350 μs, 快于已发表的同类设计.

     

    Abstract: In this paper, we implement RSA cryptographic using Residue number system (RNS). We choose four modulo similar in the form for every computational unit. The reduction unit supports these four modulo is smaller and shorter than the required reduction unit corresponding to the conventional method selection. According to our proposed method, we select seven groups of modulo with a width of 74, and design a RNS Montgomery multiplier based on Cox-Rower architecture to implement RSA cryptography. In the SMIC 0.13 μm standard cell library, clock frequency reaches up to 278 MHz. At this frequency, 1 024, 2 048-bit RSA decryption in Chinese Remainder Theorem (CRT) mode and 1 024-bit RSA decryption require 710 μs, 99 μs, 350 μs, respectively, faster than the published related designs.

     

/

返回文章
返回