基于有限域GF（2n）上圆锥曲线的群签名方案

摘要

文章提出了一种基于有限域GF(2n)上圆锥曲线群签名方案，并做了数值模拟和性能分析。方案不仅具有圆锥曲线群签名方案的匿名性、不可伪造性、可追踪性等特点，而且结合标准二进制可以快速计算群元素的整数倍，其中包含GF(2n)上圆锥曲线上高效的二倍点运算，比有限域Fp上圆锥曲线群签名方案更加高效，具有较好的现实意义。%This paper designed a group signature scheme on conic curve over ifnite ifeld GF(2n), and made its numerical simulation and performance analysis. The scheme not only has the features of anonymity, unforgeability, traceability and high safety which most of group signature schemes based on conic curve have, but combined the calculation with NAF could also made the multiple group elements operation, which contained high-efficiency double group element operation on conic curve over GF(2n), more efifcient. This scheme is more efifcient than group signature schemes on conic curve over ifnite ifled Fp , in addition, is promising.