Abstract: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.
杜伟章; 王新梅. 基于GF(qN)上秩距离码的校验矩阵的验证方案[J]. 电子与信息学报, 2001, 23(9): 841-846 .
Du Weizhang; Wang Xinmei. AN IDENTIFICATION SCHEME BASED ON PARITY CHECK MATRIX OF RANK DISTANCE CODES OVER GF(qN). , 2001, 23(9): 841-846 .