一种基于纠错码的数字签名协议

发布时间：2018-10-15 13:31

【摘要】：基于纠错码中的NPC问题——陪集重量问题和一般线性码译码问题,首先提出了一个数字签名协议,接着对签名协议提供几种可能的攻击方法,例如穷举攻击、仅知密文攻击、选择明文攻击和利用密钥伪造签名,进行安全性分析,并且给出相应安全性分析的计算复杂度,介绍了四种Goppa码的参数及其相应数字签名协议的安全水平.通过实例分析该签名协议的可行性,即协议过程是矩阵之间的运算,分析了协议的计算效率,计算了密钥量,用示意图表示了正确解密的概率.结果表明:该协议不仅能实现签名和加密,而且实现复杂度低、加解密效率高,具有抵抗量子计算的潜力,能够广泛应用于电子交易过程.
[Abstract]:Based on the NPC problem in error-correcting codes, the coset weight problem and the decoding problem of general linear codes, a digital signature protocol is first proposed, and then several possible attack methods are provided for the signature protocol, such as exhaustive attack, only known ciphertext attack, etc. The security analysis is carried out by selecting plaintext attack and key forgery signature, and the computational complexity of the corresponding security analysis is given. The parameters of four Goppa codes and the security level of the corresponding digital signature protocols are introduced. The feasibility of the signature protocol is analyzed by an example, that is, the protocol process is an operation between matrices, the efficiency of the protocol is analyzed, the key quantity is calculated, and the probability of correct decryption is expressed by a schematic diagram. The results show that the protocol can not only implement signature and encryption, but also has low complexity, high efficiency of encryption and decryption, and has the potential to resist quantum computing. It can be widely used in electronic transactions.
【作者单位】：武汉大学计算机学院;武汉大学空天信息安全与可信计算教育部重点实验室;南京陆军指挥学院图书馆;
【基金】：国家自然科学基金资助项目(61303212,61170080,61202386);国家自然科学基金重点资助项目(61332019,U1135004);国家自然科学基金重大资助项目(91018008) 国家重点基础研究发展计划资助项目(2014CB340600) 湖北省自然科学基金资助项目(2011CDB453)
【分类号】：TN918.91

【参考文献】