SHA-256 and SHA3-256 Are Safe For the Foreseeable Future

The New Acunetix V12 Engine


Hashing, it’s always a contentious issue – used to be md5, then sha-1, then bcrypt and now it looks like SHA-256 or SHA3-256 might the future with quantum science boffins predicting it’s not feasable to crack.

SHA-256 and SHA3-256 Are Safe For the Foreseeable Future

You can read more about the algorithm and design (using sponge construction) on Wikipedia here: SHA-3

While it’s reasonable to assume that a world with real quantum computers will ruin traditional asymmetric encryption, perhaps surprisingly hash functions might survive.

That’s the conclusion of a group of boffins led by Matthew Amy of Canada’s University of Waterloo, in a paper at the International Association of Cryptologic Research.

The researchers – which included contributions from the Perimeter Institute for Theoretical Physics and the Canadian Institute for Advanced Research – looked at attacks on SHA-2 and SHA-3 using Grover’s algorithm (a quantum algorithm to search “black boxes” – Wikipedia).

They reckon both SHA-256 and SHA3-256 need around 2166 “logical qubit cycles” to crack.

Perhaps counter-intuitively, the paper says the problem isn’t in the quantum computers, but the classical processors needed to manage them.

The paper notes: “The main difficulty is that the coherence time of physical qubits is finite. Noise in the physical system will eventually corrupt the state of any long computation.”


The sad part is, a lot of people are still using crappy old badly implemented hash algorithms like md5 and thinking that’s ok.

On the other hand with the predominance of people using frameworks like Rails, Laravel, Django etc those problems are minimised.

“Preserving the state of a logical qubit is an active process that requires periodic evaluation of an error detection and correction routine.”

If the quantum correction is handled by ASICs running at a few million hashes per second (and if Vulture South’s spreadsheet is right), Grover’s algorithm would need about 1032 years to crack SHA-256 or SHA3-256.

That’s considerably longer than the mere 14 billion years the universe has existed, although less than the estimated 10100 years until the heat death of the universe. Even if you didn’t care about the circuit footprint and used a billion-hash-per-second Bitcoin-mining ASIC, the calculation still seems to be in the order of 1029 years.

That’s a lot of years, the limitation seems to be the physical processors used to manage quantum computing – which may be resolved at some point but would take some time (according to even an accelerated Moore’s law).

Source: The Register

Posted in: Countermeasures, Cryptography


Latest Posts:


Intercepter-NG - Android App For Hacking Intercepter-NG – Android App For Hacking
Intercepter-NG is a multi functional network toolkit including an Android app for hacking, the main purpose is to recover interesting data from the network stream and perform different kinds of MiTM attacks.
dcipher - Online Hash Cracking Using Rainbow & Lookup Tables dcipher – Online Hash Cracking Using Rainbow & Lookup Tables
dcipher is a JavaScript-based online hash cracking tool to decipher hashes using online rainbow & lookup table attack services.
HTTP Security Considerations - An Introduction To HTTP Basics HTTP Security Considerations – An Introduction To HTTP Basics
HTTP is ubiquitous now with pretty much everything being powered by an API, a web application or some kind of cloud-based HTTP driven infrastructure. With that HTTP Security becomes paramount and to secure HTTP you have to understand it.
Cangibrina - Admin Dashboard Finder Tool Cangibrina – Admin Dashboard Finder Tool
Cangibrina is a Python-based multi platform admin dashboard finder tool which aims to obtain the location of website dashboards by using brute-force, wordlists etc.
Enumall - Subdomain Discovery Using Recon-ng & AltDNS Enumall – Subdomain Discovery Using Recon-ng & AltDNS
Enumall is a Python-based tool that helps you do subdomain discovery using only one command by combining the abilities of Recon-ng and AltDNS.
RidRelay - SMB Relay Attack For Username Enumeration RidRelay – SMB Relay Attack For Username Enumeration
RidRelay is a Python-based tool to enumerate usernames on a domain where you have no credentials by using a SMB Relay Attack with low privileges.


Comments are closed.