{"id":16123,"date":"2023-01-05T19:56:54","date_gmt":"2023-01-05T19:56:54","guid":{"rendered":"https:\/\/nftandcrypto-news.com\/crypto\/quantum-computers-may-soon-breach-blockchain-cryptography-report\/"},"modified":"2023-01-05T19:56:57","modified_gmt":"2023-01-05T19:56:57","slug":"quantum-computers-may-soon-breach-blockchain-cryptography-report","status":"publish","type":"post","link":"https:\/\/nftandcrypto-news.com\/crypto\/quantum-computers-may-soon-breach-blockchain-cryptography-report\/","title":{"rendered":"Quantum computers may soon breach blockchain cryptography: Report"},"content":{"rendered":"
According to a recent paper, Chinese researchers claimed to have discovered a novel method to break the Rivest\u2013Shamir\u2013Adleman 2048 bit (RSA-2048) signing algorithm present in blockchains and other security protocols. RSA is a cryptographic technique that utilizes a public key to encrypt information and a private key to decrypt them.\u00a0<\/p>\n
Breaching the RSA-2048 algorithm requires, similar to other algorithms in the RSA numbers family, finding the prime factors of a number with 617 decimal digits and 2048 binary digits. Experts estimate that it would take ordinary computers 300 trillion years to break an RSA-2048 encryption key.\u00a0However, Chinese researchers said in their paper that the encryption could be inversed with a quantum computer with 372 qubits, or a basic unit of information acting as a proxy for computation power.<\/p>\n
In comparison, the latest IBM Osprey quantum computer has a processing capacity of 433 qubits. Previously, experts calculated that factoring RSA-2048 with quantum computers employing Shor’s algorithm (a quantum factoring method) would require 13,436 qubits.\u00a0<\/p>\n
Unlike classical computers that operate on a binary basis of 0 or 1, quantum computers utilize quantum bits that can take on infinite states at temperatures of -273\u00b0C (-459.4\u00b0F), achieved by using liquid gas coolants. Thus, the quantum computer is able to map out all possible solutions to a cryptographic problem and attempt them all at once, increasing efficiency on an astronomic scale.<\/p>\n