Originally Posted by Blizzie
2 ^ 1024.. This will be interesting. I want to know what Kaspersky will do now.
Some people want to run distributed computing on the forums; but there's not enough computers out there to crack it efficiently.
Crack 1024 bit? It's a ***** but I imagine the sheer amount of overhead this program has to go through to encrypt everything to that standard would be at least noticeable and therefore preventable.
Rule #1 in Computing: If it can be created, it can be broken. Quantum computing would have this cracked wide open in no time
(On testing random possibilities)
"Meeting this scalability condition is possible for a wide range of systems. However, the use of error correction brings with it the cost of a greatly increased number of required qubits. The number required to factor integers using Shor's algorithm is still polynomial, and thought to be between L and L2, where L is the number of bits in the number to be factored; error correction algorithms would inflate this figure by an additional factor of L. For a 1000-bit number
, this implies a need about 10^4 qubits without error correction. With error correction, the figure would rise to about 10^7 qubits. Note that computation time is about L2 or about 10^7 steps and on 1 MHz, about 10 seconds.
-http://en.wikipedia.org/wiki/Quantum_computingEdited by Arkanor - 6/12/08 at 11:37pm