# Cracked Codes and Broken Hearts: Analysis (Part 2 of 2)

**Why NIST Recommends 128-Bits of Minimum Security by 2030: Lessons from Bob and Alice**

The world of cryptography is filled with tales of triumph and tales of woe, where security mechanisms are constantly weighed against their vulnerabilities. Among the guiding lights in this maze of codes and ciphers is the National Institute of Standards and Technology (NIST).

But why? And how does this recommendation hold weight in the real world? Letâ€™s explore the importance of this bit strength and its practical implications, using a cautionary tale of Bob and Alice as a relatable anchor.

**The Technical Deep Dive: Why 128-Bits is a Standard for 2030 and Beyond**

As we venture into a deeper understanding of the NIST's 128-bit security guideline, it's essential to grasp the nuances of the computational world and how it's rapidly evolving. To appreciate the security of 128-bits, one must delve into computational complexities, the advent of quantum computing, and the brute-force implications.

**Understanding Computational Complexity**

In the context of cryptography, bit strength directly correlates to the number of possible combinations an attacker needs to guess to break the encryption. Every additional bit doubles the computational effort:

1 bit = 2 possibilities

2 bits = 4 possibilities

3 bits = 8 possibilities ...

128 bits = 2^128 or approximately 3.4Ã—10^38 possibilities

This exponential growth in possibilities means that brute-forcing a 128-bit key would require trying out more combinations than there are atoms on Earth!

**Enter Quantum Computing**

Quantum computers, when fully operational, won't merely be 'faster' versions of classical computers. They operate on an entirely different computational paradigm. Using the principles of quantum mechanics, quantum computers can process a vast amount of information at once. The most relevant quantum algorithm in this context is Shor's algorithm. It threatens certain cryptographic systems like RSA and ECC, as it can factor large numbers exponentially faster than the best-known algorithms on classical computers. However, symmetric cryptographic systems, such as AES, are only subjected to a quadratic speedup. This means that a 128-bit key would give security equivalent to a 64-bit key against a quantum attack. Still substantial, but reduced.

**The Realm of Brute-Force Feasibility**

Given our current technological landscape, a brute-force attack on a 128-bit key is infeasible.

Here's why:

To put things into perspective, even if we had a supercomputer that could try a billion (10^9) keys per second, it would take more than 10^25 years to try all the 2^128 possible keys. That's billions of years longer than the age of the universe!

Now, while quantum computers can speed this up, even with a quadratic speedup, the time required remains astronomic. When applied to AES-256, the effective security would be reduced to that of AES-128. In the quantum context, this means that a quantum computer would require roughly 2^128 operations to break AES-256. AES-256 was designed with forward security in mind. The cryptographic community anticipated future threats, including quantum computing. By doubling the key size from 128 bits in AES-128 to 256 bits in AES-256, it ensures that even when quantum computers become a practical reality, AES-256 will still offer a level of security that is beyond any feasible brute-force attack.

However, it's also important to note that by 2030, if quantum computers reach their full potential, lower-bit cryptographic systems might be vulnerable. Hence, aiming for 128-bits ensures a buffer. It considers the speedup and still maintains security that's way outside the realm of brute-force feasibility.

**Bob and Alice: A Cautionary Tale**

Now, let's look at this scientific guideline with the tale of Bob and Alice to drive home the point.

Bob, a cryptocurrency enthusiast, had a 12-word seed phrase, which is equivalent to a 128-bit key, for his crypto wallet. Feeling crafty, Bob split this seed phrase into three parts, storing them in different locations. Alice, his ex-girlfriend with a grudge and tech-savviness, managed to unearth 8 of these 12 words. This reduced the unknown to just 4 words, or a mere 44 bits of security (2^44 possible combinations). In terms of our fortress analogy, it's like handing over the master keys to most of the doors.

Given the computational prowess of modern GPUs, Alice was able to brute-force the remaining words in a matter of days. The original fortress-like security of 2^128 had been reduced to a small cottage's security of 2^44, all because Bob misunderstood the risks of dividing his key. This does not even account for the future threats of quantum computing.

**Relating the NIST Guidelines to Real Life**

The story illustrates the potential dangers of not heeding expert advice on cryptographic security. While Bob believed that splitting his seed phrase enhanced his security, he inadvertently weakened it. This is akin to having a 128-bit security standard but only implementing or leveraging a fraction of it, making it exponentially more susceptible to breaches.

NIST's recommendation to maintain a minimum of 128-bits of security by 2030 isn't just a theoretical guidelineâ€”it's a reflection of the real-world threats we face. Each reduction in bit strength, as shown in Bob's case, exponentially increases vulnerability.

The world of cryptography is ever-evolving, with threats escalating in complexity and potency. As we journey towards 2030 and beyond, the NIST's guidance of 128-bits as a minimum security threshold serves as a vital reminder of the need for vigilance, foresight, and a solid understanding of the principles of cryptographic security. Bob and Alice's tale, while fictional, mirrors potential real-world consequences of not adequately safeguarding digital assets. In the battle of bits, it's always better to be safe than sorry.

## Comments