摘要
在椭圆曲线密码体制(ECC)中,有限域GF(2m)上模乘运算是最基本的运算,加速模乘运算是提高ECC算法性能的关键。针对不同不可约多项式广泛应用的现状,提出了一种通用GF(2m)模乘加速器设计方案。该加速器通过指令调度的方式,能快捷地完成有限域上模乘运算。实现结果表明,该设计完全适用于智能卡等应用要求。
The modular multiplication over finite field GF （2^m） is the most fundamental operation in elliptic curve cryptography, and accelerating the modular multiplication is the key to improving the performances of ECC algorithms over GF（2^m）. With the wide application of different irreducible polynomials, the design scheme of a universal multiplication accelerator over GF （2^m） is given in this paper. It can accomplish modular multiplication according to instructions efficiently. The result of implementation indicates that the design satisfy many practical applications such as smart card.
出处
《电子技术应用》
北大核心
2008年第1期123-125,共3页
Application of Electronic Technique
关键词
有限域
椭圆曲线密码体制
模乘运算
快速实现
finite field
elliptic curve cryptography
modular multiplication
fast implementation
