首页> 外文期刊>Journal of systems science & information >Forgery Attacks on Wang's Signature Schemes Based on Factoring and Discrete Logarithm
【24h】

Forgery Attacks on Wang's Signature Schemes Based on Factoring and Discrete Logarithm

机译:基于因子和离散对数的王氏签名方案的伪造攻击

获取原文
获取原文并翻译 | 示例
           

摘要

To enhance the security of signature schemes, Wang proposed two signature schemes based on the difficulties of simultaneously solving the factoring and discrete logarithm problems with almost the same sizes of arithmetic modulus. This paper, firstly, shows that Wang's signature scheme 1 do not satisfy the claimed properties. Moreover, we will point out that the all variants of Wang's scheme 2 are not secure if attackers can solve discrete logarithm problems.
机译:为了提高签名方案的安全性,Wang提出了两种签名方案,以同时解决算数模数几乎相同的分解因数和离散对数问题为难。首先,本文表明王的签名方案1不满足要求的属性。此外,我们将指出,如果攻击者可以解决离散的对数问题,Wang方案2的所有变体都是不安全的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号