论文部分内容阅读
J.Stern(1996)在“公钥验证的一个新范例”中基于GF(2)上纠错码的校验矩阵提出了一验证方案。该文基于GF(q~N)(q为素数)上秩距离码的校验矩阵提出一新的验证方案,将J.Stern的方案中对秘密数据s的重量限制改为对s的秩的限制;证明了在随机预言模型中给出的协议是零知识交互证明,并显示出通过参数的适当选取,此方案比J.Stern的方案更安全。
J. Stern (1996) proposed a verification scheme based on a check matrix of error correction codes on GF (2) in “A New Paradigm of Public-Key Authentication”. In this paper, a new verification scheme is proposed based on the check matrix of rank distance codes over GF (q ~ N) (q is a prime number), and the weight limit of the secret data s in J. Stern’s scheme is changed to the rank of s The proofs that the protocol given in the random prophecy model is proof of zero knowledge interaction and shows that this scheme is safer than that of J. Stern through the proper selection of parameters.