←back to thread

335 points ingve | 1 comments | | HN request time: 0.216s | source
Show context
AceJohnny2 ◴[] No.45083369[source]
What does this mean about the size (and thus feasibility) of a circuit required to factor a cryptographically interesting number, say, to be generous, RSA1024?
replies(3): >>45083384 #>>45083585 #>>45085971 #
Davidzheng ◴[] No.45083585[source]
Off topic, but are cryptographers convinced that on the new gigawatt data centers RSA1024 is infeasible to factor? I gather that the fastest known algorithms are still too slow to factor it in reasonable time. But is consensus that there will not be improvements to these algorithms in near future?
replies(5): >>45083630 #>>45083640 #>>45084065 #>>45084254 #>>45087766 #
rwmj ◴[] No.45083640[source]
Number Field Sieves are still the best method, and the techniques are three or more decades old with only incremental improvements. (Of course there might be an incredible breakthrough tomorrow.)
replies(1): >>45083688 #
tiahura ◴[] No.45083688[source]
best published method
replies(2): >>45084217 #>>45084376 #
consp ◴[] No.45084217[source]
Are the bitcoins in the first wallets gone? No? I will assume it's still the best method without any irrefutable evidence.
replies(2): >>45084251 #>>45084273 #
1. capitainenemo ◴[] No.45084251[source]
Well, this discussion is about prime number factorisation, and bitcoins use elliptic curve...