基于有限域GF（2^n）上圆锥曲线的公钥密码算法  

A Public-Key Cryptosystem Based on Conic Curve in Finite Field GF（2^n）

作　　者：蔡永泉[1] 赵磊[1] 靳岩岩[1] 

机构地区：[1]北京工业大学计算机学院,北京100022

出　　处：《电子学报》2006年第8期1464-1468,共5页Acta Electronica Sinica

基　　金：国家863高技术研究发展计划(No.2005AA147090);北京市教委科技发展面上项目(No.KM200610005001)

摘　　要：圆锥曲线密码学是一种新型的公钥密码学,迄今对圆锥曲线密码学的研究成果都是以有限域GF(p)上的圆锥曲线为基础的.本文将有限域GF(p)上的圆锥曲线C(GF(p))推广为有限域GF(2n)上的圆锥曲线C(GF(2n)),证明了圆锥曲线C(GF(2n))上的点和加法运算构成有限交换群(C(GF(2n)),),并给出了圆锥曲线群(C(GF(2n)),)的阶的计算.此外,提出了使用有限域GF(2n)上的圆锥曲线群构造公钥密码系统,并给出了E lGam al加密方案和数字签名算法(DSA)在圆锥曲线C(GF(2n))上模拟的算法,最后分析其安全性.Conic curve cryptosystem was first introduced by CAO Zhenfu in 1998. By now,the previous study on conic curve cryptosystem has been based on conic curve group in finite field GF（p）. Since the hardware circuits are suitable for performing addition, multiplication, squaring and the inversion operations in a finite field GF（2n）, the operations in finite field GF（2^n） are typically easier to implement in hardware and software than their counterpart in finite field GF（p）. In order to speed up the computation of conic curve cryptosystem,the conic curve group is extended from finite field GF（p）. to finite field GF（2^n） ,and the order of the conic curve group in finite field GF（2n ） is given. In addition,this paper suggests to use conic curve group in finite field GF（2^n） for realizing public-key cryptosystem, and presents the basic EIGamal public-key encryption scheme and the Digital Signature Algorithm （DSA） based on conic curve in finite field GF（2^n）. Security of public-key cryptosystem based on conic curve in finite field GF（2n） is analyzed.

关 键 词：有限域GF(2^n) 圆锥曲线 公钥加密 数字签名 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]