AES Explained (Advanced Encryption Standard) - Computerphile
Вставка
- Опубліковано 21 лис 2019
- Advanced Encryption Standard - Dr Mike Pound explains this ubiquitous encryption technique.
n.b in the matrix multiplication animation, the matrices are in the incorrect order, but hopefully the animation still helps to illustrate the general idea.
One Encryption Standard to Rule Them All! : • One Encryption Standar...
Almost All Web Encryption Works Like This (SP Networks) : • Almost All Web Encrypt...
Xor & The Half Adder : • XOR & the Half Adder -...
Reed Solomon Encoding : • Reed Solomon Encoding ...
EXTRA BITS: • EXTRA BITS: AES Explai...
/ computerphile
/ computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at www.bradyharan.com
Before I watched this video I had no idea how AES worked. Now I've watched it and still have no idea how it works.
Same goes for me
AES works by mixing stuff up a lot.
@@cafeinst😂ikr, it's hard for u to figure if aes mixes it up or u just too cool to think clearly
😂
But that’s not because its not well explained, it’s just a topic that is difficult to understand
There is an issue with the animation at 11:02. Matrix multiplication is not commutative, the matrix has to be multiplied from the left ( the shown multiplication is not even doable)
Just came to write this
If you interpret the vector as a 1 dimensional tensor instead of a 4x1 matrix, the tensor contraction is at least defined for when the matrix is on either side, but still it's not commutative - you'd get a different vector than you're supposed to.
yes, A*B!=B*A
I was writing the same comment and then saw yours. Yeah!!! this mistake is confusing.....
Yep, this matrix multiplication is not possible as written in the animation (4,1)*(4,4) is not correct + it was the right way around on the paper:
(4,4)*(4,1) gives a (4,1) vector. Hopefully this will be fixed and re-uploaded.
I love his explanations but these videos give me the feeling that camera-man just randomly bursts in to Mikes office and asks him random questions.
which is prob what happened
in the first seconds of the video I thought it was a scene from The Office lol
@@firezdog Lol totally what happened with the preprinted diagrams and all.
LOL
how's that a bad thing?
I knew what AES is for over 8 years but today I learned how it works
That's exactly the same for me :) :P
same.. lol. I felt like a bot using it for so long without knowing how it really works...
Same to you 😂
Computerphile and Numberphile are a blessing. I remember my math classes in college and we were taught different things about math but we were never told what they were used for. Now after seeing these videos I literally feel like I'd actually even enjoy learning maths. It makes sense because now I know why something is useful and when it may come in handy...
i dint know Numberphile , l did need some motivation to study math... thanks
It's because this is also Nottingham University
Just a correction: the vector operand at 10:59 should be on the other side of the matrix. Matrix multiplication is undefined in the way you have it written because the sizes of the vector and the matrix don’t match.
"Captain, this vessel seems to be emitting a Galois Field. It has rendered our sensors completely inoperative."
"...our tensors..." surely? 🙈
Thank you for making these videos. I have been watching them for years, finding the algorithms fascinating and the explanations very easy. As a second year cs student I must say that watching this channel realy helps me now more than ever. Keep up the awesome work!
Hey computerphile, thanks to all of the team for sharing the enthusiasm of Computer Science with me and other students, it's easy to find the lectures boring so I come here often to get more insights and intuitions. Being here enables me to learn things casually.
itd be insane if he actually encrypted a message going to all of those steps
not much was talked about the generation and usage of the key
They have done other videos on key generation, presumably it just uses any of the other standards for that.
All these keys and I can never find my own 🤔
There are vastly differing ways in which the keys are generated, but the purpose of the video is the algorithm utilizing a given 128bit key. I’m no expert upon the AES so I cannot explain exactly how the key is utilized, but I’m guessing that is what dictates the matrix chosen, the number of row swaps, things like that
@@SirFancyPants21 the key only matters for the XOR functions, where you add the round key
I think the key seeds the generation of a series of round keys using a method he says he explained in another video, and the round key is just "added" to the block after each round. (And "add" in this field means XOR)
I just want to say this is a great description of Galois fields in practical use. I learned it from textbooks way back when, and it was mind boggling.
Absolutely love the way Mr. Pound teaches. Can listen for hours together. Waiting for many more such interesting videos.
Dr Pound.
I literally just learned this yesterday in my cryptography class. Great refresher Dr. Pound!
Dude! you're just a legend and so clear in your explanations! What I couldn't stop noticing is the scene you're filmed in. You sitting next to a white board is absolutely identical to watching The Office!
Yes, been excited for more AES since the last video! Always love when you discuss cryptography on this channel.
I just talked a few hours ago with a colleague about how we could use this encription on an arduino to secure the data sent to a raspberry for a project (never used it before). And now you upload this... I need to use a mic detector in my classroom. Thanks for the explanation!
Very well explained. Thank you so much for taking the time to record and post this!
You're an excellent teacher, you took something very complicated and made it easy even for someone like myself who only has A level education in maths.
Dr. Mike makes all the logics so charming and interesting. What a pleasure to listen to the logics through him!!
1:46 Drawing a 4 by 4 grid 101:
1. Draw a square (roughly)
2. Draw a vertical line through the middle.
3. Draw 2 more vertical lines through the middle of each half.
4. Draw a horizontal line through the middle.
5. Draw 2 more horizontal lines through the middle of each half.
6. Look at your grid and ask yourself how you screwed it up this bad.
This man is one of the most interesting people I have ever had the pleasure of listening to. Kudos!
The interview part looks like The Office lol
This is a blessing, couldnt be explained more clearly. Could we see an ElGamal cipher video please.
Love you guys.
a lecture of 1.5 hours didn't understand it , just watched this video understood it in 14 min , TY you saved my semester .
0:36
Encryption
2:34
XOR
2:55
Process.
3:20
Rounds of encryption.
7:40
Byte replacement.
8:33
Row shifting.
13:00
AES errors and CPU.
1.5M subscribers! Great job guys :D
Damn I can listen to him for hours, I know what is AES I have used it many times for development but I have never looked into how it actually works. Hands down the best video.
Great job on explaining it guys! Thank you for making these for free!
As mathematicians will have noticed, during the mix columns animation the vector goes on the right, it's correct on the paper.
Fabulous animations though as always Sean ;)
Was hoping this would come out
FYI the CNSA has recommended organizations stop using AES-128 as of January 2016 in their Algorithm Suite and Quantum Computing FAQ. If possible you should implement AES-256 to better secure from Grover’s algo
This is the only channel on UA-cam which I have the notifications turned on.
Love computerphile 😍
OMG we just ended the semester and AES was covered in one of my modules! Wish i had this video a while back...Thanks for the upload though :)
I implemented AES and RSA in C++. AES is about 800 lines. RSA is about 300 lines. The thing that makes AES fast is that its bitshifts and bitwise xors. The 2 things that make RSA slow is mod exponentiation and prime number testing. Prime number test is an O(1) problem as you only do it once. So if you have a key pair, don't throw it out of you can avoid it. The mod exponentiation has to be done repeatedly and on large numbers that aren't native to machine code, numbers that are can get up to 4kbits longs.
Best explanation I've found so far. Thank you.
Keep doing these types of videos, I love them!
I've been waiting for this one!!
You can tell this stuff makes him very happy. I have no clue how this works after watching this, but I'm happy for him. 🤷🏾♀️
Just last week I gave a presentation on how AES works and now this video is coming out. Anyway, I liked the video and can confirm that what he was talking about is correct :)
Dr. Mike rocking! Best Man for teaching things with Humor!
I just want to know everything he knows ._.
Great video. I'm shocked that they still have music rule paper! Gives me nightmares of the IBM band printers I used to have to deal with on a S/38 :)
this is amazing i always wanted to learn the mechanics about AES
Absolutely great way to share, great job!
Amazing. Very well explained. thank you for expanding my knowledge!
Idk y but this guy is fun to watch. Like ik some of these concepts and he just makes me understand them more
Woow
I was thinking of this TODAY and this vid comes out !
Plus its Mike Pound
The most secure feature when it comes to the AES standard is its matrix being column-major.
Hell yes! Two in a row!
this guy is a genius at so many different topics !
10:00 I judge the paper as more than worth it. I really appreciate your videos. Often they provide me with the inspiration for my work even when it has no direct bearing on the task at hand. I was reminded of this when you referenced Turing, because I remember watching the one on Turing operations and it making it easier for me to develop a pickle-based data storage for my app that was significantly faster [in terms of read and write times] than an SQLAlchemy-based solution. I've used the same DB in my last 3 Android apps and every time I initialize that git submodule, I say a little thank-you to Alan Turing and Computerphile for giving me the courage to try something more ambitious than a command-line tool or Django-site. Baie dankie, from Southern Africa.
Wow, this is beautifully explained!
Just before my security exam, thanks!!
i spent around 5 minutes furiously scrolling through computerphile videos trying to find "how aes works" because it was in the end of the previous video, and i couldnt find it so was a bit puzzled. I found other encryption content, but not this video. Turns out this one is uploaded AFTER the last video recommending it 👍😁
If a video is 'coming soon' I'll generally put 'coming soon' next to its title in the video description (which nobody ever reads) (in the interests of clarity, I try then to update the video description (which nobody ever reads) once the forthcoming video goes live)- HTH :) Sean
@@Computerphile And the videos you produce are a breath of fresh air, and i hope to see more content from Dr Mike Pound. Really you should make videos with him atleast each month, i dont care what the topic is, its sheer joy watching content featuring him.
Hello. Can you explain the difference between AES and Twofish? I believe that Twofish was the runner up in the competition to select the standard encryption algorithm back in 1999 (I think)
For the numbers in the matrix step were u using the jumbling of only the shifting of the row operations and not columns? Also why use 1 twice instead of incorporating the rows on the grid as 1-4? Or was it just hypothetical numerical values?
How cipher key is being copied between transmitter and receiver? Or its preuploaded to hardware initially so only devices with the same key can communicate?
Very interesting video! Thanks for the insights.
Biggest fan guys! Keep up the great work!!
Is the S box and other substitution in this algo pre determined like what is inside s-box or it changes with user
Thank you for this amazing video about AES...congrats
I do not understand the column mixing portion of it. If it over flows during addition and subtraction, it would make it nearly impossible to reverse correct?
Thanks prof. Can you explain about the Authentication tag using in AES GCM? What is the different between GCM tag and authentication tag? Thank you
what about between 2 points that are able to multi ssid and vlan so it can receive decrytp vlan to the other ssid and transmit encrypted to your router or can continue to change ssid and mac, is the preshared key (password what is used to as the hash and then that hash the cipher? so long password is a long hash or how does it work?
Could you please add another video about the Key Schedule process ? Because for every round we need to use a different subKey that is created during the Key Schedule process. This is important for a full picture of the algorithm.
these videos are amazing and very helpful but please do consider to put subtitles as there are a lot of people who do watch them and are from other couintries. English subtitles would be amazing!!!thanks
A separate video on the MDS matrix, with full example, would be nice. Haven't seen a clear example yet.
Don't the shift rows and mix columns operations combine into mixing the diagonals?
Great, you've adapted to my curriculum :) perfect.
Why is a round definined to have the key xor at the end instead of the start is it just convention to have a non round xor at the start of the process instead of as the final stage? Or does this actually make a difference in the security?
Brilliant explanation. A very helpful video for beginners who wish to learn the AES algorithm.
wow, funky, nice to learn how ASE works, and also love Dr Mike's presentation style.
G
All digits in the range of 2 PI.? What asymmetric mechanism can you come up with without turning?
Awesome explanation! Thank you!
You are great sir the way of explanation is very nice thanks sir ☺️ for AES explanation
Hello,
Just to say that the content guys put forth is so much helpful in many ways.. masters really!!
Only thing is sometimes its difficult to understand what they say ... not quite familiar with the accent ...
please kindly make captions/subtitles available... it will help us to understand better ... Thanks in advance
Can you explain the iv? (Initialisation vector) and why having a unique iv helps?
I wish you released this in April before my exams
So AES is just Vernam cipher with substitution without key and some permutations (also without key)?
this video is a lot better than the last video I watched
8:29 The AES designers could also have done rotations within the 4x4 grid (e.g., b0 shifts to b1, b4 to b0, b3 to b7, etc.), which is just a 4x4 cell permutation, but they didn't.
Is it possible for an input to map to itself as cipher text? Is it possible to prove one way to the other?
8:01 - No byte can become itself? Wasn't that the CRUX of how the enigma machine was defeated?
The Enigma machine didn't do permutation.
That's fine for an S-box where you expect non-linear elationship of bits. In fact you don't want some bytes to be mapped to themselves as that introduced a fixed point into the cipher construction.
@@SillyMakesVids
True, but it did substitution... which was what I was referring too. Not saying this is a vulnerability of AES, but just curious why they didn't let same substitutions as the input
That's only for a part of AES's internal operation. With Enigma, a byte of the input couldn't give an identical byte as the output - which means you immediately know something about the plaintext for any ciphertext. That's not true for AES.
With enigma there was a one to one output. For each encryption one letter of the message got mapped to a specific letter of the output.
That's how in combination with knowing a letter can't be itself they tore it apart
Great explanation.
Thank you for sharing this.
great explanation
Great job!
very well explained but can you explain me how AES is combine with CBC or others Block ciphers mode because I am very confuse about it
My professor Joan Daemen co-invented this cipher, really cool to be taught by one of the best!
Nice explanation, can you also confirm how the symmetric key(the original key and not the round key) is generated and shared between the 2 parties
I was wondering a few days ago about how BitLocker and the like are so quick to decrypt. It makes sense now knowing the security chip is capable of being so quick.
This is shockingly close to a cypher I designed knowing nothing, except instead of an intelligently designed S-box I generated unique lookup tables for each round using Fisher-Yates on a secure PRNG seeded with the key. (And that was the only way the key was used, there was no key XOR step).
Being that you study these encryption standards, do you think it's possible they were created with a hidden way to decipher them without knowing the private key?
Will you please make the video on PRESENT block cipher... I'm feeling very difficult to understand the present block cipher...
AMD and INTEL have the AESNI instructions which are AESKEYGENASSIST,AESENC,AESENCLAST,AESDEC,AESDECLAST,AESIMC,PXOR and PCLMULQDQ and make use of the 128 data busses that are part of processors in the INTEL AND AMD ranges,therefore there are no side channel attack vectors, actually the AMD A10-7800k (Kavari) can make use of the AESNI instructions so can run bitlocker very quickly.
where do you guys keep getting dot matrix printer paper from?
Love your videos ❤
Thanks for this lesson. I have a question, what cipher mode is applicable in the AES encryption?
By cipher mode, I meant something like ECB, CBC, CTM, GCM, etc.
i think the ones most used are GCM and CTR, as they are the most secure, sometimes u might find CBC. other modes, such as CFB, EBC or OFB are usable, but not believed to be secure
Great video
Oops, the matrix multiplication was represented incorrectly in animation (it’s not commutative). But the video was lovely regardless!
How does this one guy know such a ridiculous amount about all this stuff, honestly really impressive