What a waste of words.
It took less than 10 seconds with a Google search engine to turn up the following:
That is not true. Quantum Computers need an efficient quantum algorithm. Shor's algorithm is very effective at brute forcing public key systems (RSA, DSA, ECDSA). They don't significantly reduce the security of symmetric (AES) cryptography or hashing algorithms (SHA-256).
Hashing functions are effectively immune to the potential of quantum computing. Shor's algorithm can not be used against hashing functions or symetric cryptography.
To say quantum computing is "advancing rapidly" is an overstatement. In 2001 the largest number to be factored by a general purpose quantum computer using Shor's algorithm was 15. By 2011 the largest number to be factored was 143. That is from 4 bits to 8 bits in the span of a decade. We are a long way from factoring even 256 bit numbers and 256 bit ECDSA keys are even harder (~3,072 RSA key = integer factorization).
Nobody said 256 bit encryption will be secure forever. It is infeasible to brute force a 256 bit key using classical computing. Quantum computing may someday break it but it may not, quantum decoherence is a bitch. It is possible ECDSA has some flaw and cryptanalysis will someday weakened it to a point it is economical to attack it. That could be next year or not in the next century.
Did you put any effort at all into figuring out if your FUD had any merit before you came running to the forum to declare a "menace" that has already been discussed dozens of times over the past 5 years?
Cool down, kid.
I didn't declare anything, you may have missed the question mark in the very title.
You want to say I don't know stuff: that's right.
You want to say I didn't search: that's right too. I wrote I didn't imagine somebody thought about this already. My fault.
But forums are here to spread info, also.
Now if you are annoyed of spreading info, just don't do it.
