|
|
|
| AN IDENTIFICATION SCHEME BASED ON PARITY CHECK MATRIX OF RANK DISTANCE CODES OVER GF(qN) |
| Du Weizhang; Wang Xinmei |
| National Key Lab of Integrated Service Networks Xidian Univ.,Xi an 710071 China |
|
|
|
|
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.
|
|
Received: 19 October 1999
|
|
|
|
|
|
|
|
|
2001, Vol. 23 
