As others have pointed out this isn't practical on current hardware. However with quantum computers I've read that there are already algorithms which would make short work of it. What I'd be curious to know is whether the key length has any bearing on the speed of said algorithms.
My guess would be that key length scales the quantum algorithm time much less than it scales the possibilities. Like, as key length squares, execution time doubles.
I don't know. It's seems crazy that an algorithm wouldn't be affected at all by significant numerical increases.
