基于GF(q^N)上秩距离码的校验矩阵的验证方案  

AN IDENTIFICATION SCHEME BASED ON PARITY CHECK MATRIX OF RANK DISTANCE CODES OVER GF(q^N)

作　　者：杜伟章[1] 王新梅[1] 

机构地区：[1]西安电子科技大学综合业务网国家重点实验室,西安710071

出　　处：《电子与信息学报》2001年第9期841-846,共6页Journal of Electronics & Information Technology

基　　金：高等学校博士学科点专项科研基金(批准号:98070104)

摘　　要：J.Stern(1996)在“公钥验证的一个新范例”中基于GF(2)上纠错码的校验矩阵提出了一验证方案。该文基于GF(q^N)(q为素数)上秩距离码的校验矩阵提出一新的验证方案,将J.Stern的方案中对秘密数据s的重量限制改为对s的秩的限制;证明了在随机预言模型中给出的协议是零知识交互证明,并显示出通过参数的适当选取,此方案比J.Stern的方案更安全。An identification scheme based on parity check matrix of error-correcting codes over GF(2) was proposed in the paper 'A New Paradigm for Public Key Identification' by J. Stern(1996), a new identification scheme based on parity check matrix of rank distance codes over GF(qN) (q is a prime) is proposed in this paper, the limitation on the weight of mysterious datum s is changed into the limitation on the rank of s. It is proved that the given protocol is a zero-knowledge interactive proof in the random oracle model, and it is shown that the scheme is more secure than the scheme of J. Stern when parameters are selected properly.

关 键 词：验证方案 校验矩阵 秩距离码 保密通信 零知识 

分 类 号：TN918.1[电子电信—通信与信息系统]