Thank you so much.... This kind of comments really motivate me..... Please share with others..... Please subscribe my channel..... Please follow my blog: chiragbhalodia.com
Our teacher explained it in 10 minutes and good too. However my problem is I have used mini AES(AES with 16-bit) my results are not same as computers . I have done multiple times on sheet. My PT is "ok" and key is 1010011100111011. So I am watching videos
Glad you enjoyed it! Thank you.... Please share with others..... Please Subscribe my channel... Please follow my blog: www.chiragbhalodia.com/p/network-security.html
Thank u so much chris... this kind of appreciation motivate me.... Please share this video with others... Please subscribe my channel.... Please follow my blog: chiragbhalodia.com
Glad it helped!... Best of luck.... Please share with others....Keep supporting... Please subscribe my channel.... Please follow my blog: www.chiragbhalodia.com/2021/09/aes-algorithm.html
Glad you liked it... Please share with others.... Keep supporting... Please subscribe my channel.... Please follow my blog: www.chiragbhalodia.com/2021/09/aes-algorithm.html
Explanation is excellent 👍 I have my exams next week i need to consume the time limit while doing is their any other way in short to do this aes problem
There is the only method to solve aes mix column.... No any other short cut.... All the best for exam.... Please share with other.... Keep supporting and subscribe my channel.... Follow my blog: www.chiragbhalodia.com/p/network-security.html
I have use irreducible polynomial theorem.... because our maximum binary bit is 8... .So maximum power of polynomial is x^7.... if power is more than 7, i have to use irreducible polynomial theorem and reduce the power of polynomial below or equal to 7.
Keep watching and share with others... Please subscribe my channel... Please follow my blog: chiragbhalodia.com Sorry for late reply...!!! Please follow this link for invese mix column: ruclips.net/video/SDrzMyqi2Sc/видео.html
Yeah exactly. That was my typing mistake... Coz this video is very lengthy with calculation. So, If forget to change.. Thank you very much for your suggestion..
ohhhh dear..... thank you for this question.... that was my typing mistake..... Please subscribe my channel.... Please follow my blog: chiragbhalodia.com
I have no special code for this...but I will give you a link for AES Source code in C Language: Please follow my blog: www.chiragbhalodia.com/2022/05/AES-program-in-c.html Please Subscribe my channel...keep supporting....Share with others.... Course of Computer network: www.chiragbhalodia.com/p/computer-network.html Full course of Network Security: www.chiragbhalodia.com/p/network-security.html
Thanks..... Please share with others.... Please subscribe my channel.... Please follow my blog: chiragbhalodia.com Also watch this one: ruclips.net/video/SDrzMyqi2Sc/видео.html
87 is hex decimal value.... so 87 = 1000 0111 if 87 in decimal value than 87 = 0101 0111 I think your doubt is clear.... Also you can watch this video: ruclips.net/video/SDrzMyqi2Sc/видео.html Please share with others... Please subscribe my channel.... Please follow my blog: chiragbhalodia.com
Sorry for late reply...!!!! For example, after multiplication of polynomial when we get the value above X^7. For example, it may be X^8. So, I have to convert in to less or equal to X^7 polynomial. Because when we convert this polynomial into binary values, it must be 8 digits (0-7 values). Then after binary values convert into hexadecimal numbers....
Great video... Thank u so much for sharing.... thank u for whole example solution.... I can try my own way....
You are so welcome!..... Please share with others...... keep supporting....
Thank you so much..... Keep supporting...
i was looking for this "perform 14 rounds of encryption." thank for nice explanation
Thank you so much..... Please share with others......
our teacher took 2 weeks and 6 lectures to explain this and nobody understood anything. you are really amazing
Thank you so much.... This kind of comments really motivate me.....
Please share with others.....
Please subscribe my channel.....
Please follow my blog: chiragbhalodia.com
Our teacher explained it in 10 minutes and good too.
However my problem is I have used mini AES(AES with 16-bit) my results are not same as computers .
I have done multiple times on sheet.
My PT is "ok" and key is 1010011100111011.
So I am watching videos
Very nice video, showing the example workings from start to finish are priceless.
Glad you enjoyed it!
Thank you.... Please share with others.....
Please Subscribe my channel...
Please follow my blog: www.chiragbhalodia.com/p/network-security.html
outstanding explanation! looked up a couple of videos to understand this but yours was the BEST.
Glad you liked it....!!! Please share with others....
Please subscribe my channel....!!!!
Please follow my blog: chiragbhalodia.com
Other wise too much good ❤❤
Thnak you...!!!!!Please share with others...
Please subscribe my channel...
Please follow my blog: chiragbhalodia.com
Very useful content
Thanks a lot.....!!!!
Oh, you saved me❤
Thank you so much...!!!!
Please subscribe my channel...
Please share with others...
Please follow my blog: chiragbhalodia.com
Amazing explanation I have ever seen on RUclips
Thank u so much chris... this kind of appreciation motivate me....
Please share this video with others...
Please subscribe my channel....
Please follow my blog: chiragbhalodia.com
Very clear and simply explaination. Thank you so much :)
Thanks for watching..... Please share with others....
Please subscribe my channel...
Please follow my blog: chiragbhalodia.com
اشكرك من كل قلبي 🙏🙏🙏🙏🙏🙏🙏
لقد ساعدتني في المادة
You are welcome.... Please share with others....keep supporting...
Please subscribe my channel....
Please follow my blog: chiragbhalodia.com
thank you man! I have to make a school presantation about AES... this helps a lot
Glad it helped!... Best of luck.... Please share with others....Keep supporting...
Please subscribe my channel....
Please follow my blog: www.chiragbhalodia.com/2021/09/aes-algorithm.html
Thanks for the amazing explanation!
Thank you so much....
Please share with others...
Please subscribe my channel...
Please follow my blog: chiragbhalodia.com
Amazing video and explanation. Thanks.
Glad it was helpful!...Keep Watching...Please share with others....
Please subscribe my channel...
Please follow my blog: chiragbhalodia.com
Simple Super exaplanation.
Glad you liked it... Please share with others.... Keep supporting...
Please subscribe my channel....
Please follow my blog: www.chiragbhalodia.com/2021/09/aes-algorithm.html
THANK YOU SO MUCH! I GET IT!!!
Welcome...
Please share with others and subscribe my channel....
Please follow my blog: chiragbhalodia.com
Please upload the MD5 algorithm example and mds matrix example
ok I will upload..... Please subscribe my channel....
Follow my blog: chiragbhalodia.com
Explanation is excellent 👍 I have my exams next week i need to consume the time limit while doing is their any other way in short to do this aes problem
There is the only method to solve aes mix column.... No any other short cut.... All the best for exam....
Please share with other.... Keep supporting and subscribe my channel....
Follow my blog: www.chiragbhalodia.com/p/network-security.html
Great video! Thank u bro
Glad to hear that...Please share with others....
Please subscribe my channel...
Please follow my blog: chiragbhalodia.com
Great video! I don’t understand how you reduce binary codes that are too long though… how do you apply the irreducible polynomial theorem?
I have use irreducible polynomial theorem....
because our maximum binary bit is 8... .So maximum power of polynomial is x^7.... if power is more than 7, i have to use irreducible polynomial theorem and reduce the power of polynomial below or equal to 7.
Hello it was very helpful I have doubt how it works as inverse mix column as you have told in previous video for decryption invsmixcoloumn please help
Keep watching and share with others...
Please subscribe my channel...
Please follow my blog: chiragbhalodia.com
Sorry for late reply...!!!
Please follow this link for invese mix column: ruclips.net/video/SDrzMyqi2Sc/видео.html
AES is in GF(2^8) not 2^3 as you claim but calculation is correct a you have used the right irreducible polynome
Yeah exactly. That was my typing mistake... Coz this video is very lengthy with calculation. So, If forget to change.. Thank you very much for your suggestion..
Great!
Thank u so much...!!!!
Please share this video with others...
Please subscribe my channel....
Please follow my blog: chiragbhalodia.com
how can i find irreducible polynomials for all the higher degrees? ,(when performing galois multiplication)
For this you have to learn galois theory concept. That I can't explain here.
If i got X^13 then how can i use GF(2^8).please answer me.
X^13 = X^8 * X^5
Why is the multiplication by 0x1b not used ?
I din't understand your question??? At what time in video you have query
Mistake in the binary value of 03
Please tell me how to solve D7*03 in GF(2^3)
Can you share your email ID??? I will send you a solution...!!!
Sorry for late reply...!!!
@@ChiragBhalodia May you send me a solution for the question above 😅
Shouldnt it be GF(2^8)?
It is GF(2^8)...
Why 01 * 4c = 6e
I did not get it
ohhhh dear..... thank you for this question.... that was my typing mistake.....
Please subscribe my channel....
Please follow my blog: chiragbhalodia.com
04:12
It should be GF(2⁸) and not GF(2³)
Yeah you are right... that was my typo mistake..... Thanx for suggestion.... More proof reading required..... Thank you....
Hello is there's any code can solve that?
I have no special code for this...but I will give you a link for AES Source code in C Language:
Please follow my blog: www.chiragbhalodia.com/2022/05/AES-program-in-c.html
Please Subscribe my channel...keep supporting....Share with others....
Course of Computer network: www.chiragbhalodia.com/p/computer-network.html
Full course of Network Security: www.chiragbhalodia.com/p/network-security.html
Like
Thanks..... Please share with others....
Please subscribe my channel....
Please follow my blog: chiragbhalodia.com
Also watch this one: ruclips.net/video/SDrzMyqi2Sc/видео.html
🖤
Glad it was helpful!...Please share with others....
Please subscribe my channel....
Please follow my blog: chiragbhalodia.com
can anybody explain why 87=10000111 but not 01010111?
87 is hex decimal value.... so 87 = 1000 0111
if 87 in decimal value than 87 = 0101 0111
I think your doubt is clear....
Also you can watch this video: ruclips.net/video/SDrzMyqi2Sc/видео.html
Please share with others...
Please subscribe my channel....
Please follow my blog: chiragbhalodia.com
@@ChiragBhalodia thank you for the response, later I found out about it and corrected my calculations.
Welcome
How x^8 is replaced with x^4+x^3+x+1?? 5:44
At that time I have applied irreducible polynomial theorem.... So, it is the concept of irreducible polynomial theorem...!!!
@@ChiragBhalodia Can you explain that how you got x^8 value by using irreducible polynomial??
That is exactly theorem... I cannot explain theorem here.... But i can explain why it is used...If you want???
@@ChiragBhalodia okay explanation
Sorry for late reply...!!!!
For example, after multiplication of polynomial when we get the value above X^7. For example, it may be X^8. So, I have to convert in to less or equal to X^7 polynomial. Because when we convert this polynomial into binary values, it must be 8 digits (0-7 values). Then after binary values convert into hexadecimal numbers....
You did a mistake at 8:30! how 03 is = X + 1 ?
Yes.... Really Thank you for pointing out that....Right now I can't do anything but next time i will improve my proof reading....
03 is x+1 he just made mistake writing the binary