Editing Incubator escapee wiki:WikiProject Cryptography/CryptographyBlog (section)

===RSA and factoring===
Finding the RSA secret key proved deterministic polynomial time equivalent to factoring by Alexander May. Only of theoretical significance. [[User:Arvindn|Arvindn]] 00:52, 22 Aug 2004 (UTC)
: Can we add this to the article ([[RSA]]) ? [[User:Matt Crypto|&mdash; Matt]] 22:05, 12 Sep 2004 (UTC)

::Explaining the result would take about a paragraph, so I'm not sure if it's worth it. [[User:Arvindn|Arvindn]] 03:06, 9 Oct 2004 (UTC)

Just to clarify this - The RSA problem has not been shown to be equivalent to factoring.  What's been found is a deterministic algorithm for determining p and q given n, e, and d - a non-deterministic algorithm for this has long been known, so it's no big. [[User:Ciphergoth2|ciphergoth]] 18:34, 2004 Nov 17 (UTC)
: I think an [[RSA problem]] article separate from [[RSA]] would be worthwhile (certainly, [http://www.win.tue.nl/~henkvt/Content.html other encyclopedia]'s think so...) [[User:Matt Crypto|&mdash; Matt]] 22:49, 17 Nov 2004 (UTC)