How secure is 256 bit security?

Channel:3Blue1Brown · Length:5:06 · Published:2017-07-08 · Views:3660569

Watch on YouTube

Summary

3Blue1Brown illustrates how enormous the 256-bit search space is, showing how infeasible it is to find a hash or key by guessing and checking.

Why HN recommends it

HN uses it as the go-to illustration of just how large 2^256 is.

To comprehend how large a search space this is watch 3Blue1Brown's explanation — HN, 2020

Cryptography · Recreational & visual math

Subtitles (excerpt)

In the main video on cryptocurrencies, I made two references to situations where in order to break a given piece of security, you would have to guess a specific string of 256 bits. One of these was in the context of digital signatures, and the other in the context of a cryptographic hash function. For example, if you want to find a message whose SHA-256 hash is some specific string of 256 bits, you have no better method than to just guess and check random messages. This would require, on average, 2 to the 256 guesses. This is a number so far removed from anything we ever deal with that it can be hard to appreciate its size, but let's give it a try. Two to the 256 is the same as 2 to the 32 multiplied by itself 8 times. What's nice about that split is that 2 to the 32 is 4 billion, which is at least a number we can think about. All we need to do is appreciate what multiplying 4 billion times itself 8 successive times really feels like. As many of you know, the GPU on your computer can let you run a bunch of computations in parallel incredibly quickly. If you were to specially program a GPU to run a cryptographic hash function over and over, a really good one might be able to do a little less than a billion hashes per

On Hacker News

I wondered the same thing, so I went looking for answers and found this excellent video by 3Blue1Brown: How secure is 256 bit security? : [VIDEO] — yamrzou, 2021-06
Large number comparisons are difficult for humans to comprehend. If you simplify life to a DNA strand 256 nucleotide long (for the sake of math comparison) - then the search space is 4^256. To comprehend how large a search space this is watch 3Blue1Brown's explanation [VIDEO] — AareyBaba, 2020-10
We know that life is evolvable because life exists and we know the biochemical mechanisms involved (DNA + cellular biochemistry). Evolution implies a relatively smooth path through "DNA space" from, say for example, an early single cell eukaryote to a mushroom. However the search space is enormous. Even if we account for billions of years of evolution and a trillions of evolutionary experiments e… — AareyBaba, 2020-01
What was the RSA crack effort you mention? It doesn't seem feasible, considering finding a SHA-256 collision would take so much compute power we don't have words to describe it, and even coming up with thoughts to frame the problem is hard ( [VIDEO] ). I can't imagine cracking even an RSA2048 key with everyone working on it. — ChancyChance, 2023-03
Even if you had your GPU-packed Kilo-Google per person multiplanetary Gigagalactic computer guessing numbers for 37 times the age of the universe, it would still have a 1 in 32 billion chance of cracking. [VIDEO] — AareyBaba, 2022-09

Related videos