Part 2 | Step by Step AES Subbyte Calculation without using S-Box Table | GCD | Cryptography

In part 2, Extended Euclidean algorithm is used to find the GCD and then find multiplicative inverse using Irreducible Prime. AES is a variant of the Rijndael block cipher developed by two Belgian cryptographers, Joan Daemen and Vincent Rijmen, who submitted a proposal to NIST during the AES selection process.Rijndael is a family of ciphers with different key and block sizes. For AES, NIST selected three members of the Rijndael family, each with a block size of 128 bits, but three different key lengths: 128, 192 and 256 bits. DON’T FORGET TO LIKE & SUBSCRIBE TO THE CHANNEL & CLICK THE BELL ICON FOR LATEST UPDATES. YOUTUBE CHANNEL LINK : https://www.youtube.com/@Muhammed_Mustaqim