基于最大秩距离码的公钥密码系统  

Public-key cryptosystem based on maximum rank distance codes

作　　者：钱建发[1] 朱士信[2] 

机构地区：[1]安徽理工大学数理系,安徽淮南232001 [2]合肥工业大学应用数学系,安徽合肥230009

出　　处：《计算机工程与设计》2006年第12期2164-2165,共2页Computer Engineering and Design

基　　金：安徽省自然科学基金项目(03042201)

摘　　要：秩距离码及最大秩距离码的概念是由Gabidulin首先提出的,由于秩距离的特点,利用秩距离码构造的各种密码体制和认证系统的安全性比汉明距离度量的码更高。利用最大秩距离码,提出了新的McElience公钥密码系统,讨论了其可行性及安全性,证明了它比基于纠错码的McElience公钥密码系统更安全。而且,通过引入单向杂凑函数,使密码系统能有效的抗击消息重发攻击和相关消息攻击。The theory of rank distance codes and maximum rank distance codes is introduced by Gabidulin. The security ofcryptosystem constructed by rank distance codes is more secure than by Hamming codes for the character of rank distance. Based on maximum rank distance codes, an improved McElience public-key cryptosystem is presented. Feasibility and security of this scheme are discussed. It is proved that this scheme is more secure than the McElience public-key cryptosystem based on error-correcting codes. Moreover, using Hash function, the cryptosystem is effective for message resent attack and related message attack.

关 键 词：秩距离码 纠错码 最大秩距离码 公钥密码系统 杂凑函数 

分 类 号：TN918[电子电信—通信与信息系统]