摘要
大数模乘和模加/减是椭圆曲线密码学(Elliptic Curve Cryptography,ECC)中的基本运算.通过分析改进的Montgomery模乘算法,把模乘运算划分成3个阶段映射到3级流水线电路中,并在不影响模乘运算效率的情况下添加少量的硬件资源到流水线的第3个阶段,得到了一个模乘加单元(Modular Multiplication and Addition Unit,MMAU).和Crow等人给出的包含4个模操作ALU的模运算处理器相比,三级流水的MMAU节省了50%的资源,同时吞吐量提高了6%.
Large integer modular multiplication and modular addition/subtraction are basic operations in Elliptic Curve Cryptography(ECC).In this paper,we present a Modular Multiplication and Addition Unit(MMAU)by partitioning an improved Montgomery Modular Multiplication(MMM)algorithm into 3 independent parts,mapping it to a 3-stage pipelined circuit,and adding a small amount of hardware resource to the third stage of the pipeline for modular addition/abstraction without affecting the performance of MMM.Compared to m...
出处
《微电子学与计算机》
CSCD
北大核心
2009年第2期122-126,共5页
Microelectronics & Computer
基金
中国科学院研究生院课题项目(06JT079J01)