According to Google, it can achieve a quantum dominance with 53 qubits, i.e. 253 calculation simultaneously. However, this is not sufficient to break SHA2562 encryption through brute force with the millions of P2P computer combine forces. Although the Shor's algorithm provides extraction of the private key from any public key like Elliptic Curve Digital Signature Algorithm (ECDSA) (https://spectrum.ieee.org/tech-talk/computing/hardware/qubit-supremacy,2020), this is only the private key but not the public key exchange encryption like DFKE. In the worst-case scenario, even quantum computing managed to break and extract, the only issue is privacy. However, the technology is still can't unmute or change the encrypted transaction with SHA256 or SHA384. Hence, are we still able to argue the possibility for the Quantum Computer to brute force and break the encryption? If there is an argument, it would be good to share with critical reasoning.

More Yu 余 Zhixiong 志 雄's questions See All
Similar questions and discussions