22-恰好我有。能运行,C语言。.docVIP

恰好我有。能运行的，C语言的。 #include string.h #include aes.h #include commonage.h #define byte unsigned char #define BPOLY 0x1b //! Lower 8 bits of (x^8+x^4+x^3+x+1), ie. (x^4+x^3+x+1). #define BLOCKSIZE 16 //! Block size in number of bytes. #define KEYBITS 128 //! Use AES128. #define ROUNDS 10 //! Number of rounds. #define KEYLENGTH 16 //! Key length in number of bytes. byte xdata block1[ 256 ]; //! Workspace 1. byte xdata block2[ 256 ]; //! Worksapce 2. byte xdata * powTbl; //! Final location of exponentiation lookup table. byte xdata * logTbl; //! Final location of logarithm lookup table. byte xdata * sBox; //! Final location of s-box. byte xdata * sBoxInv; //! Final location of inverse s-box. byte xdata * expandedKey; //! Final location of expanded key. void CalcPowLog( byte * powTbl, byte * logTbl ) { byte xdata i = 0; byte xdata t = 1; do { // Use 0x03 as root for exponentiation and logarithms. powTbl[i] = t; logTbl[t] = i; i++; // Muliply t by 3 in GF(2^8). t ^= (t 1) ^ (t 0x80 ? BPOLY : 0); } while( t != 1 ); // Cyclic properties ensure that i 255. powTbl[255] = powTbl[0]; // 255 = -0, 254 = -1, etc. } void CalcSBox( byte * sBox ) { byte xdata i, rot; byte xdata temp; byte xdata result; // Fill all entries of sBox[]. i = 0; do { // Inverse in GF(2^8). if( i 0 ) { temp = powTbl[ 255 - logTbl[i] ]; } else { temp = 0; } // Affine transformation in GF(2). result = temp ^ 0x63; // Start with adding a vector in GF(2). for( rot = 0; rot 4; rot++ ) { // Rotate left. temp = (temp1) | (temp7); // Add rotated byte in GF(2). result ^= temp; } // Put result in table. sBox[i] = result; } while( ++i != 0 ); } void CalcSBoxInv( byte * sBox, byte * sBoxInv ) { byte xdata i = 0; byte xdata j = 0; // Iterate through all elements in sBoxInv using i. do { // Search through sBox using j. cleardog(); do { // Check if current j is the inverse of current i. if( sBox[ j ] == i ) { // If so, s