Journal of South China University of Technology (Natural Science Edition) ›› 2010, Vol. 38 ›› Issue (11): 135-140.doi: 10.3969/j.issn.1000-565X.2010.11.024

• Computer Science & Technology • Previous Articles     Next Articles

An Improved RMPKC Scheme

Yuan Feng 1.2  Hu Yu-pu1  Ou Hai-wen2  Li Shun-bo 1.3   

  1. 1.Key Laboratory of Computer Networks and Information Security,Ministry of Education,Xidian University,Xi＇an 710071,Shaanxi,China;2.Key Laboratory of Information Security,Beijing Electronic Science and Technology Institute,Beijing 100070,China;3.School of Science,Xi＇an University of Architecture and Technology,Xi＇an 710055,Shaanxi,China
  • Received:2010-01-19 Revised:2010-04-28 Online:2010-11-25 Published:2010-11-25
  • Contact: 袁峰（1982-），男，博士生，主要从事公钥密码学研究． E-mail:fyuan1234@yahoo．cn
  • About author:袁峰（1982-），男，博士生，主要从事公钥密码学研究．
  • Supported by:

    国家“973”计划项目（2007CB311201）; 国家自然科学基金资助项目（60970119 60803149）

PDF

750

Abstract:

As the rational multivariate public key cryptosystem（RMPKC） had been broken by an improved 2R decomposition method,this paper proposes an improved RMPKC scheme.In this scheme,the order of the function of the first rational mapping is changed to three while that of the second remains unchanged.Based on this core idea,the requirement for conducting the 2R decomposition attack is not fulfilled.Thus,the current 2R decomposition attack is effectively resisted by the improved RMPKC scheme.It is proved that the 2R decomposition attack is valid when the order of the function of the second rational mapping is changed to three while that of the first remains unchanged.

Key words: cryptography, public key cryptography, mapping, polynomial, composition, decomposition