摘要
利用二元一次不定方程和Schnorr身份鉴别协议,构造出一个新的身份鉴别协议,该协议在RSA问题和离散对数问题是难解的假设下是安全的,同时给出了所对应的数字签名方案。
By means of bivariate simple equation and Schnorr' s identification scheme, the paper designs a new identification scheme which is secure under the hypothesises that RSA problem and the discrete logarithm problem are intractable. Tnis thesis also proposes the corresponding digital signature scheme.
出处
《计算机与现代化》
2006年第10期123-126,共4页
Computer and Modernization
关键词
身份鉴别
数字签名
离散对数问题
RSA
identification
digital signature
discrete logarithm problem
RSA