# From IBM to Bitcoin: why hash functions are immune to the quantum apocalypse

> Discover why hash functions are the only mathematical algorithm capable of withstanding the quantum apocalypse
> By José Maldonado · Technology · 2026-05-23

In early 2026, technology giants such as Google announced specific plans to complete their migration to post-quantum cryptography by 2029.

A decision that responds to the constant evolution of quantum computers and to the optimization of algorithms that could theoretically compromise the foundations of traditional asymmetric cryptography. And while public-key schemes face a process of global restructuring, symmetric cryptographic tools, specifically hash functions, show high resilience against these new threats.

These mathematical mechanisms constitute the invisible core that protects users' passwords, validates the integrity of files and sustains the architecture of cryptoassets around the world.

**[AI threatens cybersecurity: Chaos in Linux and software repositories](https://observatorioblockchain.com/en/cybersecurity/la-ia-amenaza-la-ciberseguridad-caos-en-linux-y-repositorios/)**

## Hash functions, the guardian of digital life

Explained simply for non-technical readers, a hash function is a mathematical algorithm that transforms any block of input data into an alphanumeric string of fixed length.

This process works similarly to a highly precise digital blender. Regardless of whether the input is a single word, a text document or a massive database, the final result will always have the same size and format. The output of this process is commonly called a hash code, digest or digital fingerprint, serving as a unique identifier for the processed data.

## Origin of the technology

The original concept of hashing was developed in 1953 by [**Hans Peter Luhn,**](https://es.wikipedia.org/wiki/Hans_Peter_Luhn) a prominent engineer at the IBM corporation. Luhn proposed a system to organize information into physical and logical "buckets", calculating an addressable index from an alphanumeric key.

At the time, the main goal of hashing was not security, but speeding up the search for technical information and classifying chemical compounds in the first punched-card computers. The efficiency demonstrated by this technique drove the development of the first commercial machines capable of indexing large volumes of text automatically.

But with the evolution of computing, physical storage methods were transformed into complex digital algorithms. What began as a mechanical solution for organizing data cards led to the structures known as hash tables, indispensable for retrieving information in milliseconds.

This historical process reflects how the needs for classification and control of data at scale laid the foundations for modern authentication protocols. Today, indexing through hashes makes it possible to manage critical infrastructures and global software repositories at unprecedented speed.

**[Meet Wasm: the technology that will speed up Blockchain 100 times](https://observatorioblockchain.com/en/blockchain/conoce-wasm-la-tecnologia-que-acelerara-blockchain-100-veces/)**

## Fundamental properties

For a hash function to be useful in cybersecurity and in the management of digital assets, it must strictly comply with a series of mathematical principles that guarantee its inviolability.

These properties ensure that the result is completely reliable and resistant to any attempt at manipulation by third parties.

*   **Determinism**: The function must always produce exactly the same alphanumeric result when the same input data is entered. This property is critical for different computers on a distributed network to verify the validity of the information independently.
*   **One-wayness**: It is computationally impossible to reverse the process to obtain the original data from an output hash. This is an essential property for maintaining confidentiality, since knowledge of the hash does not reveal the initial message.Avalanche
*   **Effect**: A minimal change in the input, such as the modification of a single letter or a single bit, must completely alter the resulting hash. This prevents an attacker from trying to guess patterns or deduce the structure of the input by analyzing variations in the output.
*   **Collision resistance**: Two different data inputs must never generate the same output hash code. If a collision were found, an attacker could replace a legitimate file with a malicious one without the verification systems detecting the alteration.
*   **Second preimage resistance**: Given a specific input message, it must be computationally infeasible to find a second, different message that produces exactly the same hash as the first.

## A simple example

But let's look at this with a slightly more practical example. Let's imagine a word: **Seguridad**. We are going to apply to this word the SHA-256 hash known worldwide for being the heart of Bitcoin.

Well, its hash (generated in OpenBSD with the sha256 command) is:

> ## 2da7b04b5555a765f7a800e8a19227773e6ba1837abc9a4c1f524ff1e656737e

Here we see how this algorithm transforms a simple word into something cryptic. But not only that, we cannot go back from the hash to the word easily; the only ways to find that hash are: knowing the word and running the hashing process, or brute-forcing that hash function, something that can take years or even thousands of years depending on the complexity and the rounds (how many times a word and its resulting hash are hashed over and over again).

And the latter is interesting because if we do rounds, "Seguridad" becomes:

> ## 9c5f3327bd63500ebf126853b77fa353720f4fbaa9d028c2240ed36b530b179a (Second round)

Or it becomes:

> ## b247324feafe47dab80c29d0ac69cea8a1a44644bd68890c4fa2fde93f81860d (Sixteenth round)

Which tells us that the more rounds, the more secure it is, but also the harder to find and the more computationally expensive. How expensive? Well, let's take Bitcoin into account, where billions of rounds are performed until finding the hash the network expects and solving the puzzle it issues.

**[$200 million in ETH forgotten in The DAO will go to Ethereum security](https://observatorioblockchain.com/en/ethereum/200-millones-en-eth-de-the-dao-iran-a-seguridad-de-ethereum/)**

## Practical applications of this technology

Now then, what exactly is this useful for? In the everyday practice of the technology sector, hash functions solve the problem of credential authentication securely.

For example, web platforms do not store (or should not store; those who store passwords in plain text should be shut down) users' passwords in readable databases, since a leak would expose all accounts. Instead, the server calculates and stores the hash of the password. When logging in, the system applies the hash function to the entered password and compares it with the stored value; if they match, access is granted without the original key having been revealed at any point in the process.

## Neutralizing digital threats

To neutralize cyberattacks based on precomputed hash dictionaries, system administrators use a technique called salting.

This process consists of adding random, unique data to the user's password before applying the hash function. The resulting salt is stored alongside the hash, which exponentially increases the complexity of brute-force attacks and makes it enormously difficult for attackers to crack compromised keys.

## Data verification

Additionally, hashing is indispensable for verifying data integrity during downloads and file transfers over the network. Software tools such as Git apply hashes to track changes in programming code and ensure that the history is not altered accidentally or maliciously.

In the digital security sector, antivirus programs constantly compare the hashes of an operating system's executable files with databases of known malware in repositories such as VirusTotal, immediately blocking any match to prevent infections on devices.

Another example can be seen, for instance, in the latest elections in Venezuela, where the hashes of the ballots in the opposition's hands (hashes with salts and configured by the government itself) served to expose the government's manipulation of the elections, by making it possible to verify them one by one as correct (a task that was possible thanks to the free software community).

**[Google's quantum breakthrough reignites the debate over Bitcoin's security](https://observatorioblockchain.com/ciberseguridad/el-avance-cuantico-de-google-reaviva-el-debate-sobre-seguridad-de-bitcoin/)**

## Integration of hashing in cryptocurrencies

However, perhaps it has been the arrival of blockchain technology that redefined the usefulness of hashes, transforming them into the gear that makes it possible to sustain decentralized financial networks. The operation of the most widespread cryptoassets is based on the SHA-256 algorithm to carry out their mining and structure their consensus. In systems based on Proof of Work (PoW), the network's nodes, known as miners, compete to group transactions into valid blocks.

For a block to be accepted by the network, miners must guess a variable number called a nonce. When this number is combined with the transaction data and processed through SHA-256, it must result in a hash that meets the difficulty level required by the network, which usually translates into starting with a specific number of zeros. Due to the unpredictable nature of hashing, the only way to find this value is through trial and error at extremely high processing speeds, with the final hash serving as mathematical evidence that honest computational effort has been made.

## Protecting immutability

The immutability of a cryptoasset's distributed database is achieved by linking blocks in a hereditary way. Each new block contains in its header the hash of the previous block, creating an uninterrupted chain.

If a malicious actor tried to modify a transaction recorded in the past, the hash of that block would change radically due to the avalanche effect. This mismatch would break the chain, since the following block would no longer point to the correct hash, causing all the network's validating nodes to detect the anomaly and reject the alteration immediately.

## Resistance to the future: the key to fighting quantum computing

Now then, perhaps the most interesting thing about hash functions looking to the future is their incredible resistance to quantum computing. When Google or IBM tell us that the quantum apocalypse is coming, hashes laugh in their face.

And it is that quantum computing is a danger for algorithms such as RSA or ECDSA, but against a SHA-256 hash, a quantum computer can do very little or nothing. Hash functions are resistant to quantum computing, and that is a property so well known and well estimated that Satoshi Nakamoto himself implemented SHA-256 hashing over Bitcoin's public keys (created using ECDSA, and fundamentally vulnerable to quantum computing), in order to shield them against this type of quantum attack.

But, despite this current solidity, bodies such as the United States' NIST are already working on post-quantum hashes, which would give us better resistance capabilities. Work that is advancing little by little, but that will bring us a whole new generation of post-quantum hash functions to protect our digital lives.

**[Bitcoin's security hangs by a thread, according to Justin Drake, Ethereum dev](https://observatorioblockchain.com/bitcoin/justin-drake-seguridad-bitcoin-pende-de-un-hilo/)**

## The backbone of digital resilience

Thus, the evolution of hash functions shows how a concept originally devised to improve physical data storage has become the fundamental pillar that sustains the integrity of software and modern financial schemes. The deterministic simplicity of these algorithms, together with their unbreakable mathematical solidity, allows them to act as a bridge of trust in environments where there are no centralized intermediaries.

Faced with the transition to post-quantum cryptographic standards, hash functions reaffirm their validity as one of the most stable and reliable technologies in modern computing. Their ability to adapt both to low-power devices and to distributed cryptoasset networks ensures that they will remain the indispensable tool for safeguarding the flow of global data in the coming decades.
