diff --git a/circuits/aes/README.md b/circuits/aes-gcm-siv/README.md
similarity index 100%
rename from circuits/aes/README.md
rename to circuits/aes-gcm-siv/README.md
diff --git a/circuits/aes/aes_256_ctr.circom b/circuits/aes-gcm-siv/aes_256_ctr.circom
similarity index 76%
rename from circuits/aes/aes_256_ctr.circom
rename to circuits/aes-gcm-siv/aes_256_ctr.circom
index c1729c8..6dc6a98 100644
--- a/circuits/aes/aes_256_ctr.circom
+++ b/circuits/aes-gcm-siv/aes_256_ctr.circom
@@ -4,21 +4,32 @@ pragma circom 2.0.0;
 include "aes_256_encrypt.circom";
 include "helper_functions.circom";
 
+/// AES-256 CTR template
+/// We will need to change this to AES-128 CTR
+/// Which means we will need to change the aes_256_encrypt.circom to aes_128_encrypt.circom
 template AES256CTR(n_bits)
 {
     var msg_len = n_bits/8;
     signal input in[n_bits];
     signal input ctr[128];
+    /// TODO(WJ 2024-08-09): change to correct key bytes
+    /// Question: 1920 / 8 = 240? why is there key 16 bits less than the input size?
+    /// niavely it should be 128 * 8 = 1240 bits?
     signal input ks[1920];
+
+    /// output is amount of input bits
     signal output out[n_bits];
 
+    /// What is EK?
     var EK[128];
     var p_index = 0, c_index = 0;
     var ctr_t[128] = ctr;
     var out_t[msg_len][8];
 
+    /// iterator varirables 
     var i, j, k, l;
 
+    /// components for 16 bit blocks
     component aes_256_encrypt_1[msg_len/16];
     component xor_1[msg_len/16][4][4][32];
     component num2bits_1[msg_len/16];
@@ -26,6 +37,7 @@ template AES256CTR(n_bits)
 
     for(i=0; i<msg_len/16; i++)
     {
+        /// for each block encrypt with aes;
         aes_256_encrypt_1[i] = AES256Encrypt();
         for(j=0; j<128; j++) aes_256_encrypt_1[i].in[j] <== ctr_t[j];
         
@@ -60,4 +72,4 @@ template AES256CTR(n_bits)
             for(k=0; k<8; k++) ctr_t[j*8+k] = num2bits_1[i].out[j*8+7-k];
         }
     }
-}
\ No newline at end of file
+}
diff --git a/circuits/aes/aes_256_ctr_test.circom b/circuits/aes-gcm-siv/aes_256_ctr_test.circom
similarity index 99%
rename from circuits/aes/aes_256_ctr_test.circom
rename to circuits/aes-gcm-siv/aes_256_ctr_test.circom
index bb675b2..31ce874 100644
--- a/circuits/aes/aes_256_ctr_test.circom
+++ b/circuits/aes-gcm-siv/aes_256_ctr_test.circom
@@ -30,7 +30,6 @@ template AES_256_CTR_TEST(n_bits_msg, n_bits_aad) {
     // populate tag for counter
     var TAG[128];
     for(i=0; i<128; i++) TAG[i] = CT[msg_len*8+i];
-
     // populate counter
     var CTR[128];
     for(i=0; i<128; i++) CTR[i] = TAG[i];
diff --git a/circuits/aes/aes_256_encrypt.circom b/circuits/aes-gcm-siv/aes_256_encrypt.circom
similarity index 60%
rename from circuits/aes/aes_256_encrypt.circom
rename to circuits/aes-gcm-siv/aes_256_encrypt.circom
index be01ac1..955235c 100644
--- a/circuits/aes/aes_256_encrypt.circom
+++ b/circuits/aes-gcm-siv/aes_256_encrypt.circom
@@ -5,31 +5,45 @@ include "aes_emulation_tables.circom";
 include "aes_emulation.circom";
 include "helper_functions.circom";
 
+
+/// AES-256 Encrypt template
+/// We will need to change this to AES-128 Encrypt
+/// Which means we will need to change the key size to 128
+/// And the number of rounds to 10
+
 template AES256Encrypt()
 {
-    signal input in[128];
-    signal input ks[1920];
-    signal output out[128];
+    /// Input is 128 bit of plaintext
+    signal input in[128]; // ciphertext
+    /// Key schedule is 1920 bits
+    signal input ks[1920]; // key bits Not sure why it's 1920 (240 bytes)
+    /// Output is 128 bit of ciphertext
+    signal output out[128]; // plaintext
 
     var ks_index = 0;
+    
+    /// TODO(WJ 2024-08-09): what are these?
+    /// 4 x 32 mattrix of field elements
     var s[4][32], t[4][32];
     
     var i,j,k,l,m;
     
     component xor_1[4][32];
-
-    for(i=0; i<4; i++)
+    /// state initialization, might have to do with key size being 240byte rather 256byte
+    for(i=0; i<4; i++) // adding round key
     {
         for(j=0; j<32; j++)
         {
             xor_1[i][j] = XOR();
-            xor_1[i][j].a <== in[i*32+j];
-            xor_1[i][j].b <== ks[(i+ks_index)*32+j];
+            /// example sequece [[0..31],[33..64]
+            /// i see so they are 32 bit chunks
+            /// Then XOR each chuck with parts of the keys 
+            xor_1[i][j].a <== in[i*32+j]; // plaintext
+            xor_1[i][j].b <== ks[(i+ks_index)*32+j]; // key schedule
 
             s[i][j] = xor_1[i][j].out;
         }
     }
-    
     ks_index += 4;
 
     component xor_2[13][4][3][32];
@@ -37,36 +51,47 @@ template AES256Encrypt()
     component num2bits_1[13][4][4];
     component xor_3[13][4][32];
 
-    for(i=0; i<13; i++)
+
+    /// 14 rounds of encryption TODO(WJ 2024-08-09): Change this to 10 rounds to fit AES-128
+    for(i=0; i<13; i++) // 13 iterations maybe one extra at the end or happened to generate the key above?
     {
-        for(j=0; j<4; j++)
+        /// 5 steps in each round
+        /// Step 1: SubBytes
+        /// Step 2: ShiftRows:
+        /// Step 3: MixColumns
+        /// Step 4: AddRoundKeys
+        /// 
+        for(j=0; j<4; j++) // 4 iterations
         {
-            for(k=0; k<4; k++)
+            for(k=0; k<4; k++) // 4 iterations // COLUMN MIXING ALGORITHM
             {
+                /// initialize trace space for 13x4x4 uses of bits2num and num2bit
                 bits2num_1[i][j][k] = Bits2Num(8);
                 num2bits_1[i][j][k] = Num2Bits(32);
+                /// 0 - 3 based on sum of index j and k
+                /// grabbing 1 x 32 bit row from state (top to bottom)
                 var s_tmp[32] = s[(j+k)%4];
-                
+                /// big endian indexing through the bits to num
                 for(l=0; l<8; l++) bits2num_1[i][j][k].in[l] <== s_tmp[k*8+7-l];
-
+                /// I think this is the sbox lookup, not sure any more
                 num2bits_1[i][j][k].in <-- emulated_aesenc_enc_table(k, bits2num_1[i][j][k].out);
 
-                if(k==0)
+                if(k==0) // first row unchanged (not shifted)
                 {
                     for(l=0; l<4; l++)
                     {
                         for(m=0; m<8; m++)
-                        {
+                        { // setting up one part of a xor
                             xor_2[i][j][k][l*8+m] = XOR();
                             xor_2[i][j][k][l*8+m].a <== num2bits_1[i][j][k].out[l*8+7-m];
                         }
                     }
                 }
-                else if(k<3)
+                else if(k<3) // 2nd, 3rd rows are shifted by 1, 2 respectively (clever indexing here is how they do this)
                 {
-                    for(l=0; l<4; l++)
+                    for(l=0; l<4; l++) // 4
                     {
-                        for(m=0; m<8; m++)
+                        for(m=0; m<8; m++) // 8 -> 32 bits = 1 row of state
                         {
                             xor_2[i][j][k-1][l*8+m].b <== num2bits_1[i][j][k].out[l*8+7-m];
 
@@ -75,6 +100,7 @@ template AES256Encrypt()
                         }
                     }
                 }
+                /// Thought 1: is  this maybe just copying  memory?
                 else
                 {
                     for(l=0; l<4; l++)
@@ -90,7 +116,6 @@ template AES256Encrypt()
                 }
             }
         }
-
         for(j=0; j<4; j++)
         {
             for(l=0; l<32; l++)
@@ -100,7 +125,7 @@ template AES256Encrypt()
             }
         }
         ks_index += 4;
-    }
+    } // end of round
 
     component bits2num_2[16];
     var s_bytes[16];
@@ -115,6 +140,7 @@ template AES256Encrypt()
         }
     }
 
+    /// Row shifting and substitution
     component row_shifting = EmulatedAesencRowShifting();
     component sub_bytes = EmulatedAesencSubstituteBytes();
     for(i=0; i<16; i++) row_shifting.in[i] <== s_bytes[i];
@@ -134,7 +160,7 @@ template AES256Encrypt()
 
     component xor_4[4][32];
 
-    for(i=0; i<4; i++)
+    for(i=0; i<4; i++) // final key XOR?
     {
         for(j=0; j<32; j++)
         {
diff --git a/circuits/aes/aes_256_key_expansion.circom b/circuits/aes-gcm-siv/aes_256_key_expansion.circom
similarity index 100%
rename from circuits/aes/aes_256_key_expansion.circom
rename to circuits/aes-gcm-siv/aes_256_key_expansion.circom
diff --git a/circuits/aes/aes_emulation.circom b/circuits/aes-gcm-siv/aes_emulation.circom
similarity index 82%
rename from circuits/aes/aes_emulation.circom
rename to circuits/aes-gcm-siv/aes_emulation.circom
index ca60768..523561f 100644
--- a/circuits/aes/aes_emulation.circom
+++ b/circuits/aes-gcm-siv/aes_emulation.circom
@@ -3,8 +3,11 @@ pragma circom 2.0.0;
 
 include "aes_emulation_tables.circom";
 
+/// template or row shifting
 template EmulatedAesencRowShifting()
 {
+
+    /// Opperating on 16 bits at a time
     signal input in[16];
     signal output out[16];
     
@@ -29,6 +32,8 @@ template EmulatedAesencRowShifting()
     for(var i=0; i<16; i++) out[i] <== in[byte_order[i]];
 }
 
+/// Template for S-Box using the aes_encoding_rijndael_sbox
+/// https://en.wikipedia.org/wiki/Rijndael_S-box
 template EmulatedAesencSubstituteBytes()
 {
     signal input in[16];
diff --git a/circuits/aes/aes_emulation_tables.circom b/circuits/aes-gcm-siv/aes_emulation_tables.circom
similarity index 100%
rename from circuits/aes/aes_emulation_tables.circom
rename to circuits/aes-gcm-siv/aes_emulation_tables.circom
diff --git a/circuits/aes/dec_aes_256_ctr_try1.circom b/circuits/aes-gcm-siv/dec_aes_256_ctr_try1.circom
similarity index 100%
rename from circuits/aes/dec_aes_256_ctr_try1.circom
rename to circuits/aes-gcm-siv/dec_aes_256_ctr_try1.circom
diff --git a/circuits/aes/gcm_siv_dec_2_keys.circom b/circuits/aes-gcm-siv/gcm_siv_dec_2_keys.circom
similarity index 100%
rename from circuits/aes/gcm_siv_dec_2_keys.circom
rename to circuits/aes-gcm-siv/gcm_siv_dec_2_keys.circom
diff --git a/circuits/aes/gcm_siv_dec_2_keys_test.circom b/circuits/aes-gcm-siv/gcm_siv_dec_2_keys_test.circom
similarity index 100%
rename from circuits/aes/gcm_siv_dec_2_keys_test.circom
rename to circuits/aes-gcm-siv/gcm_siv_dec_2_keys_test.circom
diff --git a/circuits/aes/gcm_siv_enc_2_keys.circom b/circuits/aes-gcm-siv/gcm_siv_enc_2_keys.circom
similarity index 100%
rename from circuits/aes/gcm_siv_enc_2_keys.circom
rename to circuits/aes-gcm-siv/gcm_siv_enc_2_keys.circom
diff --git a/circuits/aes/gfmul_int.circom b/circuits/aes-gcm-siv/gfmul_int.circom
similarity index 100%
rename from circuits/aes/gfmul_int.circom
rename to circuits/aes-gcm-siv/gfmul_int.circom
diff --git a/circuits/aes/helper_functions.circom b/circuits/aes-gcm-siv/helper_functions.circom
similarity index 97%
rename from circuits/aes/helper_functions.circom
rename to circuits/aes-gcm-siv/helper_functions.circom
index de66cd2..d53b28b 100644
--- a/circuits/aes/helper_functions.circom
+++ b/circuits/aes-gcm-siv/helper_functions.circom
@@ -1,9 +1,9 @@
 // Copyright © 2022, Electron Labs
 pragma circom 2.0.0;
 
-include "./lib_circuits/bitify.circom";
-include "./lib_circuits/gates.circom";
-include "./lib_circuits/comparators.circom";
+include "../lib_circuits/bitify.circom";
+include "../lib_circuits/gates.circom";
+include "../lib_circuits/comparators.circom";
 
 template BitwiseRightShift(n, r) {
     signal input in[n];
diff --git a/circuits/aes/mul.circom b/circuits/aes-gcm-siv/mul.circom
similarity index 100%
rename from circuits/aes/mul.circom
rename to circuits/aes-gcm-siv/mul.circom
diff --git a/circuits/aes/polyval.circom b/circuits/aes-gcm-siv/polyval.circom
similarity index 100%
rename from circuits/aes/polyval.circom
rename to circuits/aes-gcm-siv/polyval.circom
diff --git a/circuits/aes/tiny.circom b/circuits/aes-gcm-siv/tiny.circom
similarity index 100%
rename from circuits/aes/tiny.circom
rename to circuits/aes-gcm-siv/tiny.circom
diff --git a/circuits/aes/vclmul_emulator.circom b/circuits/aes-gcm-siv/vclmul_emulator.circom
similarity index 100%
rename from circuits/aes/vclmul_emulator.circom
rename to circuits/aes-gcm-siv/vclmul_emulator.circom
diff --git a/circuits/aes-gcm/aes_128_enc.circom b/circuits/aes-gcm/aes_128_enc.circom
new file mode 100644
index 0000000..9af256c
--- /dev/null
+++ b/circuits/aes-gcm/aes_128_enc.circom
@@ -0,0 +1,179 @@
+// Copyright © 2022, Electron Labs
+pragma circom 2.0.0;
+
+include "aes_emulation_tables.circom";
+include "aes_emulation.circom";
+include "helper_functions.circom";
+
+
+/// AES-128 Encrypt template
+/// AES-128 has 10 rounds, 9 partial rounds, and 1 final round
+
+// The number of full rounds for this key size (Not the last partial round)
+const ROUNDS = 10 - 1
+
+template AES128Encrypt()
+{
+    /// Input is 128 bit of plaintext
+    signal input in[128]; // ciphertext
+    
+    // Key schedule for initial, final, and between each full round
+    key_size <== (1 + 1 + ROUNDS) * 4 * 32
+    signal input ks[key_size];
+    
+    /// Output is 128 bit of ciphertext
+    signal output out[128]; // plaintext
+
+    var ks_index = 0;
+    
+    /// STATE: 4 x 32 mattrix of field elements
+    var s[4][32], t[4][32];
+    
+    var i,j,k,l,m;
+    
+    component xor_1[4][32];
+    for(i=0; i<4; i++) // adding round key
+    {
+        for(j=0; j<32; j++)
+        {
+            xor_1[i][j] = XOR();
+            /// Then XOR each chuck with parts of the keys 
+            xor_1[i][j].a <== in[i*32+j]; // plaintext
+            xor_1[i][j].b <== ks[(i+ks_index)*32+j]; // key schedule
+
+            s[i][j] = xor_1[i][j].out;
+        }
+    }
+    ks_index += 4;
+
+    component xor_2[ROUNDS][4][3][32];
+    component bits2num_1[ROUNDS][4][4];
+    component num2bits_1[ROUNDS][4][4];
+    component xor_3[ROUNDS][4][32];
+
+
+    /// 14 rounds of encryption TODO(WJ 2024-08-09): Change this to 10 rounds to fit AES-128
+    for(i=0; i<ROUNDS; i++) // 9 iterations maybe one extra at the end or happened to generate the key above?
+    {
+        /// 3 steps in each round
+        /// Step 1: SubBytes
+        /// Step 2: ShiftRows:
+        /// Step 3: MixColumns
+        for(j=0; j<4; j++) // 4 iterations
+        {
+            for(k=0; k<4; k++) // 4 iterations // COLUMN MIXING ALGORITHM
+            {
+                /// initialize trace space for 9x4x4 uses of bits2num and num2bit
+                bits2num_1[i][j][k] = Bits2Num(8);
+                num2bits_1[i][j][k] = Num2Bits(32);
+                /// 0 - 3 based on sum of index j and k
+                /// grabbing 1 x 32 bit row from state (top to bottom)
+                var s_tmp[32] = s[(j+k)%4];
+                /// big endian indexing through the bits to num
+                for(l=0; l<8; l++) bits2num_1[i][j][k].in[l] <== s_tmp[k*8+7-l];
+                /// I think this is the sbox lookup, not sure any more
+                num2bits_1[i][j][k].in <-- emulated_aesenc_enc_table(k, bits2num_1[i][j][k].out);
+
+                if(k==0) // first row unchanged (not shifted)
+                {
+                    for(l=0; l<4; l++)
+                    {
+                        for(m=0; m<8; m++)
+                        { // setting up one part of a xor
+                            xor_2[i][j][k][l*8+m] = XOR();
+                            xor_2[i][j][k][l*8+m].a <== num2bits_1[i][j][k].out[l*8+7-m];
+                        }
+                    }
+                }
+                else if(k<3) // 2nd, 3rd rows are shifted by 1, 2 respectively (clever indexing here is how they do this)
+                {
+                    for(l=0; l<4; l++) // 4
+                    {
+                        for(m=0; m<8; m++) // 8 -> 32 bits = 1 row of state
+                        {
+                            xor_2[i][j][k-1][l*8+m].b <== num2bits_1[i][j][k].out[l*8+7-m];
+
+                            xor_2[i][j][k][l*8+m] = XOR();
+                            xor_2[i][j][k][l*8+m].a <== xor_2[i][j][k-1][l*8+m].out;
+                        }
+                    }
+                }
+                else
+                {
+                    for(l=0; l<4; l++)
+                    {
+                        for(m=0; m<8; m++)
+                        {
+                            xor_2[i][j][k-1][l*8+m].b <== num2bits_1[i][j][k].out[l*8+7-m];
+
+                            xor_3[i][j][l*8+m] = XOR();
+                            xor_3[i][j][l*8+m].a <== xor_2[i][j][k-1][l*8+m].out;
+                        }
+                    }
+                }
+            }
+        }
+        /// AddRoundKey
+        for(j=0; j<4; j++)
+        {
+            for(l=0; l<32; l++)
+            {
+                xor_3[i][j][l].b <== ks[(j+ks_index)*32+l];
+                s[j][l] = xor_3[i][j][l].out;
+            }
+        }
+        ks_index += 4;
+    } // end of round
+
+    component bits2num_2[16];
+    var s_bytes[16];
+
+    for(i=0; i<4; i++)
+    {
+        for(j=0; j<4; j++)
+        {
+            bits2num_2[i*4+j] = Bits2Num(8);
+            for(k=0; k<8; k++) bits2num_2[i*4+j].in[k] <== s[i][j*8+7-k];
+            s_bytes[i*4+j] = bits2num_2[i*4+j].out;
+        }
+    }
+
+    /// Row shifting and substitution
+    component row_shifting = EmulatedAesencRowShifting();
+    component sub_bytes = EmulatedAesencSubstituteBytes();
+    for(i=0; i<16; i++) row_shifting.in[i] <== s_bytes[i];
+    for(i=0; i<16; i++) sub_bytes.in[i] <== row_shifting.out[i];
+
+    component num2bits_2[16];
+
+    for(i=0; i<4; i++)
+    {
+        for(j=0; j<4; j++)
+        {
+            num2bits_2[i*4+j] = Num2Bits(8);
+            num2bits_2[i*4+j].in <== sub_bytes.out[i*4+j];
+            for(k=0; k<8; k++) s[i][j*8+k] = num2bits_2[i*4+j].out[7-k];
+        }
+    }
+
+    component xor_4[4][32];
+
+    for(i=0; i<4; i++) // final key XOR
+    {
+        for(j=0; j<32; j++)
+        {
+            xor_4[i][j] = XOR();
+            xor_4[i][j].a <== s[i][j];
+            xor_4[i][j].b <== ks[(i+ks_index)*32+j];
+
+            s[i][j] = xor_4[i][j].out;
+        }
+    }
+
+    for(i=0; i<4; i++)
+    {
+        for(j=0; j<32; j++) out[i*32+j] <== s[i][j];
+    }
+}
+
+
diff --git a/circuits/aes-gcm/aes_128_enc_test.circom b/circuits/aes-gcm/aes_128_enc_test.circom
new file mode 100644
index 0000000..85c55b8
--- /dev/null
+++ b/circuits/aes-gcm/aes_128_enc_test.circom
@@ -0,0 +1,5 @@
+pragma circom 2.1.3;
+
+include "./aes_128_enc.circom";
+
+component main = AES128Encrypt();
\ No newline at end of file
diff --git a/circuits/aes-gcm/aes_emulation.circom b/circuits/aes-gcm/aes_emulation.circom
new file mode 100644
index 0000000..523561f
--- /dev/null
+++ b/circuits/aes-gcm/aes_emulation.circom
@@ -0,0 +1,44 @@
+// Copyright © 2022, Electron Labs
+pragma circom 2.0.0;
+
+include "aes_emulation_tables.circom";
+
+/// template or row shifting
+template EmulatedAesencRowShifting()
+{
+
+    /// Opperating on 16 bits at a time
+    signal input in[16];
+    signal output out[16];
+    
+    var byte_order[16];
+    byte_order[0]  = 0;
+    byte_order[1]  = 5;
+    byte_order[2]  = 10;
+    byte_order[3]  = 15;
+    byte_order[4]  = 4;
+    byte_order[5]  = 9;
+    byte_order[6]  = 14;
+    byte_order[7]  = 3;
+    byte_order[8]  = 8;
+    byte_order[9]  = 13;
+    byte_order[10] = 2;
+    byte_order[11] = 7;
+    byte_order[12] = 12;
+    byte_order[13] = 1;
+    byte_order[14] = 6;
+    byte_order[15] = 11;
+
+    for(var i=0; i<16; i++) out[i] <== in[byte_order[i]];
+}
+
+/// Template for S-Box using the aes_encoding_rijndael_sbox
+/// https://en.wikipedia.org/wiki/Rijndael_S-box
+template EmulatedAesencSubstituteBytes()
+{
+    signal input in[16];
+    signal output out[16];
+
+    for(var i=0; i<16; i++) out[i] <-- emulated_aesenc_rijndael_sbox(in[i]);
+    
+}
diff --git a/circuits/aes-gcm/aes_emulation_tables.circom b/circuits/aes-gcm/aes_emulation_tables.circom
new file mode 100644
index 0000000..c5dd399
--- /dev/null
+++ b/circuits/aes-gcm/aes_emulation_tables.circom
@@ -0,0 +1,190 @@
+// Copyright © 2022, Electron Labs
+pragma circom 2.0.0;
+
+function emulated_aesenc_enc_table(table_num, index)
+{
+    var lut[4][256];
+
+    lut[0] = [
+        0xa56363c6, 0x847c7cf8, 0x997777ee, 0x8d7b7bf6, 0x0df2f2ff, 0xbd6b6bd6, 0xb16f6fde, 0x54c5c591,
+        0x50303060, 0x03010102, 0xa96767ce, 0x7d2b2b56, 0x19fefee7, 0x62d7d7b5, 0xe6abab4d, 0x9a7676ec,
+        0x45caca8f, 0x9d82821f, 0x40c9c989, 0x877d7dfa, 0x15fafaef, 0xeb5959b2, 0xc947478e, 0x0bf0f0fb,
+        0xecadad41, 0x67d4d4b3, 0xfda2a25f, 0xeaafaf45, 0xbf9c9c23, 0xf7a4a453, 0x967272e4, 0x5bc0c09b,
+        0xc2b7b775, 0x1cfdfde1, 0xae93933d, 0x6a26264c, 0x5a36366c, 0x413f3f7e, 0x02f7f7f5, 0x4fcccc83,
+        0x5c343468, 0xf4a5a551, 0x34e5e5d1, 0x08f1f1f9, 0x937171e2, 0x73d8d8ab, 0x53313162, 0x3f15152a,
+        0x0c040408, 0x52c7c795, 0x65232346, 0x5ec3c39d, 0x28181830, 0xa1969637, 0x0f05050a, 0xb59a9a2f,
+        0x0907070e, 0x36121224, 0x9b80801b, 0x3de2e2df, 0x26ebebcd, 0x6927274e, 0xcdb2b27f, 0x9f7575ea,
+        0x1b090912, 0x9e83831d, 0x742c2c58, 0x2e1a1a34, 0x2d1b1b36, 0xb26e6edc, 0xee5a5ab4, 0xfba0a05b,
+        0xf65252a4, 0x4d3b3b76, 0x61d6d6b7, 0xceb3b37d, 0x7b292952, 0x3ee3e3dd, 0x712f2f5e, 0x97848413,
+        0xf55353a6, 0x68d1d1b9, 0x00000000, 0x2cededc1, 0x60202040, 0x1ffcfce3, 0xc8b1b179, 0xed5b5bb6,
+        0xbe6a6ad4, 0x46cbcb8d, 0xd9bebe67, 0x4b393972, 0xde4a4a94, 0xd44c4c98, 0xe85858b0, 0x4acfcf85,
+        0x6bd0d0bb, 0x2aefefc5, 0xe5aaaa4f, 0x16fbfbed, 0xc5434386, 0xd74d4d9a, 0x55333366, 0x94858511,
+        0xcf45458a, 0x10f9f9e9, 0x06020204, 0x817f7ffe, 0xf05050a0, 0x443c3c78, 0xba9f9f25, 0xe3a8a84b,
+        0xf35151a2, 0xfea3a35d, 0xc0404080, 0x8a8f8f05, 0xad92923f, 0xbc9d9d21, 0x48383870, 0x04f5f5f1,
+        0xdfbcbc63, 0xc1b6b677, 0x75dadaaf, 0x63212142, 0x30101020, 0x1affffe5, 0x0ef3f3fd, 0x6dd2d2bf,
+        0x4ccdcd81, 0x140c0c18, 0x35131326, 0x2fececc3, 0xe15f5fbe, 0xa2979735, 0xcc444488, 0x3917172e,
+        0x57c4c493, 0xf2a7a755, 0x827e7efc, 0x473d3d7a, 0xac6464c8, 0xe75d5dba, 0x2b191932, 0x957373e6,
+        0xa06060c0, 0x98818119, 0xd14f4f9e, 0x7fdcdca3, 0x66222244, 0x7e2a2a54, 0xab90903b, 0x8388880b,
+        0xca46468c, 0x29eeeec7, 0xd3b8b86b, 0x3c141428, 0x79dedea7, 0xe25e5ebc, 0x1d0b0b16, 0x76dbdbad,
+        0x3be0e0db, 0x56323264, 0x4e3a3a74, 0x1e0a0a14, 0xdb494992, 0x0a06060c, 0x6c242448, 0xe45c5cb8,
+        0x5dc2c29f, 0x6ed3d3bd, 0xefacac43, 0xa66262c4, 0xa8919139, 0xa4959531, 0x37e4e4d3, 0x8b7979f2,
+        0x32e7e7d5, 0x43c8c88b, 0x5937376e, 0xb76d6dda, 0x8c8d8d01, 0x64d5d5b1, 0xd24e4e9c, 0xe0a9a949,
+        0xb46c6cd8, 0xfa5656ac, 0x07f4f4f3, 0x25eaeacf, 0xaf6565ca, 0x8e7a7af4, 0xe9aeae47, 0x18080810,
+        0xd5baba6f, 0x887878f0, 0x6f25254a, 0x722e2e5c, 0x241c1c38, 0xf1a6a657, 0xc7b4b473, 0x51c6c697,
+        0x23e8e8cb, 0x7cdddda1, 0x9c7474e8, 0x211f1f3e, 0xdd4b4b96, 0xdcbdbd61, 0x868b8b0d, 0x858a8a0f,
+        0x907070e0, 0x423e3e7c, 0xc4b5b571, 0xaa6666cc, 0xd8484890, 0x05030306, 0x01f6f6f7, 0x120e0e1c,
+        0xa36161c2, 0x5f35356a, 0xf95757ae, 0xd0b9b969, 0x91868617, 0x58c1c199, 0x271d1d3a, 0xb99e9e27,
+        0x38e1e1d9, 0x13f8f8eb, 0xb398982b, 0x33111122, 0xbb6969d2, 0x70d9d9a9, 0x898e8e07, 0xa7949433,
+        0xb69b9b2d, 0x221e1e3c, 0x92878715, 0x20e9e9c9, 0x49cece87, 0xff5555aa, 0x78282850, 0x7adfdfa5,
+        0x8f8c8c03, 0xf8a1a159, 0x80898909, 0x170d0d1a, 0xdabfbf65, 0x31e6e6d7, 0xc6424284, 0xb86868d0,
+        0xc3414182, 0xb0999929, 0x772d2d5a, 0x110f0f1e, 0xcbb0b07b, 0xfc5454a8, 0xd6bbbb6d, 0x3a16162c
+        ];
+
+    lut[1] = [
+        0x6363c6a5, 0x7c7cf884, 0x7777ee99, 0x7b7bf68d, 0xf2f2ff0d, 0x6b6bd6bd, 0x6f6fdeb1, 0xc5c59154,
+        0x30306050, 0x01010203, 0x6767cea9, 0x2b2b567d, 0xfefee719, 0xd7d7b562, 0xabab4de6, 0x7676ec9a,
+        0xcaca8f45, 0x82821f9d, 0xc9c98940, 0x7d7dfa87, 0xfafaef15, 0x5959b2eb, 0x47478ec9, 0xf0f0fb0b,
+        0xadad41ec, 0xd4d4b367, 0xa2a25ffd, 0xafaf45ea, 0x9c9c23bf, 0xa4a453f7, 0x7272e496, 0xc0c09b5b,
+        0xb7b775c2, 0xfdfde11c, 0x93933dae, 0x26264c6a, 0x36366c5a, 0x3f3f7e41, 0xf7f7f502, 0xcccc834f,
+        0x3434685c, 0xa5a551f4, 0xe5e5d134, 0xf1f1f908, 0x7171e293, 0xd8d8ab73, 0x31316253, 0x15152a3f,
+        0x0404080c, 0xc7c79552, 0x23234665, 0xc3c39d5e, 0x18183028, 0x969637a1, 0x05050a0f, 0x9a9a2fb5,
+        0x07070e09, 0x12122436, 0x80801b9b, 0xe2e2df3d, 0xebebcd26, 0x27274e69, 0xb2b27fcd, 0x7575ea9f,
+        0x0909121b, 0x83831d9e, 0x2c2c5874, 0x1a1a342e, 0x1b1b362d, 0x6e6edcb2, 0x5a5ab4ee, 0xa0a05bfb,
+        0x5252a4f6, 0x3b3b764d, 0xd6d6b761, 0xb3b37dce, 0x2929527b, 0xe3e3dd3e, 0x2f2f5e71, 0x84841397,
+        0x5353a6f5, 0xd1d1b968, 0x00000000, 0xededc12c, 0x20204060, 0xfcfce31f, 0xb1b179c8, 0x5b5bb6ed,
+        0x6a6ad4be, 0xcbcb8d46, 0xbebe67d9, 0x3939724b, 0x4a4a94de, 0x4c4c98d4, 0x5858b0e8, 0xcfcf854a,
+        0xd0d0bb6b, 0xefefc52a, 0xaaaa4fe5, 0xfbfbed16, 0x434386c5, 0x4d4d9ad7, 0x33336655, 0x85851194,
+        0x45458acf, 0xf9f9e910, 0x02020406, 0x7f7ffe81, 0x5050a0f0, 0x3c3c7844, 0x9f9f25ba, 0xa8a84be3,
+        0x5151a2f3, 0xa3a35dfe, 0x404080c0, 0x8f8f058a, 0x92923fad, 0x9d9d21bc, 0x38387048, 0xf5f5f104,
+        0xbcbc63df, 0xb6b677c1, 0xdadaaf75, 0x21214263, 0x10102030, 0xffffe51a, 0xf3f3fd0e, 0xd2d2bf6d,
+        0xcdcd814c, 0x0c0c1814, 0x13132635, 0xececc32f, 0x5f5fbee1, 0x979735a2, 0x444488cc, 0x17172e39,
+        0xc4c49357, 0xa7a755f2, 0x7e7efc82, 0x3d3d7a47, 0x6464c8ac, 0x5d5dbae7, 0x1919322b, 0x7373e695,
+        0x6060c0a0, 0x81811998, 0x4f4f9ed1, 0xdcdca37f, 0x22224466, 0x2a2a547e, 0x90903bab, 0x88880b83,
+        0x46468cca, 0xeeeec729, 0xb8b86bd3, 0x1414283c, 0xdedea779, 0x5e5ebce2, 0x0b0b161d, 0xdbdbad76,
+        0xe0e0db3b, 0x32326456, 0x3a3a744e, 0x0a0a141e, 0x494992db, 0x06060c0a, 0x2424486c, 0x5c5cb8e4,
+        0xc2c29f5d, 0xd3d3bd6e, 0xacac43ef, 0x6262c4a6, 0x919139a8, 0x959531a4, 0xe4e4d337, 0x7979f28b,
+        0xe7e7d532, 0xc8c88b43, 0x37376e59, 0x6d6ddab7, 0x8d8d018c, 0xd5d5b164, 0x4e4e9cd2, 0xa9a949e0,
+        0x6c6cd8b4, 0x5656acfa, 0xf4f4f307, 0xeaeacf25, 0x6565caaf, 0x7a7af48e, 0xaeae47e9, 0x08081018,
+        0xbaba6fd5, 0x7878f088, 0x25254a6f, 0x2e2e5c72, 0x1c1c3824, 0xa6a657f1, 0xb4b473c7, 0xc6c69751,
+        0xe8e8cb23, 0xdddda17c, 0x7474e89c, 0x1f1f3e21, 0x4b4b96dd, 0xbdbd61dc, 0x8b8b0d86, 0x8a8a0f85,
+        0x7070e090, 0x3e3e7c42, 0xb5b571c4, 0x6666ccaa, 0x484890d8, 0x03030605, 0xf6f6f701, 0x0e0e1c12,
+        0x6161c2a3, 0x35356a5f, 0x5757aef9, 0xb9b969d0, 0x86861791, 0xc1c19958, 0x1d1d3a27, 0x9e9e27b9,
+        0xe1e1d938, 0xf8f8eb13, 0x98982bb3, 0x11112233, 0x6969d2bb, 0xd9d9a970, 0x8e8e0789, 0x949433a7,
+        0x9b9b2db6, 0x1e1e3c22, 0x87871592, 0xe9e9c920, 0xcece8749, 0x5555aaff, 0x28285078, 0xdfdfa57a,
+        0x8c8c038f, 0xa1a159f8, 0x89890980, 0x0d0d1a17, 0xbfbf65da, 0xe6e6d731, 0x424284c6, 0x6868d0b8,
+        0x414182c3, 0x999929b0, 0x2d2d5a77, 0x0f0f1e11, 0xb0b07bcb, 0x5454a8fc, 0xbbbb6dd6, 0x16162c3a
+        ];
+
+    lut[2] = [
+        0x63c6a563, 0x7cf8847c, 0x77ee9977, 0x7bf68d7b, 0xf2ff0df2, 0x6bd6bd6b, 0x6fdeb16f, 0xc59154c5,
+        0x30605030, 0x01020301, 0x67cea967, 0x2b567d2b, 0xfee719fe, 0xd7b562d7, 0xab4de6ab, 0x76ec9a76,
+        0xca8f45ca, 0x821f9d82, 0xc98940c9, 0x7dfa877d, 0xfaef15fa, 0x59b2eb59, 0x478ec947, 0xf0fb0bf0,
+        0xad41ecad, 0xd4b367d4, 0xa25ffda2, 0xaf45eaaf, 0x9c23bf9c, 0xa453f7a4, 0x72e49672, 0xc09b5bc0,
+        0xb775c2b7, 0xfde11cfd, 0x933dae93, 0x264c6a26, 0x366c5a36, 0x3f7e413f, 0xf7f502f7, 0xcc834fcc,
+        0x34685c34, 0xa551f4a5, 0xe5d134e5, 0xf1f908f1, 0x71e29371, 0xd8ab73d8, 0x31625331, 0x152a3f15,
+        0x04080c04, 0xc79552c7, 0x23466523, 0xc39d5ec3, 0x18302818, 0x9637a196, 0x050a0f05, 0x9a2fb59a,
+        0x070e0907, 0x12243612, 0x801b9b80, 0xe2df3de2, 0xebcd26eb, 0x274e6927, 0xb27fcdb2, 0x75ea9f75,
+        0x09121b09, 0x831d9e83, 0x2c58742c, 0x1a342e1a, 0x1b362d1b, 0x6edcb26e, 0x5ab4ee5a, 0xa05bfba0,
+        0x52a4f652, 0x3b764d3b, 0xd6b761d6, 0xb37dceb3, 0x29527b29, 0xe3dd3ee3, 0x2f5e712f, 0x84139784,
+        0x53a6f553, 0xd1b968d1, 0x00000000, 0xedc12ced, 0x20406020, 0xfce31ffc, 0xb179c8b1, 0x5bb6ed5b,
+        0x6ad4be6a, 0xcb8d46cb, 0xbe67d9be, 0x39724b39, 0x4a94de4a, 0x4c98d44c, 0x58b0e858, 0xcf854acf,
+        0xd0bb6bd0, 0xefc52aef, 0xaa4fe5aa, 0xfbed16fb, 0x4386c543, 0x4d9ad74d, 0x33665533, 0x85119485,
+        0x458acf45, 0xf9e910f9, 0x02040602, 0x7ffe817f, 0x50a0f050, 0x3c78443c, 0x9f25ba9f, 0xa84be3a8,
+        0x51a2f351, 0xa35dfea3, 0x4080c040, 0x8f058a8f, 0x923fad92, 0x9d21bc9d, 0x38704838, 0xf5f104f5,
+        0xbc63dfbc, 0xb677c1b6, 0xdaaf75da, 0x21426321, 0x10203010, 0xffe51aff, 0xf3fd0ef3, 0xd2bf6dd2,
+        0xcd814ccd, 0x0c18140c, 0x13263513, 0xecc32fec, 0x5fbee15f, 0x9735a297, 0x4488cc44, 0x172e3917,
+        0xc49357c4, 0xa755f2a7, 0x7efc827e, 0x3d7a473d, 0x64c8ac64, 0x5dbae75d, 0x19322b19, 0x73e69573,
+        0x60c0a060, 0x81199881, 0x4f9ed14f, 0xdca37fdc, 0x22446622, 0x2a547e2a, 0x903bab90, 0x880b8388,
+        0x468cca46, 0xeec729ee, 0xb86bd3b8, 0x14283c14, 0xdea779de, 0x5ebce25e, 0x0b161d0b, 0xdbad76db,
+        0xe0db3be0, 0x32645632, 0x3a744e3a, 0x0a141e0a, 0x4992db49, 0x060c0a06, 0x24486c24, 0x5cb8e45c,
+        0xc29f5dc2, 0xd3bd6ed3, 0xac43efac, 0x62c4a662, 0x9139a891, 0x9531a495, 0xe4d337e4, 0x79f28b79,
+        0xe7d532e7, 0xc88b43c8, 0x376e5937, 0x6ddab76d, 0x8d018c8d, 0xd5b164d5, 0x4e9cd24e, 0xa949e0a9,
+        0x6cd8b46c, 0x56acfa56, 0xf4f307f4, 0xeacf25ea, 0x65caaf65, 0x7af48e7a, 0xae47e9ae, 0x08101808,
+        0xba6fd5ba, 0x78f08878, 0x254a6f25, 0x2e5c722e, 0x1c38241c, 0xa657f1a6, 0xb473c7b4, 0xc69751c6,
+        0xe8cb23e8, 0xdda17cdd, 0x74e89c74, 0x1f3e211f, 0x4b96dd4b, 0xbd61dcbd, 0x8b0d868b, 0x8a0f858a,
+        0x70e09070, 0x3e7c423e, 0xb571c4b5, 0x66ccaa66, 0x4890d848, 0x03060503, 0xf6f701f6, 0x0e1c120e,
+        0x61c2a361, 0x356a5f35, 0x57aef957, 0xb969d0b9, 0x86179186, 0xc19958c1, 0x1d3a271d, 0x9e27b99e,
+        0xe1d938e1, 0xf8eb13f8, 0x982bb398, 0x11223311, 0x69d2bb69, 0xd9a970d9, 0x8e07898e, 0x9433a794,
+        0x9b2db69b, 0x1e3c221e, 0x87159287, 0xe9c920e9, 0xce8749ce, 0x55aaff55, 0x28507828, 0xdfa57adf,
+        0x8c038f8c, 0xa159f8a1, 0x89098089, 0x0d1a170d, 0xbf65dabf, 0xe6d731e6, 0x4284c642, 0x68d0b868,
+        0x4182c341, 0x9929b099, 0x2d5a772d, 0x0f1e110f, 0xb07bcbb0, 0x54a8fc54, 0xbb6dd6bb, 0x162c3a16
+        ];
+
+    lut[3] = [
+        0xc6a56363, 0xf8847c7c, 0xee997777, 0xf68d7b7b, 0xff0df2f2, 0xd6bd6b6b, 0xdeb16f6f, 0x9154c5c5,
+        0x60503030, 0x02030101, 0xcea96767, 0x567d2b2b, 0xe719fefe, 0xb562d7d7, 0x4de6abab, 0xec9a7676,
+        0x8f45caca, 0x1f9d8282, 0x8940c9c9, 0xfa877d7d, 0xef15fafa, 0xb2eb5959, 0x8ec94747, 0xfb0bf0f0,
+        0x41ecadad, 0xb367d4d4, 0x5ffda2a2, 0x45eaafaf, 0x23bf9c9c, 0x53f7a4a4, 0xe4967272, 0x9b5bc0c0,
+        0x75c2b7b7, 0xe11cfdfd, 0x3dae9393, 0x4c6a2626, 0x6c5a3636, 0x7e413f3f, 0xf502f7f7, 0x834fcccc,
+        0x685c3434, 0x51f4a5a5, 0xd134e5e5, 0xf908f1f1, 0xe2937171, 0xab73d8d8, 0x62533131, 0x2a3f1515,
+        0x080c0404, 0x9552c7c7, 0x46652323, 0x9d5ec3c3, 0x30281818, 0x37a19696, 0x0a0f0505, 0x2fb59a9a,
+        0x0e090707, 0x24361212, 0x1b9b8080, 0xdf3de2e2, 0xcd26ebeb, 0x4e692727, 0x7fcdb2b2, 0xea9f7575,
+        0x121b0909, 0x1d9e8383, 0x58742c2c, 0x342e1a1a, 0x362d1b1b, 0xdcb26e6e, 0xb4ee5a5a, 0x5bfba0a0,
+        0xa4f65252, 0x764d3b3b, 0xb761d6d6, 0x7dceb3b3, 0x527b2929, 0xdd3ee3e3, 0x5e712f2f, 0x13978484,
+        0xa6f55353, 0xb968d1d1, 0x00000000, 0xc12ceded, 0x40602020, 0xe31ffcfc, 0x79c8b1b1, 0xb6ed5b5b,
+        0xd4be6a6a, 0x8d46cbcb, 0x67d9bebe, 0x724b3939, 0x94de4a4a, 0x98d44c4c, 0xb0e85858, 0x854acfcf,
+        0xbb6bd0d0, 0xc52aefef, 0x4fe5aaaa, 0xed16fbfb, 0x86c54343, 0x9ad74d4d, 0x66553333, 0x11948585,
+        0x8acf4545, 0xe910f9f9, 0x04060202, 0xfe817f7f, 0xa0f05050, 0x78443c3c, 0x25ba9f9f, 0x4be3a8a8,
+        0xa2f35151, 0x5dfea3a3, 0x80c04040, 0x058a8f8f, 0x3fad9292, 0x21bc9d9d, 0x70483838, 0xf104f5f5,
+        0x63dfbcbc, 0x77c1b6b6, 0xaf75dada, 0x42632121, 0x20301010, 0xe51affff, 0xfd0ef3f3, 0xbf6dd2d2,
+        0x814ccdcd, 0x18140c0c, 0x26351313, 0xc32fecec, 0xbee15f5f, 0x35a29797, 0x88cc4444, 0x2e391717,
+        0x9357c4c4, 0x55f2a7a7, 0xfc827e7e, 0x7a473d3d, 0xc8ac6464, 0xbae75d5d, 0x322b1919, 0xe6957373,
+        0xc0a06060, 0x19988181, 0x9ed14f4f, 0xa37fdcdc, 0x44662222, 0x547e2a2a, 0x3bab9090, 0x0b838888,
+        0x8cca4646, 0xc729eeee, 0x6bd3b8b8, 0x283c1414, 0xa779dede, 0xbce25e5e, 0x161d0b0b, 0xad76dbdb,
+        0xdb3be0e0, 0x64563232, 0x744e3a3a, 0x141e0a0a, 0x92db4949, 0x0c0a0606, 0x486c2424, 0xb8e45c5c,
+        0x9f5dc2c2, 0xbd6ed3d3, 0x43efacac, 0xc4a66262, 0x39a89191, 0x31a49595, 0xd337e4e4, 0xf28b7979,
+        0xd532e7e7, 0x8b43c8c8, 0x6e593737, 0xdab76d6d, 0x018c8d8d, 0xb164d5d5, 0x9cd24e4e, 0x49e0a9a9,
+        0xd8b46c6c, 0xacfa5656, 0xf307f4f4, 0xcf25eaea, 0xcaaf6565, 0xf48e7a7a, 0x47e9aeae, 0x10180808,
+        0x6fd5baba, 0xf0887878, 0x4a6f2525, 0x5c722e2e, 0x38241c1c, 0x57f1a6a6, 0x73c7b4b4, 0x9751c6c6,
+        0xcb23e8e8, 0xa17cdddd, 0xe89c7474, 0x3e211f1f, 0x96dd4b4b, 0x61dcbdbd, 0x0d868b8b, 0x0f858a8a,
+        0xe0907070, 0x7c423e3e, 0x71c4b5b5, 0xccaa6666, 0x90d84848, 0x06050303, 0xf701f6f6, 0x1c120e0e,
+        0xc2a36161, 0x6a5f3535, 0xaef95757, 0x69d0b9b9, 0x17918686, 0x9958c1c1, 0x3a271d1d, 0x27b99e9e,
+        0xd938e1e1, 0xeb13f8f8, 0x2bb39898, 0x22331111, 0xd2bb6969, 0xa970d9d9, 0x07898e8e, 0x33a79494,
+        0x2db69b9b, 0x3c221e1e, 0x15928787, 0xc920e9e9, 0x8749cece, 0xaaff5555, 0x50782828, 0xa57adfdf,
+        0x038f8c8c, 0x59f8a1a1, 0x09808989, 0x1a170d0d, 0x65dabfbf, 0xd731e6e6, 0x84c64242, 0xd0b86868,
+        0x82c34141, 0x29b09999, 0x5a772d2d, 0x1e110f0f, 0x7bcbb0b0, 0xa8fc5454, 0x6dd6bbbb, 0x2c3a1616
+        ];
+
+    return lut[table_num][index];
+}
+
+function emulated_aesenc_rijndael_sbox(in)
+{
+    var lut[256] = [
+        0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
+        0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
+        0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0,
+        0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
+        0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc,
+        0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15,
+        0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a,
+        0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75,
+        0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0,
+        0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84,
+        0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b,
+        0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf,
+        0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85,
+        0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8,
+        0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5,
+        0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2,
+        0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17,
+        0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73,
+        0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88,
+        0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb,
+        0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c,
+        0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79,
+        0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9,
+        0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08,
+        0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6,
+        0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a,
+        0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e,
+        0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e,
+        0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94,
+        0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
+        0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68,
+        0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16
+        ];
+
+    return lut[in];
+}
+
diff --git a/circuits/aes-gcm/helper_functions.circom b/circuits/aes-gcm/helper_functions.circom
new file mode 100644
index 0000000..d53b28b
--- /dev/null
+++ b/circuits/aes-gcm/helper_functions.circom
@@ -0,0 +1,251 @@
+// Copyright © 2022, Electron Labs
+pragma circom 2.0.0;
+
+include "../lib_circuits/bitify.circom";
+include "../lib_circuits/gates.circom";
+include "../lib_circuits/comparators.circom";
+
+template BitwiseRightShift(n, r) {
+    signal input in[n];
+    signal output out[n];
+
+    for(var i=0; i<n; i++){
+        if(i+r>=n){
+            out[i] <== 0;
+        } else {
+            out[i] <== in[i+r];
+        }
+    }
+}
+
+template IntRightShift(n, x)
+{	
+    signal input in;
+    signal output out;
+    
+    component num2bits = Num2Bits(n);
+    num2bits.in <== in;
+
+    component bits2num = Bits2Num(n);
+    var i;
+    for(i=0; i<n; i++)
+    {
+        if(i+x<n) bits2num.in[i] <== num2bits.out[i+x];
+        else bits2num.in[i] <== 0;
+    } 
+    out <== bits2num.out;
+}
+
+template BitwiseLeftShift(n, r) {
+    signal input in[n];
+    signal output out[n];
+    var j=0;
+    for (var i=0; i<n; i++) {
+        if (i < r) {
+            out[i] <== 0;
+        } else {
+            out[i] <== in[j];
+            j++;
+        }
+    }
+}
+
+template IntLeftShift(n, x)
+{	
+    signal input in;
+    signal output out;
+    
+    component num2bits = Num2Bits(n);
+    num2bits.in <== in;
+
+    component bits2num = Bits2Num(n);
+    for(var i=0; i<n; i++)
+    {
+        if(i<x) bits2num.in[i] <== 0;
+        else bits2num.in[i] <== num2bits.out[i-x];
+    }
+    out <== bits2num.out;
+}
+
+template BitwiseXor(n) {
+    signal input a[n];
+    signal input b[n];
+    signal output out[n];
+    signal mid[n];
+
+    for (var k=0; k<n; k++) {
+        mid[k] <== a[k]*b[k];
+        out[k] <== a[k] + b[k] - 2*mid[k];
+    }
+}
+
+template IntXor(n)
+{
+    signal input a;
+    signal input b;
+
+    signal output out;
+
+    component num2bits[2];
+    num2bits[0] = Num2Bits(n);
+    num2bits[1] = Num2Bits(n);
+
+    num2bits[0].in <== a;
+    num2bits[1].in <== b;
+    
+    component xor[n];
+    for(var i=0; i<n; i++) xor[i] = XOR();
+
+    component bits2num = Bits2Num(n);
+    for(var i=0; i<n; i++)
+    {
+        xor[i].a <== num2bits[0].out[i];
+        xor[i].b <== num2bits[1].out[i];
+
+        bits2num.in[i] <== xor[i].out;
+    }
+
+    out <== bits2num.out;
+}
+
+template BitwiseAnd(n) {
+    signal input a[n];
+    signal input b[n];
+    signal output out[n];
+
+    for (var k=0; k<n; k++) {
+        out[k] <== a[k]*b[k];
+    }
+}
+
+template IntAnd(n)
+{
+    signal input a;
+    signal input b;
+
+    signal output out;
+
+    component num2bits[2];
+    num2bits[0] = Num2Bits(n);
+    num2bits[1] = Num2Bits(n);
+
+    num2bits[0].in <== a;
+    num2bits[1].in <== b;
+    component and[n];
+    for(var i=0; i<n; i++) and[i] = AND();
+
+    component bits2num = Bits2Num(n);
+    for(var i=0; i<n; i++)
+    {
+        and[i].a <== num2bits[0].out[i];
+        and[i].b <== num2bits[1].out[i];
+        bits2num.in[i] <== and[i].out;
+    }
+
+    out <== bits2num.out;
+}
+
+template IntOr(n)
+{
+    signal input a;
+    signal input b;
+
+    signal output out;
+
+    component num2bits[2];
+    num2bits[0] = Num2Bits(n);
+    num2bits[1] = Num2Bits(n);
+
+    num2bits[0].in <== a;
+    num2bits[1].in <== b;
+    component or[n];
+    for(var i=0; i<n; i++) or[i] = OR();
+
+    component bits2num = Bits2Num(n);
+    for(var i=0; i<n; i++)
+    {
+        or[i].a <== num2bits[0].out[i];
+        or[i].b <== num2bits[1].out[i];
+        bits2num.in[i] <== or[i].out;
+    }
+
+    out <== bits2num.out;
+}
+
+template Typecast(in_size, in_bits, out_bits)
+{
+
+    var out_size = (in_size*in_bits)/out_bits;
+    signal input in[in_size];
+    signal output out[out_size];
+
+    var i, j, k;
+
+    component num2bits[in_size];
+    for(i=0; i<in_size; i++) num2bits[i] = Num2Bits(in_bits);
+
+    component bits2num[out_size];
+    for(i=0; i<out_size; i++) bits2num[i] = Bits2Num(out_bits);
+
+    if(in_bits > out_bits)
+    {
+        var ratio = in_bits/out_bits;
+        for(i=0; i<in_size; i++)
+        {
+            num2bits[i].in <== in[i];
+            for(j=0; j<ratio; j++){
+                var index = i*ratio + j;
+                for(k=0; k<out_bits; k++) bits2num[index].in[k] <== num2bits[i].out[j*out_bits+k];
+                out[index] <== bits2num[index].out;
+            }
+        }
+    }
+    else if(out_bits > in_bits)
+    {
+        var ratio = out_bits/in_bits;
+        for(i=0; i<out_size; i++)
+        {
+            for(j=0; j<ratio; j++)
+            {
+                var index = i*ratio + j;
+                num2bits[index].in <== in[index];
+                for(k=0; k<in_bits; k++) bits2num[i].in[j*in_bits+k] <== num2bits[index].out[k];
+            }
+            out[i] <== bits2num[i].out;
+        }
+    }
+}
+
+template SumMultiple(n) {
+    signal input nums[n];
+    signal output sum;
+
+    signal sums[n];
+    sums[0] <== nums[0];
+
+    for(var i=1; i<n; i++) {
+        sums[i] <== sums[i-1] + nums[i];
+    }
+
+    sum <== sums[n-1];
+}
+
+template IndexSelector(total) {
+    signal input in[total];
+    signal input index;
+    signal output out;
+
+    //maybe add (index<total) check later when we decide number of bits
+
+    component calcTotal = SumMultiple(total);
+    component equality[total];
+
+    for(var i=0; i<total; i++){
+        equality[i] = IsEqual();
+        equality[i].in[0] <== i;
+        equality[i].in[1] <== index;
+        calcTotal.nums[i] <== equality[i].out * in[i];
+    }
+
+    out <== calcTotal.sum;
+}
diff --git a/circuits/aes/lib_circuits/aliascheck.circom b/circuits/lib_circuits/aliascheck.circom
similarity index 100%
rename from circuits/aes/lib_circuits/aliascheck.circom
rename to circuits/lib_circuits/aliascheck.circom
diff --git a/circuits/aes/lib_circuits/binsum.circom b/circuits/lib_circuits/binsum.circom
similarity index 100%
rename from circuits/aes/lib_circuits/binsum.circom
rename to circuits/lib_circuits/binsum.circom
diff --git a/circuits/aes/lib_circuits/bitify.circom b/circuits/lib_circuits/bitify.circom
similarity index 100%
rename from circuits/aes/lib_circuits/bitify.circom
rename to circuits/lib_circuits/bitify.circom
diff --git a/circuits/aes/lib_circuits/comparators.circom b/circuits/lib_circuits/comparators.circom
similarity index 100%
rename from circuits/aes/lib_circuits/comparators.circom
rename to circuits/lib_circuits/comparators.circom
diff --git a/circuits/aes/lib_circuits/compconstant.circom b/circuits/lib_circuits/compconstant.circom
similarity index 100%
rename from circuits/aes/lib_circuits/compconstant.circom
rename to circuits/lib_circuits/compconstant.circom
diff --git a/circuits/aes/lib_circuits/gates.circom b/circuits/lib_circuits/gates.circom
similarity index 100%
rename from circuits/aes/lib_circuits/gates.circom
rename to circuits/lib_circuits/gates.circom
diff --git a/circuits/aes/lib_circuits/mux1.circom b/circuits/lib_circuits/mux1.circom
similarity index 100%
rename from circuits/aes/lib_circuits/mux1.circom
rename to circuits/lib_circuits/mux1.circom
diff --git a/circuits/aes/lib_circuits/sha256.circom b/circuits/lib_circuits/sha256.circom
similarity index 100%
rename from circuits/aes/lib_circuits/sha256.circom
rename to circuits/lib_circuits/sha256.circom