AES算法

最新推荐文章于 2021-04-07 12:23:47 发布
亭台六七座
最新推荐文章于 2021-04-07 12:23:47 发布
阅读量680
点赞数
分类专栏：算法文章标签： AES算法
算法专栏收录该内容
14 篇文章
订阅专栏
[cpp]view plaincopy 
   
 # include <iostream>  
 # include<stdio.h>  
 # include<string.h>  
 using namespace std;  
   
 int sBox[] ={  
 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  
 };  
   
 int Rcon[4][4] = { {0x02, 0x03, 0x01, 0x01},  
                    {0x01, 0x02, 0x03, 0x01},  
                    {0x01, 0x01, 0x02, 0x03},  
                    {0x03, 0x01, 0x01, 0x02}  
 };  
   
 int w[11][5][5];  
 int state[5][5];  
   
 void KeyExpansion(int key[4][4]) // 秘钥扩展  
 {  
     int rc[] = {0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36};  
     for(int i = 0; i < 4; i ++)  
         for(int j = 0; j < 4; j ++)  
             w[0][i][j] = key[i][j];  
     for(int i = 1; i <= 10; i ++)    //求10轮秘钥  
     {  
         for(int j = 0; j < 4; j ++)  
         {  
             int t[4];  
             if(j != 0)  
             {  
                 for(int r = 0; r < 4; r ++)  
                     t[r] = w[i][r][j - 1];  
             }  
             else  
             {  
                  for(int r = 0; r < 4; r ++)  
                     t[r] = w[i - 1][r][3];  
                  int temp = t[1];  
                  for(int r = 1; r < 4; r ++)  
                     t[r] = sBox[t[(r + 1) % 4]];  
                  t[0] = sBox[temp] ^ rc[i - 1];  
             }  
             for(int r=0; r<4; r++)  
                 w[i][r][j] = w[i-1][r][j] ^ t[r];  
         }  
     }  
 }  
   
 void ByteSub()   //字节代换  
 {  
     for(int i = 0; i < 4; i ++)  
         for(int j = 0; j < 4; j ++)  
             state[i][j] = sBox[state[i][j]];  
 }  
   
 void ShiftRow()   //行移位  
 {  
     int t[4][4];  
     for(int i = 0; i < 4; i ++)  
         for(int j = 0; j < 4; j ++)  
             t[i][j] = state[i][j];  
     for(int i = 0; i < 4; i ++)  
     {  
         int k = 0;  
         for(int j = i; j < 4; j ++)  
             state[i][k ++] = t[i][j];  
         for(int j = 0; j < i; j ++)  
             state[i][k ++] = t[i][j];  
     }  
 }  
   
 int FFmul(int a, int b)  //计算多项式  
 {  
     int bw[4];  
     int res=0;  
     bw[0] = b;  
     for(int i=1; i<4; i++)  
     {  
         bw[i] = bw[i-1]<<1;  
         if(bw[i-1]&0x80)  
         {  
             bw[i]^=0x1b;  
         }  
     }  
     for(int i=0; i<4; i++)  
     {  
         if((a>>i)&0x01)  
         {  
             res ^= bw[i];  
         }  
     }  
     return res;  
 }  
   
 void MixColumn()     //列混合  
 {  
     int t[4];  
     for(int c=0; c< 4; c++)  
     {  
         for(int r=0; r<4; r++)  
         {  
             t[r] = state[r][c];  
         }  
         for(int r=0; r<4; r++)  
         {  
             state[r][c] = FFmul(0x02, t[r])  
                         ^ FFmul(0x03, t[(r+1)%4])  
                         ^ FFmul(0x01, t[(r+2)%4])  
                         ^ FFmul(0x01, t[(r+3)%4]);  
         }  
     }  
     for(int i = 0; i < 4; i ++)        //保证都小于256  
         for(int j = 0; j < 4; j ++)  
             state[i][j] = state[i][j] % 256;  
 }  
   
 void AddRoundKey(int t)    //轮秘钥加  
 {  
     for(int i = 0; i < 4; i ++)  
         for(int j = 0; j < 4; j ++)  
             state[i][j] = state[i][j] ^ w[t][i][j];   //状态与轮秘钥抑或  
 }  
   
 int main()  
 {  
     int key[4][4];  
     while(1)  
     {  
         printf("输入明文：\n");  
         int j = 0, k = 0;  
         for(int i = 0; i < 16; i ++)   //输入十六进制密文  
         {  
             scanf("%x", &state[j ++][k]);  
             if(j == 4)  
             {  
                 j = 0;  
                 k ++;  
             }  
         }  
   
         j = 0, k = 0;  
         printf("输入秘钥：\n");  
         for(int i = 0; i < 16; i ++)    //输入十六进制秘钥  
         {  
             scanf("%x", &key[j ++][k]);  
             if(j == 4)  
             {  
                 j = 0;  
                 k ++;  
             }  
         }  
   
         KeyExpansion(key);      //秘钥扩展  
         AddRoundKey(0);         //第一轮之前的秘钥加  
   
         for(int i = 0; i < 9; i ++)   //9轮状态转换  
         {  
             ByteSub();     //字节代换  
             ShiftRow();    //行移位  
             MixColumn();   //列混合  
             AddRoundKey(i + 1);    //第i+1轮秘钥加  
         }  
   
         //最后一轮加密  
         ByteSub();     //字节代换  
         ShiftRow();    //行移位  
         AddRoundKey(10);    //第10轮秘钥加  
   
         printf("加密后密文为：\n");  
         for(int i = 0; i < 4; i ++)     //输出最后加密后的密文  
             for(int j = 0; j < 4; j ++)  
             {  
                 if(state[j][i] < 16) printf("0");  
                 printf("%x ", state[j][i]);  
             }  
         puts("");  
   
     }  
     return 0;  
 }  