Public-key cryptosystem based on maximum rank distance codes
Shixin Zhu · Jisuanji gongcheng yu sheji · 2006
The theory of rank distance codes and maximum rank distance codes is introduced by Gabidulin.The security of cryptosystem 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.