You are not logged in. Your edit will be placed in a queue until it is peer reviewed.
We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.
Required fields*
- \$\begingroup\$ That's interesting. As far as I can tell, the two large factors I used were primes, at least according to sympy. Do you have an example of the found factors? Did you check their product? Well done, by the way. That was the intended solution. I blame the documentation. \$\endgroup\$Eric Duminil– Eric Duminil2020-10-25 06:39:46 +00:00Commented Oct 25, 2020 at 6:39
- \$\begingroup\$ @EricDuminil Indeed, it seems like I did something wrong (the most likely explanation is that I accidentally removed a digit from the middle when copying the base36-decoded result from Mathematica and removing the line break it inserted) \$\endgroup\$the default.– the default.2020-10-25 07:03:37 +00:00Commented Oct 25, 2020 at 7:03
- \$\begingroup\$ @EricDuminil A better program could still factor the number (in around 865 seconds). \$\endgroup\$the default.– the default.2020-10-25 07:24:44 +00:00Commented Oct 25, 2020 at 7:24
- \$\begingroup\$ Wow. Colored me impressed. I had no idea how to estimate the time it would take to factor the semiprime, and I didn't want the target to look suspiciously long. Do you know how the required time scales? How many more bits would be required for the factorization to be 3000 times longer (~1 month)? Even then, I guess that throwing more CPUs at the problem could bring the required time to a few days. It wasn't a bruteforce question anyway. Again : congrats. \$\endgroup\$Eric Duminil– Eric Duminil2020-10-25 08:44:28 +00:00Commented Oct 25, 2020 at 8:44
- 2\$\begingroup\$ @EricDuminil I used the Wikipedia page en.wikipedia.org/wiki/RSA_numbers to check if it's feasible to factorize the number (and it said that a 100-digit prime can be factored in 72 minutes on an old CPU). It seems that a 250-digit number is the largest one factored, and it was factored in February 2020. It also seems that it took them around 2700 core-years and they used cado-nfs. \$\endgroup\$the default.– the default.2020-10-25 09:01:35 +00:00Commented Oct 25, 2020 at 9:01
Add a comment |
How to Edit
- Correct minor typos or mistakes
- Clarify meaning without changing it
- Add related resources or links
- Always respect the author’s intent
- Don’t use edits to reply to the author
How to Format
- create code fences with backticks ` or tildes ~ ```
like so
``` - add language identifier to highlight code ```python
def function(foo):
print(foo)
``` - put returns between paragraphs
- for linebreak add 2 spaces at end
- _italic_ or **bold**
- indent code by 4 spaces
- backtick escapes
`like _so_` - quote by placing > at start of line
- to make links (use https whenever possible) <https://example.com>[example](https://example.com)<a href="https://example.com">example</a>
- MathJax equations
\$\sin^2 \theta\$
How to Tag
A tag is a keyword or label that categorizes your question with other, similar questions. Choose one or more (up to 5) tags that will help answerers to find and interpret your question.
- complete the sentence: my question is about...
- use tags that describe things or concepts that are essential, not incidental to your question
- favor using existing popular tags
- read the descriptions that appear below the tag
If your question is primarily about a topic for which you can't find a tag:
- combine multiple words into single-words with hyphens (e.g. code-golf), up to a maximum of 35 characters
- creating new tags is a privilege; if you can't yet create a tag you need, then post this question without it, then ask the community to create it for you