Re:Encrypted Client Hello – the last puzzle piece to privacy
by msm_ on Friday September 29, 2023 @11:16PM
(#37712527)
>Can someone chime in with how quantum computers effectively at least double the output of traditional "classical" computers?
In general: Quantum computers halve the search space, not speed, so for example quantum computer needs 2^128 operations to bruteforce 2^256 keys [1]
In case of non quantum resistant algorithms (for example RSA or most other popular algorithms today): there are algorithms that offer exponential speedup, where even a slow (in terms of number of operations/second) quantum computer will easily outperform a classical comoputer
[1]: Grover's algorithm. I'm oversimplifying a bit.
In general: Quantum computers halve the search space, not speed, so for example quantum computer needs 2^128 operations to bruteforce 2^256 keys [1]
In case of non quantum resistant algorithms (for example RSA or most other popular algorithms today): there are algorithms that offer exponential speedup, where even a slow (in terms of number of operations/second) quantum computer will easily outperform a classical comoputer
[1]: Grover's algorithm. I'm oversimplifying a bit.