作　　者： ; ; ; (董喆）;

机构地区： 武汉大学计算机学院

出　　处： 《华中科技大学学报（自然科学版）》 2014年第11期97-101,共5页

摘　　要： 基于纠错码中的NPC问题——陪集重量问题和一般线性码译码问题,首先提出了一个数字签名协议,接着对签名协议提供几种可能的攻击方法,例如穷举攻击、仅知密文攻击、选择明文攻击和利用密钥伪造签名,进行安全性分析,并且给出相应安全性分析的计算复杂度,介绍了四种Goppa码的参数及其相应数字签名协议的安全水平.通过实例分析该签名协议的可行性,即协议过程是矩阵之间的运算,分析了协议的计算效率,计算了密钥量,用示意图表示了正确解密的概率.结果表明:该协议不仅能实现签名和加密,而且实现复杂度低、加解密效率高,具有抵抗量子计算的潜力,能够广泛应用于电子交易过程. Based on closet weights and decoding problems in error correcting codes ,which were NP-complete ,a new digital signature protocol was proposed .Then the existing methods of attacking the digital signature protocol were analyzed ,such as brute force attack ,ciphertext only attack ,plaintext chosen attack and forged signature ,and computational complexity of the corresponding attack were al-so proposed .Some parameters of four Goppa codes and security level of the corresponding digital sig-nature protocols were given .Finally ,experimental results and security parameters which are designed have proven that the matrix calculation ,decryption with probability correctly ,and relatively code rates are efficient ,which make the validity of the proposed protocol .The scheme has much more ad-vantages in low computational complexity ,decryption with probability correctly ,the potential to re-sist known quantum algorithms attacks ,which can be widely used in electronic transaction process .

关 键 词： 密码学 密码编码学 数字签名协议 纠错码 抗量子密码

领　　域： [电子电信] [电子电信]