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

📄 rijndael.cpp

📁 使用AES高级加密标准在cdma2000赢通信系统中实现空中接口部分的数据加密。
💻 CPP
字号:
#include<stdio.h>

#include<iostream.h>
#include<windows.h>


enum{ BSIZE =16};
static byte    key[] = {0x2b, 0x7e, 0x15, 0x16, 0x28, 0xae, 0xd2, 0xa6,0xab, 0xf7, 0x15, 0x88, 0x09, 0xcf, 0x4f, 0x3c};
static  byte   Rcon[11][4] = { {0x00, 0x00, 0x00, 0x00},{0x01, 0x00, 0x00, 0x00},{0x02, 0x00, 0x00, 0x00},{0x04, 0x00, 0x00, 0x00},{0x08, 0x00, 0x00, 0x00},{0x10, 0x00, 0x00, 0x00},{0x20, 0x00, 0x00, 0x00},{0x40, 0x00, 0x00, 0x00},{0x80, 0x00, 0x00, 0x00},{0x1b, 0x00, 0x00, 0x00},{0x36, 0x00, 0x00, 0x00} };  //创建rcon计数器矩阵
byte Sbox[16][16] = {  // populate the Sbox matrix
									   /* 0     1     2     3     4     5     6     7     8     9     a     b     c     d     e     f */
									   /*0*/  {0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76},
									  /*1*/  {0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0},
									   /*2*/  {0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15},
									   /*3*/  {0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75},
									   /*4*/  {0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84},
									   /*5*/  {0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf},
									   /*6*/  {0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8},
									   /*7*/  {0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2},
									   /*8*/  {0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73},
									   /*9*/  {0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb},
									   /*a*/  {0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79},
									   /*b*/  {0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08},
									   /*c*/  {0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a},
									   /*d*/  {0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e},
									   /*e*/  {0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf},
									   /*f*/  {0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16} };
			//创建了替换盒子S-box
static const byte  iSbox[16][16] = {  // populate the iSbox matrix
										/* 0     1     2     3     4     5     6     7     8     9     a     b     c     d     e     f */
										/*0*/  {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} };

			//创建的一个替换盒子的逆矩阵,用于解密~
			
static byte  w[44][4];// key schedule array.
static byte  State[4][4];  // always [4,4]

void SubWord(byte  * word)
		{
			byte     result[4];
			result[0] = Sbox[ word[0] >> 4][word[0] & 0x0f ];
			result[1] = Sbox[ word[1] >> 4][word[1] & 0x0f ];
			result[2] = Sbox[ word[2] >> 4][word[2] & 0x0f ];
			result[3] = Sbox[ word[3] >> 4][word[3] & 0x0f ];
            word[0]=result[0];
			word[1]=result[1];
			word[2]=result[2];
			word[3]=result[3];
		
		}
 void RotWord(byte * word)
		{
			byte  result[4];
			result[0] = word[1];
			result[1] = word[2];
			result[2] = word[3];
			result[3] = word[0];
		    word[0]=result[0];
			word[1]=result[1];
			word[2]=result[2];
			word[3]=result[3];
		
		}

void AddRoundKey(int round)
		{

			for (int r = 0; r < 4; ++r)
			{
				for (int c = 0; c < 4; ++c)
				{
					State[r][c] = (byte ) ( (byte)State[r][c] ^ (byte)w[(round*4)+c][r] );//int last two
				}
			}
		}  // AddRoundKey()

void SubBytes()
		{
			for (int r = 0; r < 4; ++r)
			{
				for (int c = 0; c < 4; ++c)
				{
					State[r][c] = Sbox[((byte)State[r][c] >> 4)][((byte)State[r][c] & 0x0f)];
				}
			}
		}  // SubBytes

void InvSubBytes()
		{
			for (int r = 0; r < 4; ++r)
			{
				for (int c = 0; c < 4; ++c)
				{
					State[r][c] = iSbox[((byte)State[r][c] >> 4)][((byte)State[r][c] & 0x0f)];
				}
			}
		}  // InvSubBytes

void ShiftRows()
		{
		byte  temp[4][4];
			for (int r = 0; r < 4; ++r)  // copy State into temp[]
			{
				for (int c = 0; c < 4; ++c)
				{
					temp[r][c] = State[r][c];
				}
			}

			for ( r = 1; r < 4; ++r)  // shift temp into State
			{
				for (int c = 0; c < 4; ++c)
				{
					State[r][c] = temp[r][(c + r) % 4];
				}
			}
		}  // ShiftRows()
		
		
void InvShiftRows()
		{
			byte  temp[4][4];
			for (int r = 0; r < 4; ++r)  // copy State into temp[]
			{
				for (int c = 0; c < 4; ++c)
				{
					temp[r][c] = State[r][c];
				}
			}
			for ( r = 1; r < 4; ++r)  // shift temp into State
			{
				for (int c = 0; c < 4; ++c)
				{
					State[r][(c + r) % 4] = temp[r][c];
				}
			}
		}  // InvShiftRows()
		
  
  void KeyExpansion()
		{
			for (int row = 0; row < 4; ++row)
			{
				w[row][0] = key[4*row];
				w[row][1] = key[4*row+1];
				w[row][2] = key[4*row+2];
				w[row][3] = key[4*row+3];
			}

			byte temp[4];

			for (row = 4; row < 44; ++row)
			{
				temp[0] = w[row-1][0];
				temp[1] = w[row-1][1];
				temp[2] = w[row-1][2];
				temp[3] = w[row-1][3];

				if (row % 4 == 0)  
				{
				    RotWord(temp);
				    SubWord(temp);
          
					temp[0] = (byte )( (int)temp[0] ^ (int)Rcon[row/4][0] );
					temp[1] = (byte )( (int)temp[1] ^ (int)Rcon[row/4][1] );
					temp[2] = (byte )( (int)temp[2] ^ (int)Rcon[row/4][2] );
					temp[3] = (byte )( (int)temp[3] ^ (int)Rcon[row/4][3] );
				}
				else if ( 4 > 6 && (row % 4 == 4) )  
				{
				    SubWord(temp);
				}
        
				// w[row] = w[row-Nk] xor temp
				w[row][0] = (byte ) ( (int)w[row-4][0] ^ (int)temp[0] );
				w[row][1] = (byte ) ( (int)w[row-4][1] ^ (int)temp[1] );
				w[row][2] = (byte ) ( (int)w[row-4][2] ^ (int)temp[2] );
				w[row][3] = (byte ) ( (int)w[row-4][3] ^ (int)temp[3] );
       
			}  // for loop
		}  // KeyExpansion()
		
	static byte   gfmultby01(byte  b)
		{
			return b;
		}

 static byte  gfmultby02(byte  b)
		{
			if (b < 0x80)
				return (byte )(int)(b <<1);
			else
				return (byte )( (int)(b << 1) ^ (int)(0x1b) );
		}

 static byte  gfmultby03(byte  b)
		{
			return (byte ) ( (int)gfmultby02(b) ^ (int)b );
		}

 static byte  gfmultby09(byte  b)
		{
			return (byte )( (int)gfmultby02(gfmultby02(gfmultby02(b))) ^ (int)b );
		}

 static byte  gfmultby0b(byte  b)
		{
			return (byte )( (int)gfmultby02(gfmultby02(gfmultby02(b))) ^	(int)gfmultby02(b) ^ (int)b );
		}

 static byte  gfmultby0d(byte  b)
		{
			return (byte )( (int)gfmultby02(gfmultby02(gfmultby02(b))) ^ (int)gfmultby02(gfmultby02(b)) ^	(int)(b) );
		}

 static byte  gfmultby0e(byte  b)
		{
			return (byte )( (int)gfmultby02(gfmultby02(gfmultby02(b))) ^ (int)gfmultby02(gfmultby02(b)) ^	(int)gfmultby02(b) );
		}	
 
 void MixColumns()
		{
			byte  temp[4][4];
			for (int r = 0; r < 4; ++r)  // copy State into temp[]
			{
				for (int c = 0; c < 4; ++c)
				{
					temp[r][c] = State[r][c];
				}
			}
        
			for (int c = 0; c < 4; ++c)
			{
				State[0][c] = (byte ) ( (int)gfmultby02(temp[0][c]) ^ (int)gfmultby03(temp[1][c]) ^
					(int)gfmultby01(temp[2][c]) ^ (int)gfmultby01(temp[3][c]) );
				State[1][c] = (byte ) ( (int)gfmultby01(temp[0][c]) ^ (int)gfmultby02(temp[1][c]) ^
					(int)gfmultby03(temp[2][c]) ^ (int)gfmultby01(temp[3][c]) );
				State[2][c] = (byte ) ( (int)gfmultby01(temp[0][c]) ^ (int)gfmultby01(temp[1][c]) ^
					(int)gfmultby02(temp[2][c]) ^ (int)gfmultby03(temp[3][c]) );
				State[3][c] = (byte ) ( (int)gfmultby03(temp[0][c]) ^ (int)gfmultby01(temp[1][c]) ^
					(int)gfmultby01(temp[2][c]) ^ (int)gfmultby02(temp[3][c]) );
			}
		}  // MixColumns		

void InvMixColumns()
		{
			byte  temp[4][4];
			for (int r = 0; r < 4; ++r)  // copy State into temp[]
			{
				for (int c = 0; c < 4; ++c)
				{
					temp[r][c] = State[r][c];
				}
			}
        
			for (int c = 0; c < 4; ++c)
			{
				State[0][c] = (byte ) ( (int)gfmultby0e(temp[0][c]) ^ (int)gfmultby0b(temp[1][c]) ^
					(int)gfmultby0d(temp[2][c]) ^ (int)gfmultby09(temp[3][c]) );
				State[1][c] = (byte ) ( (int)gfmultby09(temp[0][c]) ^ (int)gfmultby0e(temp[1][c]) ^
					(int)gfmultby0b(temp[2][c]) ^ (int)gfmultby0d(temp[3][c]) );
				State[2][c] = (byte ) ( (int)gfmultby0d(temp[0][c]) ^ (int)gfmultby09(temp[1][c]) ^
					(int)gfmultby0e(temp[2][c]) ^ (int)gfmultby0b(temp[3][c]) );
				State[3][c] = (byte ) ( (int)gfmultby0b(temp[0][c]) ^ (int)gfmultby0d(temp[1][c]) ^
					(int)gfmultby09(temp[2][c]) ^ (int)gfmultby0e(temp[3][c]) );
			}
		}  // InvMixColumns

 

 bool init(byte  blockSize,byte  keySize,  byte  * key)
    {
      // 8 byte  blocks only
	 printf( "%d\n",blockSize);
      if (blockSize != BSIZE) {
        return false;
      }
      	KeyExpansion();  // expand the seed key into a key schedule and store in w 用于原始密码的扩展盒子,只要有一个128位就可以了,不过这里也用不着截取,先留着吧!
//	for(int i=0;i<=44;i++)
      return true;//setupKey (context, key);
    }



 bool  encrypt(byte  * plainBlock, byte  * cipherBlock)
  {
  	    	// state = input
			
			for (int i = 0; i < 16; ++i)
			{
				State[i % 4][i / 4] = *( plainBlock + i);
			}

   printf("以下为输入状态(stste):\n");			
	for(int j1=0;j1<4;j1++)
		  {
			  for(int k1=0;k1<4;k1++)
				  printf("%2x",State[j1][k1]);
			  printf("\n");
			  printf("\n");
		  }
			AddRoundKey(0);
    
			printf("以下为第一轮(初始轮)加密后的结果:\n");	     
			for(int j=0;j<4;j++)
		  {
			  for(int k=0;k<4;k++)
				  printf("%2x",State[j][k]);
			  printf("\n");
		      printf("\n");
			}
			for (int round = 1; round <= 9; ++round)  // main round loop
			{
				SubBytes(); 
				ShiftRows();  
				MixColumns(); 
				AddRoundKey(round);
			}  // main round loop

			SubBytes();
			ShiftRows();
			AddRoundKey(10);
            
			// output = state
			for (i = 0; i < 16; ++i)
			{
			*(cipherBlock+i)= State[i % 4][ i / 4];
			}
return true;
  }
decrypt(byte  * cipherBlock,byte  * plainBlock)
  {
			for (int i = 0; i < 16; ++i)
			{
				State[i % 4][i / 4] = * (cipherBlock + i);
			}
			AddRoundKey(10);

			for (int round = 9; round >= 1; --round)  // main round loop
			{
				InvShiftRows();
				
				InvSubBytes();
/*				for(int j=0;j<4;j++)
				{
					for(int k=0;k<4;k++)
						  printf("%2x",State[j][k]);
						printf("\n");
				}
*/
				AddRoundKey(round);
				InvMixColumns();
			}  // end main round loop for InvCipher

			InvShiftRows();
			InvSubBytes();
			AddRoundKey(0);

			// output = state
			for ( i = 0; i < 16; ++i)
			{
				*(plainBlock+i) = State[i % 4][i / 4];
			}
 return true;
  }

byte  getPreferredBlockSize()
  {
    return BSIZE;
  }
  
  

void main()
{   
	byte  blockSize=16;

	    if(init(blockSize,16, key))
		   printf("ok\n");
	   else
		   printf("fail\n");
	   byte plainBlock[]={0x32,0x43,0xf6,0xa8,0x88,0x5a,0x30,0x8d,0x31,0x31,0x98,0xa2,0xe0,0x37,0x07,0x34};
     //byte  plainBlock[]={0x19,0xa0,0x22,0x33,0x44,0x55,0x66,0x77,0x88,0x99,0xaa,0xbb,0xcc,0xdd,0xee,0xff};
	 
	 printf("以下为输入的明文: \n");  
	 for(int i=0;i<16;i++)
		 printf("%x ",plainBlock[i]);
	 	printf("\n");
     byte  cipherBlock[16];
	   if(encrypt(plainBlock,cipherBlock))
	   {
		   printf("ok\n");
		    for(int i=0;i<16;i++)
		      printf("%2x ",cipherBlock[i]);
				printf("\n");
         
	   }
	   else
		   printf("fail");
byte  pBlock[16];
 if(decrypt(cipherBlock,pBlock))
{
		   printf("ok\n");
		   printf("以下为输入的密文: \n");  
		   for(int i=0;i<16;i++)
			  printf("%2x  ",cipherBlock[i]);
			printf("\n");
			printf("以下为解密后输出的明文: \n"); 
			for( i=0;i<16;i++)
			printf("%2x ",pBlock[i]);
	printf("\n");
	   }
	   else
		   printf("fail");

  
}

⌨️ 快捷键说明

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