The data at location M (gO, g15) is substituted from S-box. This is repeated for the remaining locations such as M(gl, gM. M(g2 oe MIgs, g12), Mist gl1), M(g5,g10), M(g6,g9), M(g7, a M(g8,g7), M(g9, g6), M(gl10,g5), | M(gl1,g4), M(g12,g3), | M(g13,g2), M(g14,g1), M(g15,g0) . Thus, using the first row of the cipher matrix 16 data elements are substituted in the state matrix. Similarly, the entire process is carried out using the second row of cipher key matrix and so on. After entire process the values are copied to state matrix and given to the convert row step. Figure 3: Shifting round Add Round Key: The actual ‘encryption’ is performed in the AddRoundKey () function, when each byte in the State is X ORed with the sub key. The sub key is derived from the key according to a key expansion schedule Figure 4: Add Round Key Encryption time is used to calculate the throughput of an encryption scheme. It indicates the speed of encryption. The throughput of the encryption scheme is calculated by dividing the total plaintext in Megabytes encrypted on the total encryption time for each algorithm in. As the throughput value is increased, the power consumption of the encryption technique is decreased. Table 3 shows the average time and Figure 5: Encryption Time Analysis Figure 7: Throughput A nalysis (Encryption) TABLEIII: THROUGHPUT A NALYSIS (ENCRYPTION) Figure 8: Decryption Time Analysis