摘要
特征为2的有限域GF(2m)较适合椭圆曲线密码算法的硬件实现。该文通过对GF(2m)上模运算的分析,将所有的模运算转化成模乘和模加,并对LSD乘法器的进行了改进,所设计的运算单元能进行GF(2m)上所有的模运算,利用该运算单元所实现的椭圆曲线密码算法具有面积小,速度快的优点,适合用于处理能力和存储空间受限的设备中。
Characteristic2fini te field is considered to be more suitable for hardware implementation of ECC.By analyzing the field arithmetic operations,this paper converts all the modular arithmetic to two types of modular arithmetic:modular multiplication and modul ar addition,and then by improving the architecture of LSD multiplier,it design s an arithmetic unit which can handle all the field arithmetic.The hardware im plementation of ECC which utilizing the arithmetic unit has small area and fast speed,and it is extremely suitable in equipments which have limited computation ability and storage space.
出处
《计算机工程与应用》
CSCD
北大核心
2004年第11期96-98,共3页
Computer Engineering and Applications
基金
国家863高技术研究发展计划资助课题(编号:2001AA141050)
关键词
椭圆曲线密码体制
射影Montgomery
点积算法
费马小定理
LSD乘法器
Elliptic Curve Cryptography,Montgomery's method in projective coordinates,Point multiplication,Fermat's little theore m,LSD multiplier
