Talk:Computational hardness assumption

Mathematics Start‑class Mid‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Mid	This article has been rated as Mid-priority on the project's priority scale.

Cryptography: Computer science Start‑class Mid‑importance

	This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Mid	This article has been rated as Mid-importance on the importance scale.
	This article is supported by WikiProject Computer science (assessed as Mid-importance).

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)[reply]

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)[reply]

Same goes for the DLP and Diffie-Hellman. AFAIK there is no proof that DHP is easier than DLP, actually there's a link from the Computational Diffie-Hellman assumption page to a paper that suggests they may be equivalent. —Preceding unsigned comment added by 84.110.170.10 (talk) 17:18, 22 June 2008 (UTC)[reply]

according to http://en.wikipedia.org/wiki/RSA_problem "the RSA problem is at least as easy as factoring, but it might well be easier" with sufficient explanations. so someone please change "RSA problem (stronger than factorization)" to "RSA problem (weaker than factorization)" - am i right? Hm nerd (talk) 17:56, 20 August 2015 (UTC)[reply]