首页 | 本学科首页   官方微博 | 高级检索  
     检索      

有限域GF(2m)上椭圆曲线密码体制的快速实现
引用本文:秦媛媛,须文波,张海芹.有限域GF(2m)上椭圆曲线密码体制的快速实现[J].计算机工程与设计,2006,27(21):4133-4135.
作者姓名:秦媛媛  须文波  张海芹
作者单位:江南大学,信息工程学院,江苏,无锡,214122
摘    要:椭圆曲线密码体制的快速实现是当前公钥密码体制研究的热点之一。椭圆曲线上点的标量乘和加法运算是椭圆曲线密码算法的核心运算。为了提高运算速度,利用射影坐标思想,改进椭圆曲线上求两点和运算公式,对标量乘算法进行优化。讨论了椭圆曲线密码体制的优势及研究其快速实现的意义。

关 键 词:椭圆曲线密码体制  椭圆曲线  椭圆曲线离散对数  射影坐标  标量乘  点加
文章编号:1000-7024(2006)21-4133-03
收稿时间:2005-09-29
修稿时间:2005-09-29

Fast implementation of elliptic curves cryptosystem over GF (2m)
QIN Yuan-yuan,XU Wen-bo,ZHANG Hai-qin.Fast implementation of elliptic curves cryptosystem over GF (2m)[J].Computer Engineering and Design,2006,27(21):4133-4135.
Authors:QIN Yuan-yuan  XU Wen-bo  ZHANG Hai-qin
Institution:School of Information Technology, Southern Yangtze University, Wuxi 214122, China
Abstract:Fast implementation of elliptic curves cryptography is one of hot research spots in current public key cryptosystems. Scalar multiplication and point addition in elliptic curves are core operations in elliptic curve cryptosystem. In order to accelerate operating speed, projective coordinates are used and point addition is improved to optimize the scalar multiplication algorithm. The superiority of elliptic curve cryptography is discussed, and the significance of fast implementation is studied.
Keywords:elliptic curves cryptosystem  elliptic curve  elliptic curve discrete logarithm  projective coordinate  scalar multiplication  point addition
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号