摘要
目前基于离散对数问题(如ElGamal或Schnorr)的代理群签名算法都要进行大数的模指数运算,效率一般不高,尤其是当群用户数目很多时问题将更加严重。利用有限域中二次方程的一些特性,提出了一种基于因式分解的代理群签名方案,该算法以乘法或求逆等简单运算形式为基础,计算效率有显著提高,能够满足群用户较多时对群签名的需求。
Currently,most of the proxy-multi-signature schemes are based on discrete logarithm（such as Elgamal or Sehnorr） with low efficiency because of the complexity of module exponential computation,and the situation will become even worse when there are plenty of users.According to some useful characteristics of the 2-orders equation in finite scopes,a new type of proxy-multisignature scheme based on factor polynomials is proposed in this paper,using the computation forms such as multiply and reversion,etc.lts efficiency can be enhanced considerably,and can be utilized in the circumstance with plenty of users.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第27期105-106,142,共3页
Computer Engineering and Applications
基金
教育部新世纪优秀人才支持计划项目(批准号:NCET-05-0897)
关键词
因式分解
代理签名
群签名
factor polynomials
proxy-signature
multi-signature
