most encryption will be broken

[Ego]

Good day,

@Joshua

oh forgot to ask so what method of cracking do Quantum Computers use? Brute force?or some type of new complex attack?

Explained that above, quote:

@Ego

For “cracking” AES, factorization is not really going to get us anywhere, so the algorithm most suitable as far as I’m concerned would be one capable of looking through a limited number of entries in a database which hasn’t been organized, as this would be the best “way” to imitate a brute-force attack without having to go into much detail. Something in the ball park of amplitude amplification should do the trick here. What this would allow us to do, is to do a search for the wanted entry in a square root of operations based on the number of possible enquiries. Or to put it more simply, if there are X possibilities, we’d need √X operations with the logarithm of X being the needed amount of memory. The advantage of such a system is obviously the much smaller number of necessary operations as for a normal computer the amount of operations would always equal X.

It just, like a “normal” brute force looks true a list of possibilities, however in just the square root of time you’d normally need.

@Joshua

If there using Brute force im assuming Quantum computers are faster than all the super computers in the world put together?

Like I’ve said, the square root of the time an equivalent “normal” machine would need.

@Joshua

also if their using the brute force method perhaps Brute Force Detection software can help such as this? Brute Force Detection – R-fx Networks let me know what you think

Such a thing only works if

a.) the system is noticing such an attack fast enough and

b.) the encryption isn’t done locally in a datacenter where this kind of information can simply be ignored.

Such software only helps if you own for example a server and want to keep a look on whether someone tries to access it, not for securing communication and encryption in general.

Have a nice day,

Ego