对两篇分析REESSE1+难题的文章的回复  

Reply to Two Papers Analyzing REESSE1+ Problems

作　　者：苏盛辉[1] 吕述望[2] 

机构地区：[1]北京工业大学计算机学院,北京100124 [2]中国科学院研究生院,北京100049

出　　处：《信息安全与通信保密》2013年第6期46-47,52,共3页Information Security and Communications Privacy

摘　　要：文中对分析两个REESSE1+难题的两篇文章进行了回复,指出第一篇文章在攻击任务的时间复杂度分析方面存在明显错误,确认了第二篇文章所指出的原有文章在背包密度计算方面的错误,并给出了正确的计算公式。然而,LLL格基归约方法对背包密度小于1的原型REESSE1+的密文仅是可能有点效果,这一点从一个例子可以看出,而对背包密度大于1的实用REESSE1+(即JUNA)的密文却是完全无效的。最后,文章对REESSE1+公钥体制的创新点进行了总结,并阐述了公钥密码学与数学及计算机科学之间的关系。This article replies to the two papers analyzing the two REESSEI＋ problems. It points out that Paper 1 has a obvious mistake in the analysis of time complexity, affirms the argument by Paper2 that the computation of knapsack density is incorrect in the original thesis, and gives the correct computational formula for knapsack density. However, LLL lattice basis reduction is only possible somewhat effectual on prototypic REESSEI＋ ciphertexts of which the knapsack density is less than 1, to be seen in an example, while utterly ineffectual on ciphertexts of the practical REESSEI＋（namely JUNA）, of which the knapsack density is greater than 1. Finally, this article summarizes the novelties of REESSEl＋ public key cryptosystem, and expounds the relations between public key cryptography and mathematics, and computer science.

关 键 词：密码学 REESSE1+公钥体制 安全性 单向难题 归约 

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