⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 aes.cpp

📁 AES算法的实现
💻 CPP
字号:
// AES.cpp : 定义控制台应用程序的入口点。
//

#include<iostream>
using namespace std;
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define N_ROUND 11
#define NK 4
#define NB 4
#define NR 10

typedef struct { 
   int *base; 
   int *top; 
   int stacksize; 
}SqStack; 

SqStack S; 

void InitStack(SqStack &S1) 
{ 
   S1.base=(int *)malloc( STACK_INIT_SIZE * sizeof(int)); 
   S1.top=S1.base; 
   S1.stacksize=STACK_INIT_SIZE; 
} 

void Push(SqStack &S2,int e) 
{ 
   *S2.top++=e;
} 

void Pop(SqStack &S3,int &e) 
{ 
   e=*--S3.top;
} 

void tentosixteen(int a[4][4],string b[4][4]) 
{   InitStack(S);
    cout<<"转成的十六进制数是:"<<endl; 
	int i,j;
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
			if(a[i][j]==0) 
				Push(S,0);
            while(a[i][j]) 
            { 
               Push(S,a[i][j]%16); 
               a[i][j]=a[i][j]/16; 
            } 
while(S.top!=S.base) 
{ 
   int e; 
   Pop(S,e); 
   switch(e) 
   { 
     case 0: 
		  b[i][j].append("0");
		      break;
	 case 1: 
		  b[i][j].append("1");
		      break;
	 case 2: 
		  b[i][j].append("2");
		      break;
	 case 3: 
		  b[i][j].append("3");
		      break;
	 case 4: 
		  b[i][j].append("4");
		      break;
	 case 5:  
		  b[i][j].append("5");
		      break;
	 case 6:  
		  b[i][j].append("6");
		      break;
	 case 7:  
		  b[i][j].append("7");
		      break;
	 case 8:  
		  b[i][j].append("8");
		      break;
	 case 9:  
		  b[i][j].append("9");
		      break;
     case 10: 
		  b[i][j].append("a");
              break; 
     case 11: 
		  b[i][j].append("b");
              break; 
     case 12: 
		  b[i][j].append("c");
              break; 
     case 13: 
		  b[i][j].append("d");
              break; 
     case 14: 
		  b[i][j].append("e");
              break; 
     case 15:  
		  b[i][j].append("f");
              break; 
   } 
    } 
	}
  }
} 

void add(int plain[4][4],int round[4][4],int addkey[4][4]){
   int i=0,j=0;
   for(i=0;i<4;i++){
	   for(j=0;j<4;j++){
         addkey[i][j]=(plain[i][j])^(round[i][j]);
	   }
   }
}
void s_shift(int sbox[256],int addkey[4][4],int s[4][4]){
   int temp,i,j;
   for(i=0;i<4;i++){
	   for(j=0;j<4;j++){
         temp=addkey[i][j];
         s[i][j]=sbox[temp];
	   }
   }
}
void row_shift(int s[4][4]){
   int j,temp;
   //**************第二行
   temp=s[1][0];
   for(j=1;j<4;j++){
	   s[1][(j-1+4)%4]=s[1][(j+4)%4];
   }
   s[1][3]=temp;
   //**************第三行
   for(j=0;j<2;j++){
   temp=s[2][j];
   s[2][j]=s[2][j+2];
   s[2][j+2]=temp;
   }
   //**************第四行
   temp=s[3][3];
   for(j=3;j>0;j--){
	   s[3][j]=s[3][j-1];
   }
   s[3][0]=temp;
}
int multiply(int n,int e){
       while(n> 0x01){
		      if((e & 0x80)==0)
			    {
				  e=(e*2) % 256;
			    }
			   else if((e & 0x80)!=0)
			   {
                  e=((e*2) % 256)^0x1b;
			   }
		   n=n>>1;
		}
       return e;
}
void mix(int s[4][4],int a[4][4],int cipher[4][4]){
	int i,j,k=0;
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
			for(k=0;k<4;k++){
			if(a[i][k]==0x03)
			{  if((s[k][j]&0x80)==0)
			    {
				  cipher[i][j]=cipher[i][j]^(s[k][j]^((s[k][j]*2)%256));
			    }
			   else if((s[k][j]&0x80)!=0)
			   {
                  cipher[i][j]=cipher[i][j]^(s[k][j]^(((s[k][j]*2)%256)^0x1b));
			   }
			}
			else if(a[i][k]==0x02)
			{   
				if((s[k][j]&0x80)==0)
			    {
				  cipher[i][j]=cipher[i][j]^((s[k][j]*2)%256);
			    }
			   else if((s[k][j]&0x80)!=0)
			   {
                  cipher[i][j]=cipher[i][j]^(((s[k][j]*2)%256)^0x1b);
			   }
			}
			else if(a[i][k]==0x01)
			{  
				  cipher[i][j]=cipher[i][j]^s[k][j];
			}
		   }
		}
	}
}
void inv_mix(int s[4][4],int inv_a[4][4],int state[4][4]){
    int i,j,k=0;
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
			for(k=0;k<4;k++){
			if(inv_a[i][k]==0x0e)
			{  
			    state[i][j]=state[i][j]^((multiply(0x02,s[k][j]))^(multiply(0x04,s[k][j]))^(multiply(0x08,s[k][j])));
			}
			else if(inv_a[i][k]==0x0d)
			{   
				state[i][j]=state[i][j]^(s[k][j]^(multiply(0x04,s[k][j]))^(multiply(0x08,s[k][j])));
			}
			else if(inv_a[i][k]==0x0b)
			{  
				state[i][j]=state[i][j]^(s[k][j]^(multiply(0x02,s[k][j]))^(multiply(0x08,s[k][j])));
			}
			else if(inv_a[i][k]==0x09){
			    state[i][j]=state[i][j]^(s[k][j]^(multiply(0x08,s[k][j])));
			}
		   }
		}
	}
}

void RotWord(int a[4][1]){
   int temp=0;
   temp=a[0][0];
   for(int i=1;i<4;i++){
      a[i-1][0]=a[i][0];
   }
   a[3][0]=temp;
}
void subword(int b[4][1],int sbox[256]){
	for(int i=0;i<4;i++){
	   b[i][0]=sbox[b[i][0]];
	}
}
void keyExpantion(int key[4][NK],int w[4][NB*(NR+1)],int sbox[256])
{
     int temp[4][1];
	 int i=0,j=0;
	 const int Rcon[4][NR+1]={
		                      {0x00,0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80,0x1b,0x36},
		                      {0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00},
		                      {0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00},
		                      {0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00}};
	 while(i<NK){
		 for(j=0;j<4;j++){
		    w[j][i]=key[j][i];
		 }
		i++;
	 }
	 i=NK;
	 while(i<NB*(NR+1)){
		 for(j=0;j<4;j++){
            temp[j][0]=w[j][i-1];		 
		 }
		if(i%NK==0){
			RotWord(temp);
			subword(temp,sbox);
			for(j=0;j<4;j++){
				temp[j][0]=temp[j][0]^Rcon[j][i/NK];
			}
		}
		else if((NK>6)&&(i%NK==4)){
			subword(temp,sbox);
			for(j=0;j<4;j++){
				temp[j][0]=temp[j][0];
			}
		}
		for(j=0;j<4;j++){
		    w[j][i]=w[j][i-NK]^temp[j][0];
		}
		i++;
	 }
}

void encryption(int plain[4][4],int w[4][NB*(NR+1)],int sbox[256],int a[4][4],int cipher[4][4],int state[4][4],int s[4][4],int state1[4][4]){
	int roundkey[4][4];
	int i=0,j=0,m=0;
		for(i=0;i<4;i++){
			for(j=0;j<4;j++){
			     roundkey[i][j]=0;
			}
		}
		
   //首先明文和第一轮密钥异或运算
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
			roundkey[i][j]=w[i][j];
		}
	}
   add(plain,roundkey,state);
   //中间9轮循环
   for(m=1;m<NR;m++){
	   for(i=0;i<4;i++){
		  for(j=0;j<4;j++){
		    roundkey[i][j]=w[i][4*m+j];
		  }
	  }
      s_shift(sbox,state,s);
      row_shift(s);
	  for(i=0;i<4;i++){
		  for(j=0;j<4;j++){
		     state1[i][j]=0;
		  }
	  }
      mix(s,a,state1);
	  add(state1,roundkey,state);
   }
   m=NR;
   //最后一轮
   for(i=0;i<4;i++){
		  for(j=0;j<4;j++){
		    roundkey[i][j]=w[i][4*m+j];
		  }
	  }
   s_shift(sbox,state,s);
   row_shift(s);
   add(s,roundkey,cipher);
}
void row_right_shift(int s[4][4]){
    int j,temp=0;
   //**************第二行 
   temp=s[1][3];
   for(j=3;j>0;j--){
	   s[1][j]=s[1][j-1];
   }
   s[1][0]=temp;
   //**************第三行
   for(j=0;j<2;j++){
   temp=s[2][j];
   s[2][j]=s[2][j+2];
   s[2][j+2]=temp;
   }
   //**************第四行
  temp=s[3][0];
   for(j=1;j<4;j++){
	   s[3][(j-1+4)%4]=s[3][(j+4)%4];
   }
   s[3][3]=temp;
}
void decryption(int cipher[4][4],int w[4][NB*(NR+1)],int inv_sbox[256],int inv_a[4][4],int inv_plain[4][4],int state[4][4],int s[4][4],int state1[4][4]){
	int roundkey[4][4];
	int i=0,j=0,m=0;
		for(i=0;i<4;i++){
			for(j=0;j<4;j++){
			     roundkey[i][j]=0;
			}
		}
	
	//最后一轮的逆变换
	m=NR;
    for(i=0;i<4;i++){
		  for(j=0;j<4;j++){
		    roundkey[i][j]=w[i][4*m+j];	
		  }
	}
    add(cipher,roundkey,s);
	row_right_shift(s);
    s_shift(inv_sbox,s,state);
	//中间9轮循环的逆变换
    for(m=9;m>0;m--){
	   for(i=0;i<4;i++){
		  for(j=0;j<4;j++){
		    roundkey[i][j]=w[i][4*m+j];
		  }  
	   }
	  add(state,roundkey,state1);
	  for(i=0;i<4;i++){
		  for(j=0;j<4;j++){
		     s[i][j]=0;
		  }
	  }
	  inv_mix(state1,inv_a,s);
	  row_right_shift(s);
      s_shift(inv_sbox,s,state);
   }
   //第一步异或的逆变换
	for(i=0;i<4;i++){
			for(j=0;j<4;j++){
			     roundkey[i][j]=w[i][j];
			}
		}
   add(state,roundkey,inv_plain);
}

void main(){
	int i,j,k=0,m=0;;
	int s[4][4],state[4][4];
	int cipher[4][4],inv_plain[4][4],cipher1[4][4];
	int addkey[4][4],state2[4][4];
	int roundkey[4][4];
	int w[4][44];
	string w1[4][44],roundkey1[4][4],state1[4][4];
	int plain[4][4]={{0x32,0x88,0x31,0xe0},{0x43,0x5a,0x31,0x37},{0xf6,0x30,0x98,0x07},{0xa8,0x8d,0xa2,0x34}};
	int round[4][4]={{0xa0,0x88,0x23,0x2a},{0xfa,0x54,0xa3,0x6c},{0xfe,0x2c,0x39,0x76},{0x17,0xb1,0x39,0x05}};
	int cipherkey[4][4]={{0x2b,0x28,0xab,0x09},{0x7e,0xae,0xf7,0xcf},{0x15,0xd2,0x15,0x4f},{0x16,0xa6,0x88,0x3c}};
	int a[4][4]={{0x02,0x03,0x01,0x01},{0x01,0x02,0x03,0x01},{0x01,0x01,0x02,0x03},{0x03,0x01,0x01,0x02}};
	int inv_a[4][4]={{0x0e,0x0b,0x0d,0x09},{0x09,0x0e,0x0b,0x0d},{0x0d,0x09,0x0e,0x0b},{0x0b,0x0d,0x09,0x0e}};
	int sbox[256]={0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76, //0
                   0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0, //1
                   0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15, //2
                   0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75, //3
                   0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84, //4
                   0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf, //5
                   0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8, //6
                   0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2, //7
                   0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73, //8
                   0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb, //9
                   0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79, //A
                   0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08, //B
                   0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a, //C
                   0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e, //D
                   0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf, //E
                   0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16 };
	int inv_sbox[256]={0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb,
                /*1*/  0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb,
                /*2*/  0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e,
                /*3*/  0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25,
                /*4*/  0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92,
                /*5*/  0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84,
                /*6*/  0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06,
                /*7*/  0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b,
                /*8*/  0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73,
                /*9*/  0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e,
                /*a*/  0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b,
                /*b*/  0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4,
                /*c*/  0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f,
                /*d*/  0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef,
                /*e*/  0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61,
                /*f*/  0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d 
               };
	
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
		  state[i][j]=0;
		  state2[i][j]=0;
		  inv_plain[i][j]=0;
		  cipher[i][j]=0;
		  cipher1[i][j]=0;
		}
	}
	for(i=0;i<4;i++){
		for(j=0;j<44;j++){
		   w[i][j]=0;
		}
	}
	
	cout<<"异或后的矩阵"<<endl;
	add(plain,round,addkey);
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
           cout<<hex<<addkey[i][j]<<" ";
		}
		cout<<endl;
	}
	cout<<"经过S盒转换后的矩阵"<<endl;
	s_shift(sbox,addkey,s);
    for(i=0;i<4;i++){
		for(j=0;j<4;j++){
           cout<<hex<<s[i][j]<<" ";
		}
		cout<<endl;
	}
    cout<<"经过行循环左移后的矩阵"<<endl;
	row_shift(s);
    for(i=0;i<4;i++){
		for(j=0;j<4;j++){
		//	tentosixteen(s[i][j]);
           cout<<hex<<s[i][j]<<" ";
		}
		cout<<endl;
	}
	cout<<"经过一轮加密的密文"<<endl;
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
		   state[i][j]=0;
		}	
 	}
	mix(s,a,state);
    for(i=0;i<4;i++){
		for(j=0;j<4;j++){
           cout<<hex<<state[i][j]<<" ";
		}
		cout<<endl;
	}
	 ////////////////////////////////////////////////
	for(i=0;i<4;i++){
		for(j=0;j<4;j++){
		   s[i][j]=0;
		}	
 	}
      inv_mix(state,inv_a,s);
      row_right_shift(s);
      s_shift(inv_sbox,s,addkey);
      add(addkey,round,inv_plain);
      cout<<"一轮解密后的明文: "<<endl;
      for(i=0;i<4;i++){
		  for(j=0;j<4;j++){
             cout<<hex<<inv_plain[i][j]<<" ";
		  }
		  cout<<endl;
	  }
	 ////////////////////////////////////////////////

	 cout<<"轮密钥:"<<endl;
	 //得到每一轮的密钥并以十六进制的形式输出
     keyExpantion(cipherkey,w,sbox);
	 while(m<11){
		 cout<<"第"<<m<<"轮密钥:"<<endl;
		for(i=0;i<4;i++){
			 for(j=0;j<4;j++){
				 
				   roundkey[i][j]=w[i][4*m+j];
				   cout<<hex<<roundkey[i][j]<<" ";
			 }
			 cout<<endl;
		}
		
		for(i=0;i<4;i++){
			for(j=0;j<4;j++){
					roundkey1[i][j]="";
			}
		}		 
	 m++;
   }
   encryption(plain,w,sbox,a,cipher,state,s,state2);
   cout<<"加密10轮后的密文: "<<endl;
   for(i=0;i<4;i++){
		for(j=0;j<4;j++){
		   cipher1[i][j]=cipher[i][j];
           cout<<cipher[i][j]<<" ";
		}
		cout<<endl;
   }
	 decryption(cipher1,w,inv_sbox,inv_a,inv_plain,state,s,state2);
     cout<<"解密后的明文: "<<endl;
     for(i=0;i<4;i++){
		for(j=0;j<4;j++){
           cout<<hex<<inv_plain[i][j]<<" ";
		}
		cout<<endl;
	 }
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -