How to solve AES example? | AES Encryption Example | AES solved Example | AES Example solution

AES Example | AES Encryption Example | AES solved Example | Solved Example of AES encryption | AES Transformation Function

In this video, I have explained introduction of AES. Then explained all transformation fuctions of AES with example (Example from William Stallings book) is in this video. Watch carefully. AES Solved example.

Introduction of AES:
AES uses 128 bits of plain text. AES consists of multiple rounds of processing different key bits like,
128 bits key – perform 10 rounds of encryption
192 bits key – perform 12 rounds of encryption.
256 bits key – perform 14 rounds of encryption.

For encryption, each round consists of the following four steps: Sub Bytes,
Shift Rows, Mix Columns, Add Round Key.
Above steps also called AES transformation function.

AES Sub BytesTransformation Function:
First transformation function of AES is called as Substitute Bytes (Sub Bytes). It is also known as forward substitute bytes transformation. AES defines a 16 x 16 matrix of byte values, called an S-box, that contains a permutation of all possible 256 8-bit values. These row and column values serve as indexes into the S-box to select a unique 8-bit output value.

AES Shift Rows Transformation Function:
Second transformation function of AES is called as Shift Rows. It is also called as forward shift row transformation. Rules of shifting rows are as below,
Row 1 ⇒ No Shifting
Row 2 ⇒ 1 byte circular left shift
Row 3 ⇒ 2 bytes circular left shift
Row 4 ⇒ 3 bytes circular left shift

AES Mix Column Transformation Function:
Third transformation function of AES is called as Mix Columns, operates on each column individually. Each byte of a column is mapped into a new value that is a function of all four bytes in that column. Here in this function State Array is Output of Shift Rows function.

AES Add Round Key Transformation Function:
Fourth transformation function of AES is called as Add Round Key. It is also known as forward add round key transformation. The 128 bits of State are bitwise XORed with the 128 bits of the round key. Add Round Key proceeds one column at a time.

0:00 Introduction
0:15 Outline
0:45 Introdcution of AES
2:13 AES Sub Bytes (Explain with example)
5:47 AES Shift Rows (Explain with example)
8:50 AES Mix Column (Explain with example)
32:27 AES Add Round Key (Explain with example)

If you like my video contents, please LIKE, COMMENT, SUBSCRIBE & SHARE with your friends.

--------------------------------------------------------------------------------------------------------------
Check out other video on my channel

Block Cipher and Stream Cipher:

Confusion & Diffusion (Frustrated Statistical Analysis or Claud Shannon Properties):

Feistel Cipher Structure (to understand DES):

Data Encryption Standard (DES) Algorithm:

DES Example using Animation:

Strength & Weakness of DES, Avalanche effect in DES:

Advanced Encryption Standard (AES) Algorithm with structure:

AES Example using Animation:

Key expansion in AES:

--------------------------------------------------------------------------------------------------------------
You can always connect with me at:

Follow my blog:

Like my Facebook page:

Follow me on Instagram:

Follow me on twitter:

Join telegram group:

Subscribe me on youtube:

Follow me on Quora:

--------------------------------------------------------------------------------------------------------------
Playlist available on my channel:

Network Security (CNS, INS, IS):

Computer Network (CN) with animation:

VFX Animation & Fun Videos:

Comupter Organization & Architecture (COA, CA, CO):

Assembly Language Programming:

Computer Graphics:

#chirag_bhalodia
#chiragbhalodia
#networksecurity
#cryptography
#AES_Solved_Example
#How_to_solve_aes_example

Keep learning, keep supporting 🤝✨💯

[aaradhyakhanna]

watched this one night before examination. Explaned simply with good slideshow. Thank you sir.

[vanshsuvarna]

was just gonna skip the video because of being so long but this was the best explaination i've got so far...thank you so much sir!

[abdullahalwawi]

Thanks sir
The best AES video i watched so far

[emy]

This is amazing, thank god i found your video ❤

[_GreenSarker]

very good explanation .👍 It is the best video for understanding AES 👍

[drilisertugrul]

thank you so so much for this effort I really appreciate your effort

[tabasamalam]

What a great explanation with slide show. Thanks a lot 👍👍

[MOSHIURRAHMANVLOG]

Thanks for this amazing explanation sir 🤒🤲💙

[ThefamousMrcroissant]

Damn, really rigorous! Great explanation.

[ranawaqasnaveed]

To express **87 (decimal)** in **irreducible polynomial form** over \( GF(2) \), we need to:

1. **Convert 87 to Binary:**
87 (decimal) = **1010111** (binary).

2. **Interpret the Binary as a Polynomial:**
In **GF(2)**, each bit represents a coefficient of a polynomial. For example:
- \(1x^6 + 0x^5 + 1x^4 + 0x^3 + 1x^2 + 1x^1 + 1\).
- This simplifies to:
\(x^6 + x^4 + x^2 + x + 1\).

3. **Polynomial Representation of 87:**
The binary **1010111** corresponds to the polynomial:

\[
x^6 + x^4 + x^2 + x + 1
\]

---

### **Summary**

So, the irreducible polynomial form of **87 (decimal)** is:

\[
x^6 + x^4 + x^2 + x + 1
\]

This polynomial can be used in AES or other algorithms requiring operations over finite fields \(GF(2^8)\).

[shabeersyslab]

amazing dear, great explanation <3

[crippledmind]

Best video.. ❤should have done key expansion also

[rabiasaif]

Thanku Soo much..I searched all the lectures on you tube..but it was the best❤❤

[harinibk]

sir will the question be asked in the 4x4 matrix FORMAT like u mentioned in the beggining? (EA, 04) or a plaintext will be given in different format?

[ranausama]

Last step ma Round key matrix kasa aii Ya bata da😊

[vishwabiradar]

Hii Sir, Vishwa here
Sir what u took the value of 46 in binary is wrong if we convert it into decimal its 70 the binary for 46 is 0010 1110

[Soccersillies]

Sir please make a video on how to generate a 128 bit key

[lorahristova]

Sir, how is x^8 equal to x^4 + x^3 + x + 1 (13:13 in the video) I didn't quite get that?

[jephinjohn]

Is the round key already defined or we are manually setting it for our project? And X^8 = x^4+x^3+x right? 1 is not there yeah? Like 1 was already there before using irreducible polynomial

[majetypraneeth]

sir, can u tell me how we got the round key in step 4, and can u please tell me the question for this example