%0 Journal Article
%T AN IDENTIFICATION SCHEME BASED ON PARITY CHECK MATRIX OF RANK DISTANCE CODES OVER GF(qN)<br>基于GF(qN)上秩距离码的校验矩阵的验证方案
%A Du Weizhang
%A Wang Xinmei
%A <br>杜伟章
%A 王新梅
%J 电子与信息学报
%D 2001
%I 
%X 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.
%K Identification scheme
%K Parity check matrix
%K Rank distance code
%K Zero-knowledge<br>验证方案
%K 校验矩阵
%K 秩距离码
%K 保密通信
%K 零知识
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=EDE7855F8AA76437&yid=14E7EF987E4155E6&vid=EA389574707BDED3&iid=9CF7A0430CBB2DFD&sid=2EA35D7E5C9A6E66&eid=5EB19D41D7A73119&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=5