HackerTube
HomeLongsLikedHistoryWatch laterCategoriesPlaylistsSettings

How secure is 256 bit security?

3Blue1Brown2 HN recommenders · recommended in 3 months, 2020-2023
YouTube
3.7M views · 9 years ago · explainer · evergreen

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.

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

CryptographyRecreational & visual math#sha-256#cryptography#hashing#bignumbers#security

5 comments from Hacker News

@ChancyChance2023 · in “SETI@home Is in Hibernation”

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 ( ▶ this video ). I can't imagine cracking even an RSA2048 key with everyone working on it.

CitesView on HN
@AareyBaba2022 · in “US Government Bans Export of Nvidia A100 and H100 GPUs to China and Russia”

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. ▶ this video

CitesView on HN
@yamrzou2021 · in “DOJ seizes $2.3M in cryptocurrency paid to the ransomware extortionists Darkside”

I wondered the same thing, so I went looking for answers and found this excellent video by 3Blue1Brown: How secure is 256 bit security? : ▶ this video

Strongly recommendsView on HN
@AareyBaba2020 · in “Room-Temperature Superconductivity Achieved for the First Time”

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 ▶ this video

RecommendsView on HN
@AareyBaba2020 · in “The most important scientific problems have yet to be solved (1897)”

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 each year, a simple random walk with selection through DNA space should go nowhere because of the numbers involved. The curse of dimensionality[0] means there has to be some other principle of nature to make the search space yield a path from one viable life form to another. The search space of life would have to be 'smooth' in some sense. That 'smoothness' is something we don't understand. If DNA space is just 256 bits (as a dramatic simplification), then 2^256 is a very very big space to search just by chance [1]. Now imagine a space orders of magnitude bigger. [0] link [1] ▶ this video (3Blue1Browns wonderful illustration of how large 2^256 is)

RecommendsView on HN
How Does SHA-256 Work?22:59

How Does SHA-256 Work?

learnmeabitcoin
374K views • 6 years ago
Flaw in the Enigma Code - Numberphile10:58

Flaw in the Enigma Code - Numberphile

Numberphile
5.4M views • 13 years ago
Theory and Practice of Cryptography1:32:08

Theory and Practice of Cryptography

Google TechTalks
73K views • 18 years ago
Elliptic Curve Back Door - Computerphile12:24

Elliptic Curve Back Door - Computerphile

Computerphile
554K views • 8 years ago
Cracking Enigma in 2021 - Computerphile21:20

Cracking Enigma in 2021 - Computerphile

Computerphile
2.9M views • 5 years ago
But how does bitcoin actually work?25:16

But how does bitcoin actually work?

3Blue1Brown
18.1M views • 9 years ago
35C3 -  The year in post-quantum crypto1:10:01

35C3 - The year in post-quantum crypto

media.ccc.de
8K views • 7 years ago
Computer Security 161 Cryptocurrency Lecture1:06:36

Computer Security 161 Cryptocurrency Lecture

Nicholas C Weaver
128K views • 4 years ago
Diffie-Hellman Key Exchange5:24

Diffie-Hellman Key Exchange

Art of the Problem
547K views • 14 years ago
Chip & PIN Fraud Explained - Computerphile8:45

Chip & PIN Fraud Explained - Computerphile

Computerphile
851K views • 11 years ago
Lecture 7: Introduction to Galois Fields for the AES by Christof Paar1:30:50

Lecture 7: Introduction to Galois Fields for the AES by Christof Paar

Introduction to Cryptography by Christof Paar
278K views • 12 years ago
Peter Rizun, Andrew Stone -- 1 GB Block Tests -- Scaling Bitcoin Stanford.27:08

Peter Rizun, Andrew Stone -- 1 GB Block Tests -- Scaling Bitcoin Stanford.

OnChain Scaling
12K views • 8 years ago
Quantum Computing and Bitcoin (Vitalik Buterin, November 2013)1:04:46

Quantum Computing and Bitcoin (Vitalik Buterin, November 2013)

Bitcoin Israel
16K views • 13 years ago
Hamming, "n-Dimensional Space" (April 14, 1995)50:27

Hamming, "n-Dimensional Space" (April 14, 1995)

securitylectures
14K views • 14 years ago
Bitcoin Q&A: How Do I Secure My Bitcoin?9:48

Bitcoin Q&A: How Do I Secure My Bitcoin?

aantonop
117K views • 9 years ago
28c3: The Science of Insecurity59:23

28c3: The Science of Insecurity

28c3
42K views • 14 years ago
The Lava Lamps That Help Keep The Internet Secure3:59

The Lava Lamps That Help Keep The Internet Secure

Tom Scott
4.3M views • 9 years ago
ZFS Native Encryption by Tom Caputi49:43

ZFS Native Encryption by Tom Caputi

OpenZFS
14K views • 10 years ago
The Encryption Tightrope: Balancing Americans’ Security and Privacy: EventID=1045735:31:07

The Encryption Tightrope: Balancing Americans’ Security and Privacy: EventID=104573

House Committee on the Judiciary
174K views • 10 years ago
Advanced Topics in Programming Languages: A Lock-Free Hash Table58:36

Advanced Topics in Programming Languages: A Lock-Free Hash Table

GoogleTalksArchive
29K views • 14 years ago