北京交通大学学报2013，Vol.37Issue(5)：132-137,6.
有限域GF(pm)上圆锥曲线标量乘快速算法
Fast scalar multiplication algorithm of conic curve over GF(pm)
摘要
Abstract
Until now,all the previous studies on conic curve cryptography have been based on the prime field GF (p).The field with characteristic 2,and the ring Z/nZ,where n =pq is the product of two primes In this paper,conic curves defined over the extension field GF (pm) are discussed.The Frobenius map of the points on the conic curves over GF (pm) is defined.Based on this,a new method of computing scalar multiplication of conic curve over GF (pm) is presented.The theoretical analysis and numerical comparison about the new method and traditional methods are given.The results show that the new method is more efficient than the traditional ones on the same memory spaces for precomputed points.关键词
密码学/圆锥曲线/有限域GF(pm)/Frobenius/标量乘算法Key words
cryptology/ conic curve/ finite field GF (pm)/ Frobenius/ scalar multiplication分类
信息技术与安全科学引用本文复制引用
刘铎..有限域GF(pm)上圆锥曲线标量乘快速算法[J].北京交通大学学报,2013,37(5):132-137,6.基金项目
国家自然科学基金资助项目(60673065) （60673065）
中央高校基本科研业务费专项资金资助(2011JBM153) （2011JBM153）
