一种新的基于椭圆曲线码的子域子码的McEliece密码系统

A NEW MCELIECE CRYPTOSYSTEM BASED ON SUBFIELD SUBCODE OF ELLIPTIC CURVE CODE

1994年,Shor提出了具有多项式时间复杂度的针对整数分解问题和离散对数问题的量子算法。这意味着目前被广泛使用的RSA密码及其他基于离散对数问题的密码在可实用量子计算机出现的背景下是不安全的。可抗量子计算机攻击的后量子密码系统成为学界研究的热点问题。基于编码理论的密码系统是后量子密码系统的一个选择。在初始McEliece密码系统的基础上,设计一种新的基于椭圆曲线码的子域子码的McEliece密码系统。使用针对McEliece密码系统的通用攻击和针对基于代数几何码的McEliece密码系统的攻击对设计的密码系统进行安全分析。结果表明,该密码系统具有与初始McEliece密码系统相同的安全性能。

In 1994, P. Shor introduced a quantum algorithm with polynomial time complexity to solve integer factorization problem and discrete logarithm problem. It means that the widely used RSA cryptography and other cryptosystems based on discrete logarithm problem are insecure in the emergence of practical quantum computers. Postquantum cryptosystem, which can resist quantum computer attacks, has become a hot research topic. Code-based cryptosystem is a choice of the post-quantum cryptosystem. On the basis of the initial McEliece cryptosystem, we designed a new McEliece cryptosystem based on subfield subcode of elliptic curve code. Secure performance of the proposed cryptosystem was evaluated by general attacks against McEliece cryptosystem and attacks against cryptosystem based on algebraic geometry( AG) codes. It is shown that the proposed cryptosystem has the same secure performance as the original McEliece cryptosystem.