基于有限域GF（2^n）上椭圆曲线的组数字签名算法  

Group Digital Signature Scheme Based on the Elliptic Curve over Finite Field GF(2n)

作　　者：周立章[1] 

机构地区：[1]成都师范高等专科学校计算机科学系,四川成都611930

出　　处：《四川师范大学学报（自然科学版）》2002年第4期416-418,共3页Journal of Sichuan Normal University（Natural Science）

摘　　要：组数字签名是一个相对较新的概念 ,它有着广泛的应用 .而基于椭圆曲线密码体制的数字签名比其它签名具有更高的安全性和有效性 .将组数字签名与椭圆曲线密码体制相结合 ,提出了一个基于有限域GF(2 n)上椭圆曲线的组数字签名方案 ,其安全性建立在有限域GF(2 n)上椭圆曲线密码体制之上 .The group digital signature which is widely applied in the practice is a relatively new concept. Compared with other methods, the digital signature scheme based on the elliptic curve cryptosystem is more secure and more effective. A group digital signature scheme based on the disperse logarithm of the elliptic curve over the finite fields GF(2 n) is proposed in this paper. The security of the scheme is established on the elliptic curve cryptosystem over the finite field GF(2 n) .

关 键 词：组签名 椭圆曲线 离散对数 

分 类 号：TN918.4[电子电信—通信与信息系统]