You use bricks. They are unbreakable encryption system. I would go on explaining it, but... This video is about bricks. Bricks are...

Missed opportunity for a brilliant sponsorship. "For the next step, you're going to have to pause this video and go learn linear algebra. You can probably knock it out in a couple months by signing up for this video's sponsor..."

You explained this really well, like an Indian on a channel with 12 subscribers. Everyone who studied at a university will recognize that this is, in fact, a compliment.

I don’t think it’s correct to call AES the most advanced symmetric encryption algorithm. AES was revolutionary for its time, but much faster algorithms exist today (e.g: Salsa20/ChaCha20), which are also far easier to implement securely. AES is very fast today, but only because it’s actually implemented in hardware at this point (e.g: the AES-NI extensions for x86), rather than in software. If implemented in software, it wouldn’t really be competitive anymore in terms of speed. Also, AES’s design lends itself to really insecure implementations (e.g: S-Box lookups based on secret data) which lead to side channel leaks.

Wow never thought I would see this here. Vincent Rijmen, one of the 2 guys who designed this system (Daemen and Rijmen → Rijndael) is a professor who gave me algebra at university.

I’m a cryptographer. We don’t actually know whether AES is practically unbreakable or not - in fact nobody knows whether anything can be practically unbreakable at all, if you want to use a key more than once! The best we have is “a lot of smart people have tried very hard to break it, and they haven’t managed to”.

I feel bad for someone who actually paused this video and actually spent months learning about linear algebra and took some university classes and unpaused the video when they masted it only to find out that their knowledge is thrown out of the window

As someone with an academic background in cryptography, I have to say that this video is a good introduction to AES :)

How To Design A Completely Unbreakable Encryption System : Just scramble everything randomly. You didn't say you needed to be able to unencrypt it.

The only encryption that can't be cracked given infinite time is a one time pad. AES is "good enough" and serves a purpose of a private-key encryption system that can allow for a short, repeatable key for many encryptions.

That 256 bit password in clear text is totally something I would use and have used silliness in my passwords before. I used to use some form of "I hate this " as my work password. But funny enough, I had to let a coworker log in for me once after an injury. The laughing was fun.

Description of the algorithm is pretty accurate.... However, calling it the most advanced encryption is actually wrong. Rijndael competed against two other ciphers for the AES designation. Twofish and Serpent were the others, and known at the time to be more complex and probably more secure. However, one of the reasons Rijndael won was because it was likely easier to make performant on any hardware, and the security margin - while less than the others - was still sufficient that we could trust it.

"Sounds like a challenge." Pulls out TI-81 calculator.

I like when "Brute Force" hacking in media are just used as magic hacking words.

Answer: Watch this video. You're now fully qualified to "Design A Completely Unbreakable Encryption System"!

Mannnn i love the script u prepared.. There are oly so many videos out there that I have trouble following at normal speeds.. This one absolutely makes it.. Amazed to say the least

Funnily enough had a class about this exact same topic 2 days ago. This is very well explained

Not a bad explaination for this short of a time. I would just add that this is a symmetric encryption and there is also asymmetric encryption. And that Websites (and many other software) use a combination of both. One of the big problems with an encrypted connection is the key exchange, because both parties need the key, but that key should not be sent, because then everyone can read it. But this is a video for its own. :D

Just finished watching this on Nebula but for once I actually wanted to see the sponsor lol

AES encryption is usually very breakable because devs usually implement things awfully and/or use static values for some of the parameters required to encrypt.

It doesn't matter how good the encryption is if your agents keep leaving passwords on post it notes

The only "completely" unbreakable encryption system is one-time pad, everything else can be broken, given enough time and data, hence the video title is factually incorrect. AES is a cypher that is about impossible to break with the current computer power at a reasonable time, and for an encryption _system_, proper IV/key size/generation/rotation and non-leaky side channels are also important. And also that we won't find any flaws in the Feistel nets in the future and specificly the one that is used for AES.

AES is not "Completely Unbreakable", it can be IND-CCA2 secure in GCM mode. An actual (information) theoreticly unbreakable cipher is the one-time-pad.

I kept seeing this in a custom game server software, the package name really throws me off but not enough to make me search it up. So this helps a lot, thanks!

i have a linear algebra test in 2 days that im not studying for right now so that was kind of meta but i did understand what you were saying so maybe i'll do fine on it

As someone who used to work in the IT security industry this is a good introduction.

ChaCha (usually 20 rounds) is also popular now, because it is much less power/processing intensive, stronger, and harder to mess up implementing (there are many, many, many ways to screw up implementing AES).

Finally! I get to apply the linear algebra I learned in college outside a college environment!

hm, i just so happened to wonder how AES works and now i know a little more than i used to, great!

Lmao the FBI bricks easter egg on the thumbnail

This computer stuff is so complex to me and so alien. I can’t even comprehend how ones and zeroes make up everything. How the fuck do you know which sequence is what? Glad there are people out there who understand this.

Time to use this to win an encoding competition whenever I happen to participate in one

Great job explaining a ridiculously complex process! I have been a CISSP for over a decade and I still don't fully understand it 😅

I mean technically AES isn't unbreakable due to the possibility of implementation attacks in certain scenarios. For example if we had an embedded device that did AES encryption and we could capture the ciphertext and traces on Vcc we could perform a Differential Power Analysis or Correlational Power Analysis attack to determine the secret key.

AFAIK, it is neither proven nor disproven whether AES is breakable. Also, I think dozens of people are currently working on either proving it is unbreakable or (in my opinion somewhat more likely *) breaking it. But it is kind of proven that it is hard to break just by how old it is and how many things use it. Also, there is a difference in the initial and final round and the other ones. * because AES predecessor DES was also believed hard to break. I often heard in the community, that with the increase in cryptographic knowledge and computing time it will be broken at some point. Even if it is in 1000 years.

If ever there was a perfect spot for a Brilliant sponsorship!

I didn’t understand this at all whatsoever but I love hearing my half favorite youtuber talk

By 2:27 we're talking about the basis of encryption: XOR however after this point I think its way less important to understand the technical process and more the characteristics that make the algorithm secure. An XOR function reversible and only as predictable as it's key. A random key is impossible to crack. But the problem becomes how do you know this key and who should know about it. By only having the key known by one party the key is ALSO authentication as well as encipherment. The text is scrambled but we also know by who and that no one else is involved. It's these characteristics all together than make up a protocol thats actually secure.

4:44 There's a typo in "Top sesret message"

There is a mistake in the subtitles at 0:01 as the narrator clearly states that he has exactly 5 minutes to explain the contents of the video, the subtitles read 6 minutes. Given the video length and the fact the video ends at 4:52 for the sponsor segment to play I have to conclude that the subtitles are wrong. HaI please fix!

2:59 it's actually correct phrase in CS to say so randomly because random may vary on a the computer world

Nice Video! love it, really needed it.

Thank you for explaining something that I never understood, and confirmed that I never will.

This feels like a video the TA would play at the beginning of class because the professor is running late.

What’s an algebra 3:32? Where do I learn an algebra? Please answer. It would be brilliant

So glad there wasn't a VPN ad at the end boasting "Military Grade Encryption", since Military Grade Encryption is just a fancy name for AES, which almost every website provides by default because HTTPS

Rijndael entropy is so perfect it gets me rock hard

THE START 😂😂😂

i use enigma machine with cipher when i want to encrypt but only when i work late night shift at the museum

I took a cryptography class in college, and this was a good refresher of Rijndael. That said, it's probably not where I would start if I had to explain encryption methods to someone...

2:52 "I could spend an hour talking about why this box is such a good box..." This better be on Nebula.

Make a video about how much tea one would need to dump into the boston harbor until it tastes good

Next video: how to crack this encryption

This is a decent way to explain it. Just FYI, xor is should for exclusive or

I took Linear Algebra in undergrad and HATED IT!!! Thanks for the nightmare fuel 🙂.

dude im certainly thinking about that stock footage now

I guess the advantage over OTP is that the AES Key can be used multiple times right?

its worth noting that rijndael might not be completely unbreakable (proving it is hard is an incredibly hard open problem in mathematics), but for all practical purposes it is

You know, I never expected to see Boolean Logic and Linear Algebra in a HAI video.

This is a great video to explain to non-tech guys about AES (if you have technical know-how the excellent channel Computerphile did a more technical explanation of it)

For more details, XOR is addition in AES and subtraction in AES just happened to be the same as addition. For the linear algebra (matrix multiplication) parts, hopefully you successfully learn it from your community college math class, and be able to throw it out of the window. The addition is XOR there, and the multiplication is polynomials multiple another polynomials (the hexadecimal number is the representation of factors of a polynomial). In fact it will be way more interesting to explain how to decrypt AES (it is almost the same as encryption) and saying "how you can crack any VPN encryption".

All HAI had to do to get engagement on this encryption video is say that AES is completely unbreakable, et voila! Fair play to you sir.

3:35 "you can probably knock [linear algebra] out in a couple of months by taking night classes" *proceeds to show physics based lecture*

I just learned this in class and now I got this video lol

What I don't get - the first step with XOR is a one time pad. But to work, you need to have a key as long as the plain text you want to encrypt. Do you just concartenate tons of copies of the key, XOR and do the obfuscation (diffusion) to hide this feat? Normally the OTP can be guessed if you reuse the key over and over. But the diffusion parts can all be reversed and then you get stuck with the original part where you have X times the key and the main message.

its secure until someone puts it in ECB mode... Or puts it in CBC mode and then tells you if the input is properly padded or not...

Idk how I was suggested here as I was listening to the song “Gandi- Criminal “ 🔥🔥

Any cryptography lecture worth their salt in the last couple decade must've made some mention of this algorithm

Probably missing the point but the light bulb at 0:55 is connected very poorly and dangerously!

Ok and what does that have to do with bricks? As far as everyone is concerned this channel is fully dedicated to bricks

Imagine when u crack the encryption its was just a Rick roll this entire time

Stealing data from people stealing your data? What a good idea!

Here are some more information, please correct me if I'm wrong: I'd describe diffusion as follows: A change in a single cell of the table should cause all other cells to change. Imagine someone would give you a black box with the key inside. You can choose the input and look at the output. First you put in "ABCDEFGHIJKLMNOP" and second you put in "BBCDEFGHIJKLMNOP". It's a change in the first letter. Without the last step you would get (that's just an example) "OJEBEFGHIUGEGFZL" for the first and "AJEBEFGHIUGEGFZL" for the second word. You see, that the change just in one Byte. The Mix Columns (matrix multiplication) "smears" cells column-wise. Imagine this: You use the 4x4 grid and put a little bit of butter on the top left cell. Then you shift the rows (nothing happens as you don't shift the first row and the other rows are empty). Then you use a squeegie from top to bottom. Now there's butter in every cell of the first column. Afterwards you perform the shift rows operation: Now you have butter on 4 cells but each cell is in a different column. When we perform mix rows now, you have butter all over the 4x4 matrix. To put it like this: Shift Rows allows the vertical smearing of Mix Columns to propagate to every cell. To quote our professor: "If you use a modern encryption algorithm: It's just as good as your resistance to waterboarding."

You could also compress the data, using like 1 format, compress it again using another format, then encrypt the compressed data. This would make it impossible to decrypt

As someone with a math degree, the reason multiplying by that matrix is okay is because it is invertible (kind of like how the xor operation was invertible)

That 16 small box merged into one square with a handle of an Arc, either a pro- God Angel Arc or Ambitious Angel Arc. The heart sign in Valentines day have 2 Arcs.

Im sorry, computer scientist here, you are describing what AES encryption would do, however AES encryption is not secure enough to store sensitive data, as one key can decrypt and encrypt data, how the NSA and any encryption really on the internet is done is using RSA, more specifically the SSL protocol, This has two keys, a public key that can be used to encrypt messages and a private key that lets you decode messages, the public key can be shared securely for people to encrypt messages intended for you to read only, then using your private key you may decrypt that data, this method is the industry standard

Actually a rather decent explanation to be fair. Not flawless, but decent. The main strength of AES is that it doesn't put any arbitrary limitations onto our key choice. But this is true for practically all symmetric key encryption systems. There is also public key encryption that is rather useful for exchanging symmetric keys and public key encryption can also be used to signing data. But public key encryption more or less always boils down to "one way functions" that are hard to reverse. As a simple example, 43^6 is easy to compute, but the sixth root of 6321363049 is far harder to compute. But if someone finds an efficient method to do the "one way function" the other way, then the whole thing falls apart fairly quickly. But public key encryption use way harder one way functions that are fairly intensive to do in the correct way to start with, so one don't want to encrypt a whole message with it. And this is why public key encryption is mostly used for key exchange and for signing hash sums.

Also the mode of operation really matters. You really don't want to just encrypt each 4 character block using AES or the adversary can tell what blocks started out the same pretty trivially. You want to use something like CBC. en.wikipedia.org/wiki/Block_cipher_mode_of_operation

So then how do they transmit those over the internet? Send the key multiple different routes in pieces to minimize interception by one hacker?

Let me add a shameless plug here. I have an AES-128 encryption app for Android in the Play Store. I use it occasionally to share secrets with my close buddies that I don't want people who touch my phone to see. I could upgrade the app to use AES-256 without much trouble but I lost the original repo.

1:56 if its 2 ones carry a one and drop a 0 and if its three ones (if u carry a one and the next set of digits is 1,1) drop a one and carry a one to the next set of digits 1001, 9 1101, 5 = 1110, 14 Ex 2 1101, 13 1100, 12 = 11001, 25

If you guess the key, how do you even know when you got the right one? As i understand it, you could use any key and decrypt the message but most of the time you would get garbage out, but wouldn't there be keys that produce something that just looks like a decrypted message but is the wrong message? Or maybe the data you send even looks a bit random (compressed data), then you would have to heavily analyze each decrypted message to determine if it may be garbage and that you probably used the wrong key.

While you're on the encryption wikipedia page explain RSA or ECC to the people and why quantum computers break them or the chaining algorithms we use AES with

Okay, timer started xd

XOR isn’t so much a function as it’s a bitwise operation. Most computer engineers call it “X-OR” not “X-O-R”. Not only is it the basis for encryption, your computer wouldn’t be able to perform addition without this operation.

Partition for HAI cover the AES replacement that is quantum computer secured

BEST KZfaq INTRO OF THE YEAR AWARD. All those in agreement say aye.

Him: I have exactly 5 minutes to explain how..... Subtitles: I have exactly 6 minutes to explain how....

Great video.

Sub-key Zero..."Get over here!"

they call it matrix multiplication, do to division you basically have to multiply it by the inverse which is very difficult.

You were already perfectly safe from me 30 seconds into the video. XD

Impressive one.

As an unbreakable encryption, I can confirm this is how we do it

So, I have the bell highlighted, but didn't get the last five or so video notifications, I seriously thought Sam just took a long vacation cause of the many hotel related toks he uploaded

It's secure, so long as you don't figure out a way to simply test every possible key in parallel. That's < 10^80 possible keys simultaneously. Probably less than 2^400 simultaneous solutions. You should be able to do this with less than 10000 qubits working together, even in a worst case, in under a second.

You only need to get lucky once. It may take an infinite amount of tries or it might just take one.

and thats why the easiest way to break into things is to call the old guy in charge of everything as if you need the password for something that will make him money

the suggest a video link in the description is broken