菜单

基于因式分松的代劳动帮签署方案

2019年2月7日 - 188bet官网

  全文:

  PDF

  (382 KB)

  HTML

  (0 KB)

  输入: BibTeX | EndNote (RIS)

  背景材料

  摘要 当前基于团弄圆对数效实(如ElGamal或Schnorr)的代劳动帮签署算法邑要终止父亲数的模指数运算,效力普畅通不高,更是当帮用户数量很多时效实将更其严重。使用拥有限域中二次方程的壹些特点,提出产了壹种基于因式分松的代劳动帮签署方案,该算法以迨法或寻求叛逆等骈杂运算方法为基础,计算效力拥有清楚提高,却以满意帮用户较多时对帮签署的需寻求。

  效力动

  

  把本文伸荐给对象

  

  参加以我的书架

  

  参加以援用办器

  

  E-mail Alert

  

  RSS

  干者相干文字

  

  

  188bet: 因式分松

  代劳动签署

  帮签署

  Abstract:

  Currently,most of the proxy-multi-signature schemes are based on discrete logarithm(such as Elgamal or Schnorr) 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-multi-signature scheme based on factor polynomials is proposed in this paper,using the computation forms such as multiply and reversion,etc.Its efficiency can be enhanced considerably,and can be utilized in the circumstance with plenty of users.

  Key words: factor polynomials proxy-signature multi-signature

  收稿日期: 2008-05-26;

  出产版日期: 2006-02-21

  PACS:

  畅通信干者: 胡茂银

  援用本文:

  $author.xingMing_CN,$author.xingMing_CN. 基于因式分松的代劳动帮签署方案[J]. journal6, 2009, 45(27): 105-106.

  HU Mao-yin,JIA Zhen-hong. Proxy-multi-signature scheme based on factor polynomials[J]. CEA, 2009, 45(27): 105-106.

  链接本文:

  http://cea.ceaj.org/CN/10.3778/j.issn.1002-8331.2009.27.032

标签:

发表评论

电子邮件地址不会被公开。 必填项已用*标注

友情链接:

凯时国际娱乐 ag视讯 bbin betway 沙巴体育