Talk:Computational hardness assumption
From Wikipedia, the free encyclopedia
I am stunned to see that the article states that the RSA problem is more difficult than integer factorisation. This is not yet proven, and as such is merely speculations. 212.242.167.26 (talk) 17:21, 25 February 2008 (UTC)
Good point. But I think the intention was to say that it is stronger assumption that RSA problem is hard than that integer factorization is hard, because it is not yet proven that the RSA problem is as hard as the integer factorization problem. I think that the article should be clarified somehow. I'm not quite sure how, yet. DRLB (talk) 14:53, 26 February 2008 (UTC)