【摘要】 文章首先指出连分式分析方法并非“对REESSE1公钥算法的攻击”一文的原创思想。通过举例说明了“攻文”定理4不是连分式收敛项的必要条件,并通过对杠杆函数不确定性的讨论和反例的举证说明了“攻文”定理4不是W与W-1相互抵消的充分条件,从而证明了“攻文”算法1和2及其衍生方法是错误的。文章论述了REESSE1加密算法的安全性是大于离散对数难题的,简介了REESSE1的降模优化思想、体制的特点和优点,列举了优化后有关参数的情况,并从安全性、模长、密钥长度和运算速度等方面把优化后的REESSE1与ECC、RSA等做了比较。更多还原

【Abstract】 This paper first points out that the continued fraction analysis method is not the original idea of the refuted paper "The Attack on the REESSE1 Public Key Algorithms".By giving the example,expounds that theorem 4 in the refuted paper is not the necessary condition of continued fraction convergences,by discussing the indeterminacy of the lever function and citing the counterexamples,argues that theorem 4 is not sufficient condition of the parameters W and W^-1 neutralizing each other,and so shows that algorithm 1 and 2 in the refuted paper are incorrect.The paper proves that the security of the REESSE1 encryption scheme is greater than the discrete logarithm hardness,presents the optimization based on decreasing moduli,the characteristics and the merits of REESSE1,lists the values of the relevant parameters optimized,and compares optimized REESSE1 with ECC and RSA in securities,modulus lengths,key lengths and operation speeds.更多还原