Sequential multisignature algorithm by reference is analyzed and improved .Fast and efficient sequential blind multisignature scheme based on hyperelliptic curves is presented .the complexity and security of improved scheme are com‐pared and analyzed .Comparing with references ,improved scheme reduces computation costs 2nT H + 59 .616n - 38 .87ms . The results show that improved scheme has the advantages of low computation complexity ,low consumption of time ,high security and easy to achieve .%对已有文献提出的有序多重签名方案进行了分析和改进,提出快速和高效的基于超椭圆曲线的有序多重盲签名方案,并给出具体算法。比较和分析了改进方案的复杂度和安全性,与已有文献比较,改进方案的运算时间减少了2nT H +59.616n -38.87毫秒。改进方案具有运算量低,所需时间少,安全性高且易于实现等优点。
展开▼