摘要
文章详细描述了在192-bit素域上椭圆曲线公钥密码体制ECC(EllipticCurvepublickeyCryptography)在IntelMCS51微处理器系列智能卡上的实现过程。采用了Generalized-Mersenne素数作基域GF(p)(p=2192-264-1),利用模数的特殊形式及椭圆曲线的特殊参数,实现了GF(p)上ECC的全部过程,并且建立了软件库。运行速度表明ECC在计算资源受限、低功耗微处理器上实现是可行的。
This contribution describes how an elliptic curve public key cryptosystem can be implemented on the MCS51family of Microcontrollers.It uses a Generalized-Mersenne prime to implement the arithmetic in the underlying field GF(p)(p=2 192 -2 64 -1).It takes advantage of the special form of the moduli and the parameters of an elliptic curve to implement an elliptic curve system over GF(p),and successfully implement the library which supports192-bit Elliptic Curve DSA(ECDSA),and so on,and an elliptic curve cryptosystem can be implements on very low cost microprocessors with reasonable performance.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第32期127-129,134,共4页
Computer Engineering and Applications
基金
自然科学基金项目资助(编号:90204015
19931010)
国家973基础规划项目资助(编号:G1999035804)
河南省杰出青年基金项目资助(编号:0212001400)
关键词
有限域
椭圆曲线
公钥密码体制
标量乘法
MCS51
Finite fields,Elliptic curves,Public key cryptosystem,Scalar multiplication,MCS51