Timeline for Is integer factorization harder than RSA ($n=pq$) factorization? [closed]
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| May 25, 2011 at 16:29 | comment | added | M.S. | @KotelKanim If $n$ is not decomposable into a product $pq$ of two primes, then RSA oracle will terminate (in polytime) with the answer NONE (or 'false' if you wish). | |
| May 25, 2011 at 7:05 | comment | added | KotelKanim | I would very much want the question to be reopen but I don't want to argue about MO policy so I will just wait patiently. meanwhile, to clarify the question, what would the oracle return for an input which is not a pq number? will it return "false" or just run into an infinite loop? the question is whether you can use this oracle for detection of semi-primness as well as for factorization of semi-primes. (I have no idea what the answer is in neither of the cases...) | |
| May 25, 2011 at 3:44 | comment | added | M.S. | @François: Well, fair enough. | |
| May 25, 2011 at 3:37 | comment | added | François G. Dorais | I closed your answer as 'no longer relevant.' The reason is that you didn't wait long enough before cross posting your question. Once you've waited a few days, flag your post for moderator attention and it will be reopened. | |
| May 25, 2011 at 3:35 | history | closed | François G. Dorais | no longer relevant | |
| May 25, 2011 at 3:14 | history | asked | M.S. | CC BY-SA 3.0 |