←back to thread

335 points ingve | 1 comments | | HN request time: 0s | 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 #
1. mcswell ◴[] No.45087766[source]
Fiction, but interesting nonetheless: the 1992 film "Sneakers", with Robert Redford among others. The MacGuffin is a mathematician who discovers another way to factor large numbers.