Sir, at video length 2:31, there is a mistake in the matrix value when the message and key XOR operation was done. In the 3rd column last element, it should be 08 instead of 0f.
Yes, when your output in mixColumns is greater than x^7 you need to use a irreducible polynomial, and the exact one you stated in your comment is intended to be used as said by the aes developers
After going through the whole encryption and decryption cycle of AES. I have 2 questions in my mind. Question 1 Why initial transformation is performed? Like we are just XORing the round 0 key with input vector. Why not going through the whole transformation steps? Question 2 Why the last round in encryption and decryption has mix columns step missing? What's the logic behind the difference in these rounds from other rounds? Can you just brief on these?
We need more teachers like you Sir😇
Thank you so much for this video series, Well explained with practical examples. Thank you, sir.
Thank you so much for these two videos.. very clear explanation with example loved your video ❤️
Thanks Alot you make my day Huge respect from University of Management and Technology Lahore pakistan
Glad to know the lecture helped. Thanks for the nice feedback!!
Thanks a lot sir, AES was really hard for me to understand but i understood it now!
Most welcome!
Well explained with practical example !
thank you, this is a very clear explanation with written calculations of all needed scenario to understand the AES, thank you very much
Glad to know the video helped. Thanks for the nice feedback
Thank you man, you mad my day, I'll pray for you!
Such a nice and proper explanation ...😍❤
Glad you liked it
Thank you Sir. You clear all my doubts regarding mix columns.
You are most welcome
Thank k last day pe ap k vedio ne kmal kr diya
Amazing explanation!! Thanks a lot
Glad you liked it
Very elaborate explanation. Thank you sir.
thankyou so much sir, now I understand na the mix columns in aes.. THANKYOUUUUUUU 😀
Glad to know the lecture helped. Thanks for the feedback
this video is really helpful so much 😊💚
Again thank you for the great lecture!
Glad you enjoyed it!
Thank you for the video. Easily understandable.
Great Sathish Sir,Ur humble and great teacher 🙏
Thankyou, Very well explained. 💯 💯
Thank you! Very clear and to the point.
Well explained, thank you
Really helped a lot, thank you so much sir
i finally master it you good lecture
Thank you very much again.
thank you sir
Nice sir ,do another vedio how the add round key will work take allready substituted values
And one more thing is, if we are using the irredicval polynomial the value of the polynomial can same
very helpful
Glad to hear that
You saved me! Thank you!
Very nice
great video!!!
Sir, It's very clear, Can I get PPT For AES ALGORITHM including round steps
Thank you very much ❤️
Can you tell me when we need to use irredicval polynomial, in every step or when we're in state of x8.
Thanks sir
Sir, why that particular irreducible polynomial is used?
Sir, at video length 2:31, there is a mistake in the matrix value when the message and key XOR operation was done. In the 3rd column last element, it should be 08 instead of 0f.
You are god❤️
I am just a beginner. Got a lot more things to learn . Thanks for the appreciation 👍
When you get a irreducible polynomial, does p(x) always result in x^8+x^4+x^3+x+1 ?
Yes, when your output in mixColumns is greater than x^7 you need to use a irreducible polynomial, and the exact one you stated in your comment is intended to be used as said by the aes developers
@@aragonarathon2066
thank
Thanks a lot!
Thanks!
Greaaaaaaaaat
will you lecture this clearly in vit though..
Sir can you make one video on bilinear pairing
Sure.. I will try 👍
I have confusion that on what basis p(x) value is taken?
Sir ap ny kis trh P(x) ki value x^8+x^4+x^3+x+1 li hai
Ye tumhe provided hoga, tumhe nikalne ka jarurat nahi
How did you get 81??
Thank you very much, can you send me this pdf example
how to write irreducible polynomial sir i.e p(x)??
isnt that a fixed polynomial--> x^8+x^4+x^3+x+1
After going through the whole encryption and decryption cycle of AES. I have 2 questions in my mind.
Question 1
Why initial transformation is performed? Like we are just XORing the round 0 key with input vector. Why not going through the whole transformation steps?
Question 2
Why the last round in encryption and decryption has mix columns step missing?
What's the logic behind the difference in these rounds from other rounds?
Can you just brief on these?
7:55 HI !! can someone explan to me how to calculate = 81
It's r1 not 81