←back to thread

335 points ingve | 1 comments | | HN request time: 0.21s | 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 #
1. add-sub-mul-div ◴[] No.45083384[source]
"(Quick aside: the amount of optimization that has gone into this factoring-21 circuit is probably unrepresentative of what would be possible when factoring big numbers. I think a more plausible amount of optimization would produce a circuit with 500x the cost of the factoring-15 circuit… but a 100x overhead is sufficient to make my point. Regardless, special thanks to Noah Shutty for running expensive computer searches to find the conditional-multiplication-by-4-mod-21 subroutine used by this circuit.)"