对Schnorr签名方案几种攻击的分析  

Analysis of Some Attacks against the Schnorr Signature Scheme

作　　者：胡国政[1,2] 洪帆[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,武汉430074 [2]武汉理工大学理学院数学系,武汉430073

出　　处：《计算机科学》2009年第10期98-100,共3页Computer Science

基　　金：国家自然科学基金项目(60703048);湖北省自然科学基金项目(2007ABA313)资助

摘　　要：Schnorr签名方案是一个基于离散对数的数字签名方案。最近,一些文献提出了新的攻击该签名方案的方法,并声称这些新的攻击成功率很高。分析了这些攻击方法,认为这些新的攻击本质上是平凡的穷搜索攻击。在系统给定的安全参数下,这些攻击成功的概率是可以忽略的。还指出了这些攻击成功率分析中的错误。The Schnorr signature scheme is a digital signature scheme based on discrete logarithms. Recently some attacks against the Schnorr signature scheme were presented in the literature and they claimed that these new attacks had the greater success probability. However, these attacks were analyzed and the conclusion is that all these new attacks are essentially trivial exhaust search ones. Given certain system security parameters, the success probability of theses attacks is negligible. Moreover, some mistakes in the probability analysis of these attacks were pointed out.

关 键 词：SCHNORR签名 密码分析 穷搜索攻击 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]