SM2高速双域Montgomery模乘的硬件设计  

A High Speed Structure for Dual-Field Montgomery Modular Multiplication in SM2

作　　者：郭晓[1] 蒋安平[1] 宗宇[1] 

机构地区：[1]北京微电子技术研究所,北京100076

出　　处：《微电子学与计算机》2013年第9期17-21,共5页Microelectronics & Computer

摘　　要：作为由国家密码管理局公布的SM2椭圆曲线公钥密码算法的核心运算,模乘的实现好坏直接决定着整个密码芯片性能的优劣.Montgomery模乘算法是目前最高效也是应用最为广泛的一种模乘算法.本文基于Montgomery模乘算法,设计了一种高速,且支持双域(GF(p)素数域和GF(2m)二进制域)的Montgomery模乘器.提出了新的实现结构,以及一种新型的Wallace树乘法单元.通过对模块合理的安排和复用,本设计极大的缩小了时间消耗与硬件需求,节省了大量的资源.实现256位双域模乘仅需0.34μs.Being the key algorithm of SM2, the special elliptic curve cryptography algorithm presented by OSCCA, modular multiplication defines the system＇s overall performance. One of the most efficient and widely used modular multiplication algorithms is Montgomery modular multiplication algorithm. This paper presents a new hardware architecture to realize modular multiply in dual field （GF（p） and GF（2m）） based on the improved dual--field Montgomery modular multiplication＇ s algorithm. A new kind of Wallace tree multiplier is also presented in this paper. This multiplier could realize higher performance with less computing resource and lower timing consumption due to the reasonable arrangement and reusing of modules. One complete operation of 256 bit dual--field modular multiplier can be finished in 0. 34μs.

关 键 词：SM2 模乘运算 MONTGOMERY算法 双域实现 

分 类 号：TN918[电子电信—通信与信息系统]