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

Du Weizhang; Wang Xinmei

Volume 23 Issue 9

Sep. 2001

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2001 > 23(9): 841-846

Du Weizhang, Wang Xinmei. AN IDENTIFICATION SCHEME BASED ON PARITY CHECK MATRIX OF RANK DISTANCE CODES OVER GF(qN)[J]. Journal of Electronics & Information Technology, 2001, 23(9): 841-846.

Citation:

Du Weizhang, Wang Xinmei. AN IDENTIFICATION SCHEME BASED ON PARITY CHECK MATRIX OF RANK DISTANCE CODES OVER GF(qN)[J]. Journal of Electronics & Information Technology, 2001, 23(9): 841-846.

Du Weizhang, Wang Xinmei. AN IDENTIFICATION SCHEME BASED ON PARITY CHECK MATRIX OF RANK DISTANCE CODES OVER GF(qN)[J]. Journal of Electronics & Information Technology, 2001, 23(9): 841-846.

Citation:

Du Weizhang, Wang Xinmei. AN IDENTIFICATION SCHEME BASED ON PARITY CHECK MATRIX OF RANK DISTANCE CODES OVER GF(qN)[J]. Journal of Electronics & Information Technology, 2001, 23(9): 841-846.

PDF( 1038 KB)

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

Received Date: 1999-10-19
Rev Recd Date: 2000-04-07
Publish Date: 2001-09-19

Abstract

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.

FullText(HTML)

References(1)

References

S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof-systems,SIAM Journal on Computing, 1989, 18(1), 186-208.[2]J. Stern, A new paradigm for public key identification, IEEE Trans. on Information Theory,1996, 42(6), 1757-1768.[3]E.M. Gabidulin, Theory of codes with maximum rank distance, Problems of Information Transmission, 1985, 21(1), 1-12.[4]U. Feige, A. Fiat, A. Shamir, Zero knowledge proofs of identity. Journal of Cryptology, 1988,1(2), 77 94.[5]F. Chabaud.[J].J. Stern, The cryptographic security of the syndrome decoding problem for rank distance codes, Advances in Cryptology-Asiacrypt96 (K.Kim, T. Matsumoto, eds.), Lecture Notes in Computer Science, Vol.1163, Berlin, Springer-Verlag.1996,:-

Relative Articles

Supplements(0)

Cited By

Proportional views