aesen.cpp

AES加密解密

#include "AESEN.h"
int subboxs[256]=
{
	 99, 124, 119, 123, 242, 107, 111, 197,  48,   1, 103,  43, 254, 215, 171, 118, 
	202, 130, 201, 125, 250,  89,  71, 240, 173, 212, 162, 175, 156, 164, 114, 192, 
	183, 253, 147,  38,  54,  63, 247, 204,  52, 165, 229, 241, 113, 216,  49,  21, 
	  4, 199,  35, 195,  24, 150,   5, 154,   7,  18, 128, 226, 235,  39, 178, 117, 
	  9, 131,  44,  26,  27, 110,  90, 160,  82,  59, 214, 179,  41, 227,  47, 132, 
	 83, 209,   0, 237,  32, 252, 177,  91, 106, 203, 190,  57,  74,  76,  88, 207, 
	208, 239, 170, 251,  67,  77,  51, 133,  69, 249,   2, 127,  80,  60, 159, 168, 
	 81, 163,  64, 143, 146, 157,  56, 245, 188, 182, 218,  33,  16, 255, 243, 210, 
	205,  12,  19, 236,  95, 151,  68,  23, 196, 167, 126,  61, 100,  93,  25, 115, 
	 96, 129,  79, 220,  34,  42, 144, 136,  70, 238, 184,  20, 222,  94,  11, 219, 
	224,  50,  58,  10,  73,   6,  36,  92, 194, 211, 172,  98, 145, 149, 228, 121, 
	231, 200,  55, 109, 141, 213,  78, 169, 108,  86, 244, 234, 101, 122, 174,   8, 
	186, 120,  37,  46,  28, 166, 180, 198, 232, 221, 116,  31,  75, 189, 139, 138, 
	112,  62, 181, 102,  72,   3, 246,  14,  97,  53,  87, 185, 134, 193,  29, 158, 
	225, 248, 152,  17, 105, 217, 142, 148, 155,  30, 135, 233, 206,  85,  40, 223, 
	140, 161, 137,  13, 191, 230,  66, 104,  65, 153,  45,  15, 176,  84, 187,  22
};

int aroundkeys[12]=
{
	0x01,0x02,0x04,0x08,
	0x10,0x20,0x40,0x80,
	0x1b,0x36,0x6c,0x6c
};

int mix[16]=
{
	2,3,1,1,
        1,2,3,1,
    	1,1,2,3,
	3,1,1,2
};

int aroundkeytalbes[10+1][16];

int mixkeys[4];

void getmixkey(int *qkey)
{
	for(int i=0;i<4;i++)
		mixkeys[i]=qkey[(i+1)*4-1];
}

void xor(int *p,int n)
{
	for(int i=0;i<16;i++)
	{
		bitset<8> temp1(p[i]);
                bitset<8> temp2(aroundkeytalbes[n][i]);
		temp1^=temp2;
		p[i]=temp1.to_ulong();
	}
}

void Sbox(int *p,int n)
{
	for(int i=0;i<n;i++)
		p[i]=subboxs[p[i]];
}

void shift(int *p)
{
	int n=4,temp;
	for(int i=0;i<4;i++){
		for(int k=0;k<i;k++){
			for(int j=0;j<4-1;j++){
				temp=p[i*n+j];
			    p[i*n+j]=p[i*n+j+1];
			    p[i*n+j+1]=temp;
			}
		}
	}
}

void mixcolum(int *p)
{
	int *q;
	q=new int[4*4];
	for(int k=0;k<4;k++){
		for(int i=0;i<4;i++){
			bitset<8> temp;
			for(int j=0;j<4;j++){
				bitset<8> bit(p[j*4+k]);
				bitset<9> test(p[j*4+k]);
				bitset<8> conf(0x1b);
				bitset<8> self(p[j*4+k]);
				if(mix[i*4+j]==1){					
				    temp^=bit;
				}
				else if(mix[i*4+j]==2)
				{
					bit<<=1;
					test<<=1;
				    if(test.test(8))
					    bit^=conf;
					temp^=bit;
				}
				else
				{
					bit<<=1;
					test<<=1;
				    if(test.test(8))
					    bit^=conf;
					bit^=self;
					temp^=bit;
				}
			}
			q[i*4+k]=temp.to_ulong();
		}
	}

	for(int l=0;l<16;l++)
		p[l]=q[l];
}
//----------------------------------------------------------------------------------------------
void rotword(int *p)
{
	int temp;
	for(int i=0;i<4-1;i++){
		temp=p[i];
		p[i]=p[i+1];
		p[i+1]=temp;

	}
}

void xorrcon(int *p,int around)
{
	bitset<8> bit(aroundkeys[around]);
	bitset<8> temp(p[0]);
	temp^=bit;
	p[0]=temp.to_ulong();
}

void updatekey(int *p)
{
	for(int i=0;i<4;i++){
		for(int j=0;j<4;j++){
			bitset<8> temp1(p[i+j*4]);
			bitset<8> temp2(mixkeys[j]);
			temp1^=temp2;
			mixkeys[j]=temp1.to_ulong();
			p[i+j*4]=temp1.to_ulong();
		}
	}
}

void copy(int n,int *key){
	for(int i=0;i<16;i++)
        aroundkeytalbes[n][i]=key[i];
}

void createaroundkeytables(int *key){
	for(int i=0;i<11;i++){
		copy(i,key);
		getmixkey(key);
	    rotword(mixkeys);
        Sbox(mixkeys,4);
	    xorrcon(mixkeys,i);
	    updatekey(key);
	}
}

void start(int *input,int *key){
	createaroundkeytables(key);
	int i;
	for(i=0;i<9;i++){
		xor(input,i);
	        Sbox(input,16);
	        shift(input);
                mixcolum(input);
	}
	xor(input,i++);
	Sbox(input,16);
	shift(input);
	xor(input,i);   
}