基于编码问题的密码理论研究

项目名称： 基于编码问题的密码理论研究

项目编号： No.61272037

项目类型： 面上项目

立项/批准年度： 2013

项目学科： 自动化技术、计算机技术

项目作者： 郑东

作者单位： 西安邮电大学

项目金额： 61万元

中文摘要： Peter Shor于1994年指出量子计算机能够攻破传统的公钥密码技术（如 RSA、DSA、ECDSA等），这意味着一旦量子计算机出现，当前使用的传统公钥密码算法将全部失去作用。因此人们需要寻找新的公钥密码算法以便在量子计算机时代替代传统密码算法，抵抗量子计算攻击（这种密码技术被称为后-量子密码）。后量子密码是近年来快速发展的研究领域之一，目前有四种密码体制被认为能够抵抗量子计算机攻击：基于编码问题的密码体制、基于HASH 的密码体制、基于格问题的密码体制、基于多变量问题的密码体制。本课题将研究基于编码问题的公钥密码体制，主要内容包括：具有紧性表示的基于准-Coppa码的的公钥加密算法、具有紧性表示的基于准-循环码的公钥加密算法、基于准-二元LDPC码的公钥加密算法、具有紧性密钥表示的基于准-二元 Coppa码的、高效的数字签名算法、具有紧密钥表示、高效率、短签名长度的环签名或门限签名。

中文关键词： 纠错码；公钥加密；数字签名；后量子密码；

英文摘要： In 1994 Peter Shor showed that quantum computers could break any public-key cryptosystem based on these hard number theory problems. This means that if a reasonably powerful quantum computer could be built, it would put essentially all modern communication into peril. It is predicted that within the next 10 to 20 years quantum computers will be built that are sufficiently powerful to implement Shor's ideas and to break all existing public key schemes. Thus we need to look ahead to a future of quantum computers, and we need to prepare the cryptographic world for that future. Post-quantum cryptography is a new fast developing area, where public key cryptosystems are studied that could resist these emerging attacks. Currently there are four families of public-key cryptosystems that have the potential to resist quantum computers: the code-based public-key cryptosystems, the hash-based public-key cryptosystems,the latticebased public-key cryptosystems and the multivariate public-key cryptosystems. Our study focus on the code based cryptosystems. We will propose the class of quasi-dyadic Goppa codes, which admit a very compact parity-check or a generator matrix representation,for efficiently instantiating syndrome-based cryptosystems.we will also give a new general way to reduce the public key size through quasi-cy

英文关键词： error correcting codes；public key encryption；digital signature；post-quantum cryptography；