WMCTF 2023 ezandroid

发布时间 2023-08-22 23:27:53作者: 阿威在潜水

做题过程

比赛的时候只解出username,看了官方的wp,赛后总结下

首先用jadx打开,没有加壳

image-20230822225756179

关键的就这几个地方,可以看到校验的函数是native函数,使用IDA打开so

image-20230822225900840

导出函数只有JNI_onload,应该是动态注册的函数,使用frida hook 下注册的地址,之前学VMP壳的时候正好有个hook的脚本就直接拿来用了,但是hook后闪退,有frida检测,之前瞟了个一把嗦的反反frida脚本,放一起

function Log(content) {
   var pid = Process.getCurrentThreadId();
   console.log("[" + pid + "]->" + content);
}
function readStdString(str) {
   const isTiny = (str.readU8() & 1) == 0;
   if (isTiny) {
       return str.add(1).readUtf8String();
  }
   return str.add(2 * Process.pointerSize).readPointer().readUtf8String();
}
function hooklibart() {
   var libartmodule = Process.getModuleByName("libart.so");
   var PrettyMethodaddr = null;
   var RegisterNativeaddr = null;
   libartmodule.enumerateSymbols().forEach(
       function(symbol){
           // if(symbol.name=='_ZN3art9JavaVMExt23FindCodeForNativeMethodEPNS_9ArtMethodE'){
           //     RegisterNativeaddr=symbol.address;
           //     Log(JSON.stringify(symbol));
           // }
           if (symbol.name.indexOf("PrettyMethod") != -1 && symbol.name.indexOf("ArtMethod") != -1 && symbol.name.indexOf("art") != -1) {
           Log("find PrettyMethod:" + JSON.stringify(symbol));
           PrettyMethodaddr = symbol.address;
            }
           if (symbol.name.indexOf("RegisterNativeMethod") == -1 && symbol.name.indexOf("ArtMethod") != -1 && symbol.name.indexOf("RegisterNative") != -1) {
               Log("find RegisterNative:" + JSON.stringify(symbol));
               RegisterNativeaddr = symbol.address;
          }
      }

  );
   var PrettyMethodfunc = new NativeFunction(PrettyMethodaddr, ["pointer", "pointer", "pointer"], ["pointer", "int"]);
   Log("start interpreter RegisterNatives:" + RegisterNativeaddr);
   Interceptor.attach(RegisterNativeaddr, {
   onEnter: function (args) {
       var ArtMethodptr = args[0];
       this.JniFuncaddr = args[1];
       var result = PrettyMethodfunc(ArtMethodptr, 1);
       var stdstring = Memory.alloc(3 * Process.pointerSize);
       ptr(stdstring).writePointer(result[0]);
       ptr(stdstring).add(1 * Process.pointerSize).writePointer(result[1]);
       ptr(stdstring).add(2 * Process.pointerSize).writePointer(result[2]);
       this.funcnamestring = readStdString(stdstring);
       var addrinfo = DebugSymbol.fromAddress(ptr(this.JniFuncaddr));
       Log("[RegisterJni begin]" + this.funcnamestring + "--addr:" + this.JniFuncaddr + ",info:" + addrinfo);
  }, onLeave: function (retval) {
       Log("[RegisterJni over]" + this.funcnamestring + "--addr:" + this.JniFuncaddr);
  }
})

}
function hooklibc(){

   var libcmodule=Process.getModuleByName("libc.so");
   var dlsymaddr=libcmodule.getExportByName("dlsym");

   Interceptor.attach(dlsymaddr,{
       onEnter:function (args) {
           this.handle=args[0];
           this.symname=ptr(args[1]).readCString();
      },onLeave:function (retval) {
           Log("[dlsym]handle"+this.handle+",symbol:"+this.symname+"addr:"+retval);
      }
  })

}
function replace_str() {
   var pt_strstr = Module.findExportByName("libc.so", 'strstr');
   var pt_strcmp = Module.findExportByName("libc.so", 'strcmp');

   Interceptor.attach(pt_strstr, {
       onEnter: function (args) {
           var str1 = args[0].readCString();
           var str2 = args[1].readCString();
           if (
               str2.indexOf("REJECT") !== -1 ||
               str2.indexOf("tmp") !== -1 ||
               str2.indexOf("frida") !== -1 ||
               str2.indexOf("gum-js-loop") !== -1 ||
               str2.indexOf("gmain") !== -1 ||
               str2.indexOf("linjector") !== -1
          ) {
               // console.log("strstr-->", str1, str2);
               this.hook = true;
          }
      }, onLeave: function (retval) {
           if (this.hook) {
               retval.replace(0);
          }
      }
  });

   Interceptor.attach(pt_strcmp, {
       onEnter: function (args) {
           var str1 = args[0].readCString();
           var str2 = args[1].readCString();
           if (
               str2.indexOf("REJECT") !== -1 ||
               str2.indexOf("tmp") !== -1 ||
               str2.indexOf("frida") !== -1 ||
               str2.indexOf("gum-js-loop") !== -1 ||
               str2.indexOf("gmain") !== -1 ||
               str2.indexOf("linjector") !== -1
          ) {
               //console.log("strcmp-->", str1, str2);
               this.hook = true;
          }
      }, onLeave: function (retval) {
           if (this.hook) {
               retval.replace(0);
          }
      }
  })

}
Java.perform(function () {
   send("Running Script");


   var base_addr = Module.findBaseAddress("libplusne.so");//获取 so的基址
   // var aa = Module.findBaseAddress("libezandroid.so");//获取 so的基址
   // Log("libezandroid.so"+aa)
   var nativePointer = base_addr.add(0x6BE24+1)  //加上相对地址,得到绝对地址,记住,这里一定要加1
   var result_pointer;
   Interceptor.attach(nativePointer,{
       onEnter:
           function(args){
               result_pointer = args[0] //将数组进行保存,供下面的函数使用
               console.log(Memory.readCString(args[1]));//打印第二个参数值
          },
       onLeave:
           function(retval){
               var resultPointer = new NativePointer(result_pointer);
               var resultstr = Memory.readUtf8String(resultPointer);//读取数组里面的值
               send(retval.toInt32());  //打印结果
               send("result pointer:" + resultPointer +", result:" + resultstr);//打印解码后的字符串
          }
      });


   send("Hooks installed.");
});
function main(){
   replace_str();
   hooklibc();
   hooklibart();
}
setImmediate(main);

image-20230822230622081

 

0x2b90 0x32f0的偏移,在IDA里面查看,在jni_ONload 里面正好是这两个check,

 

进到第一个check,首先是一个长度校验,

image-20230822231001020

 

这里应该用了混淆所以看起来特别费劲,往上面有个RC4加密,里面点进去一堆256,然后魔改了下最后的异或,我刚开始用RC4解密的结果不对,因为RC4是使用的对称加密,所以我们把后面比较的密文,作为输入放进去,应该可以吐出原文,动态调试,patch或者使用frida

image-20230822231138882

 

 

import ida_bytes

def patch_memory(address, data):
   for i, byte in enumerate(data):
       ida_bytes.patch_byte(address + i, byte)

# Define the address and data to patch
address = 0x00007FFF58E0D130
data = [0xE9, 0x97, 0x64, 0xE6, 0x7E, 0xEB, 0xBD, 0xC1, 0xAB, 0x43]

# Call the patch function
patch_memory(address, data)

自吐username

image-20230822133501271然后看check2,之前使用findcrypt插件,是看到一个aes长数组的,查看交叉引用,在check里面的这个函数里面,动调了一下,试了下不是标准的AES,看的里面流程也很难看,根本看不懂呀,看的Wp,是查看那个长数组的交叉引用,看到了一个换表,把表换了,不是标准的S盒

image-20230822231747489

把这个表拷贝出来,自己求一次逆

ida_chars = [
   0x29, 0x40, 0x57, 0x6E, 0x85, 0x9C, 0xB3, 0xCA, 0xE1, 0xF8,
   0x0F, 0x26, 0x3D, 0x54, 0x6B, 0x82, 0x99, 0xB0, 0xC7, 0xDE,
   0xF5, 0x0C, 0x23, 0x3A, 0x51, 0x68, 0x7F, 0x96, 0xAD, 0xC4,
   0xDB, 0xF2, 0x09, 0x20, 0x37, 0x4E, 0x65, 0x7C, 0x93, 0xAA,
   0xC1, 0xD8, 0xEF, 0x06, 0x1D, 0x34, 0x4B, 0x62, 0x79, 0x90,
   0xA7, 0xBE, 0xD5, 0xEC, 0x03, 0x1A, 0x31, 0x48, 0x5F, 0x76,
   0x8D, 0xA4, 0xBB, 0xD2, 0xE9, 0x00, 0x17, 0x2E, 0x45, 0x5C,
   0x73, 0x8A, 0xA1, 0xB8, 0xCF, 0xE6, 0xFD, 0x14, 0x2B, 0x42,
   0x59, 0x70, 0x87, 0x9E, 0xB5, 0xCC, 0xE3, 0xFA, 0x11, 0x28,
   0x3F, 0x56, 0x6D, 0x84, 0x9B, 0xB2, 0xC9, 0xE0, 0xF7, 0x0E,
   0x25, 0x3C, 0x53, 0x6A, 0x81, 0x98, 0xAF, 0xC6, 0xDD, 0xF4,
   0x0B, 0x22, 0x39, 0x50, 0x67, 0x7E, 0x95, 0xAC, 0xC3, 0xDA,
   0xF1, 0x08, 0x1F, 0x36, 0x4D, 0x64, 0x7B, 0x92, 0xA9, 0xC0,
   0xD7, 0xEE, 0x05, 0x1C, 0x33, 0x4A, 0x61, 0x78, 0x8F, 0xA6,
   0xBD, 0xD4, 0xEB, 0x02, 0x19, 0x30, 0x47, 0x5E, 0x75, 0x8C,
   0xA3, 0xBA, 0xD1, 0xE8, 0xFF, 0x16, 0x2D, 0x44, 0x5B, 0x72,
   0x89, 0xA0, 0xB7, 0xCE, 0xE5, 0xFC, 0x13, 0x2A, 0x41, 0x58,
   0x6F, 0x86, 0x9D, 0xB4, 0xCB, 0xE2, 0xF9, 0x10, 0x27, 0x3E,
   0x55, 0x6C, 0x83, 0x9A, 0xB1, 0xC8, 0xDF, 0xF6, 0x0D, 0x24,
   0x3B, 0x52, 0x69, 0x80, 0x97, 0xAE, 0xC5, 0xDC, 0xF3, 0x0A,
   0x21, 0x38, 0x4F, 0x66, 0x7D, 0x94, 0xAB, 0xC2, 0xD9, 0xF0,
   0x07, 0x1E, 0x35, 0x4C, 0x63, 0x7A, 0x91, 0xA8, 0xBF, 0xD6,
   0xED, 0x04, 0x1B, 0x32, 0x49, 0x60, 0x77, 0x8E, 0xA5, 0xBC,
   0xD3, 0xEA, 0x01, 0x18, 0x2F, 0x46, 0x5D, 0x74, 0x8B, 0xA2,
   0xB9, 0xD0, 0xE7, 0xFE, 0x15, 0x2C, 0x43, 0x5A, 0x71, 0x88,
   0x9F, 0xB6, 0xCD, 0xE4, 0xFB, 0x12
]

inverse_sbox = [0] * 256

for i, value in enumerate(ida_chars):
   inverse_sbox[value] = i

for i in range(len(inverse_sbox)):
   print("0x%02X"%inverse_sbox[i],end=',')

求出S盒和逆S盒,然后找个AES的算法,把这两个换了,就可以正常解密了。这里贴上官方的代码了。懒得找了,key 可以打断点,在AES的入口找到,是Re_1s_eaSy123456

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

/**
* S盒
*/
static const int S[16][16] = {
  0x29, 0x40, 0x57, 0x6E, 0x85, 0x9C, 0xB3, 0xCA, 0xE1, 0xF8,
   0x0F, 0x26, 0x3D, 0x54, 0x6B, 0x82, 0x99, 0xB0, 0xC7, 0xDE,
   0xF5, 0x0C, 0x23, 0x3A, 0x51, 0x68, 0x7F, 0x96, 0xAD, 0xC4,
   0xDB, 0xF2, 0x09, 0x20, 0x37, 0x4E, 0x65, 0x7C, 0x93, 0xAA,
   0xC1, 0xD8, 0xEF, 0x06, 0x1D, 0x34, 0x4B, 0x62, 0x79, 0x90,
   0xA7, 0xBE, 0xD5, 0xEC, 0x03, 0x1A, 0x31, 0x48, 0x5F, 0x76,
   0x8D, 0xA4, 0xBB, 0xD2, 0xE9, 0x00, 0x17, 0x2E, 0x45, 0x5C,
   0x73, 0x8A, 0xA1, 0xB8, 0xCF, 0xE6, 0xFD, 0x14, 0x2B, 0x42,
   0x59, 0x70, 0x87, 0x9E, 0xB5, 0xCC, 0xE3, 0xFA, 0x11, 0x28,
   0x3F, 0x56, 0x6D, 0x84, 0x9B, 0xB2, 0xC9, 0xE0, 0xF7, 0x0E,
   0x25, 0x3C, 0x53, 0x6A, 0x81, 0x98, 0xAF, 0xC6, 0xDD, 0xF4,
   0x0B, 0x22, 0x39, 0x50, 0x67, 0x7E, 0x95, 0xAC, 0xC3, 0xDA,
   0xF1, 0x08, 0x1F, 0x36, 0x4D, 0x64, 0x7B, 0x92, 0xA9, 0xC0,
   0xD7, 0xEE, 0x05, 0x1C, 0x33, 0x4A, 0x61, 0x78, 0x8F, 0xA6,
   0xBD, 0xD4, 0xEB, 0x02, 0x19, 0x30, 0x47, 0x5E, 0x75, 0x8C,
   0xA3, 0xBA, 0xD1, 0xE8, 0xFF, 0x16, 0x2D, 0x44, 0x5B, 0x72,
   0x89, 0xA0, 0xB7, 0xCE, 0xE5, 0xFC, 0x13, 0x2A, 0x41, 0x58,
   0x6F, 0x86, 0x9D, 0xB4, 0xCB, 0xE2, 0xF9, 0x10, 0x27, 0x3E,
   0x55, 0x6C, 0x83, 0x9A, 0xB1, 0xC8, 0xDF, 0xF6, 0x0D, 0x24,
   0x3B, 0x52, 0x69, 0x80, 0x97, 0xAE, 0xC5, 0xDC, 0xF3, 0x0A,
   0x21, 0x38, 0x4F, 0x66, 0x7D, 0x94, 0xAB, 0xC2, 0xD9, 0xF0,
   0x07, 0x1E, 0x35, 0x4C, 0x63, 0x7A, 0x91, 0xA8, 0xBF, 0xD6,
   0xED, 0x04, 0x1B, 0x32, 0x49, 0x60, 0x77, 0x8E, 0xA5, 0xBC,
   0xD3, 0xEA, 0x01, 0x18, 0x2F, 0x46, 0x5D, 0x74, 0x8B, 0xA2,
   0xB9, 0xD0, 0xE7, 0xFE, 0x15, 0x2C, 0x43, 0x5A, 0x71, 0x88,
   0x9F, 0xB6, 0xCD, 0xE4, 0xFB, 0x12 };

/**
* 逆S盒
*/
static const int S2[16][16] = {
  0x41,0xE8,0x8F,0x36,0xDD,0x84,0x2B,0xD2,0x79,0x20,0xC7,0x6E,0x15,0xBC,0x63,0x0A,

0xB1,0x58,0xFF,0xA6,0x4D,0xF4,0x9B,0x42,0xE9,0x90,0x37,0xDE,0x85,0x2C,0xD3,0x7A,

0x21,0xC8,0x6F,0x16,0xBD,0x64,0x0B,0xB2,0x59,0x00,0xA7,0x4E,0xF5,0x9C,0x43,0xEA,

0x91,0x38,0xDF,0x86,0x2D,0xD4,0x7B,0x22,0xC9,0x70,0x17,0xBE,0x65,0x0C,0xB3,0x5A,

0x01,0xA8,0x4F,0xF6,0x9D,0x44,0xEB,0x92,0x39,0xE0,0x87,0x2E,0xD5,0x7C,0x23,0xCA,

0x71,0x18,0xBF,0x66,0x0D,0xB4,0x5B,0x02,0xA9,0x50,0xF7,0x9E,0x45,0xEC,0x93,0x3A,

0xE1,0x88,0x2F,0xD6,0x7D,0x24,0xCB,0x72,0x19,0xC0,0x67,0x0E,0xB5,0x5C,0x03,0xAA,

0x51,0xF8,0x9F,0x46,0xED,0x94,0x3B,0xE2,0x89,0x30,0xD7,0x7E,0x25,0xCC,0x73,0x1A,

0xC1,0x68,0x0F,0xB6,0x5D,0x04,0xAB,0x52,0xF9,0xA0,0x47,0xEE,0x95,0x3C,0xE3,0x8A,

0x31,0xD8,0x7F,0x26,0xCD,0x74,0x1B,0xC2,0x69,0x10,0xB7,0x5E,0x05,0xAC,0x53,0xFA,

0xA1,0x48,0xEF,0x96,0x3D,0xE4,0x8B,0x32,0xD9,0x80,0x27,0xCE,0x75,0x1C,0xC3,0x6A,

0x11,0xB8,0x5F,0x06,0xAD,0x54,0xFB,0xA2,0x49,0xF0,0x97,0x3E,0xE5,0x8C,0x33,0xDA,

0x81,0x28,0xCF,0x76,0x1D,0xC4,0x6B,0x12,0xB9,0x60,0x07,0xAE,0x55,0xFC,0xA3,0x4A,

0xF1,0x98,0x3F,0xE6,0x8D,0x34,0xDB,0x82,0x29,0xD0,0x77,0x1E,0xC5,0x6C,0x13,0xBA,

0x61,0x08,0xAF,0x56,0xFD,0xA4,0x4B,0xF2,0x99,0x40,0xE7,0x8E,0x35,0xDC,0x83,0x2A,

0xD1,0x78,0x1F,0xC6,0x6D,0x14,0xBB,0x62,0x09,0xB0,0x57,0xFE,0xA5,0x4C,0xF3,0x9A, };

/**
* 获取整形数据的低8位的左4个位
*/
static int getLeft4Bit(int num) {
   int left = num & 0x000000f0;
   return left >> 4;
}

/**
* 获取整形数据的低8位的右4个位
*/
static int getRight4Bit(int num) {
   return num & 0x0000000f;
}
/**
* 根据索引,从S盒中获得元素
*/
static int getNumFromSBox(int index) {
   int row = getLeft4Bit(index);
   int col = getRight4Bit(index);
   return S[row][col];
}

/**
* 把一个字符转变成整型
*/
static int getIntFromChar(char c) {
   int result = (int)c;
   return result & 0x000000ff;
}

/**
* 把16个字符转变成4X4的数组,
* 该矩阵中字节的排列顺序为从上到下,
* 从左到右依次排列。
*/
static void convertToIntArray(char* str, int pa[4][4]) {
   int k = 0;
   int i, j;
   for (i = 0; i < 4; i++)
       for (j = 0; j < 4; j++) {
           pa[j][i] = getIntFromChar(str[k]);
           k++;
      }
}

/**
* 把连续的4个字符合并成一个4字节的整型
*/
static int getWordFromStr(char* str) {
   int one, two, three, four;
   one = getIntFromChar(str[0]);
   one = one << 24;
   two = getIntFromChar(str[1]);
   two = two << 16;
   three = getIntFromChar(str[2]);
   three = three << 8;
   four = getIntFromChar(str[3]);
   return one | two | three | four;
}

/**
* 把一个4字节的数的第一、二、三、四个字节取出,
* 入进一个4个元素的整型数组里面。
*/
static void splitIntToArray(int num, int array[4]) {
   int one, two, three;
   one = num >> 24;
   array[0] = one & 0x000000ff;
   two = num >> 16;
   array[1] = two & 0x000000ff;
   three = num >> 8;
   array[2] = three & 0x000000ff;
   array[3] = num & 0x000000ff;
}

/**
* 将数组中的元素循环左移step位
*/
static void leftLoop4int(int array[4], int step) {
   int temp[4];
   int i;
   int index;
   for (i = 0; i < 4; i++)
       temp[i] = array[i];

   index = step % 4 == 0 ? 0 : step % 4;
   for (i = 0; i < 4; i++) {
       array[i] = temp[index];
       index++;
       index = index % 4;
  }
}

/**
* 把数组中的第一、二、三和四元素分别作为
* 4字节整型的第一、二、三和四字节,合并成一个4字节整型
*/
static int mergeArrayToInt(int array[4]) {
   int one = array[0] << 24;
   int two = array[1] << 16;
   int three = array[2] << 8;
   int four = array[3];
   return one | two | three | four;
}

/**
* 常量轮值表
*/
static const int Rcon[10] = { 0x01000000, 0x02000000,
   0x04000000, 0x08000000,
   0x10000000, 0x20000000,
   0x40000000, 0x80000000,
   0x1b000000, 0x36000000 };
/**
* 密钥扩展中的T函数
*/
static int T(int num, int round) {
   int numArray[4];
   int i;
   int result;
   splitIntToArray(num, numArray);
   leftLoop4int(numArray, 1);//字循环

   //字节代换
   for (i = 0; i < 4; i++)
       numArray[i] = getNumFromSBox(numArray[i]);

   result = mergeArrayToInt(numArray);
   return result ^ Rcon[round];
}

//密钥对应的扩展数组
static int w[44];


/**
* 扩展密钥,结果是把w[44]中的每个元素初始化
*/
static void extendKey(char* key) {
   int i, j;
   for (i = 0; i < 4; i++)
       w[i] = getWordFromStr(key + i * 4);

   for (i = 4, j = 0; i < 44; i++) {
       if (i % 4 == 0) {
           w[i] = w[i - 4] ^ T(w[i - 1], j);
           j++;//下一轮
      }
       else {
           w[i] = w[i - 4] ^ w[i - 1];
      }
  }

}

/**
* 轮密钥加
*/
static void addRoundKey(int array[4][4], int round) {
   int warray[4];
   int i, j;
   for (i = 0; i < 4; i++) {

       splitIntToArray(w[round * 4 + i], warray);

       for (j = 0; j < 4; j++) {
           array[j][i] = array[j][i] ^ warray[j];
      }
  }
}





static int GFMul2(int s) {
   int result = s << 1;
   int a7 = result & 0x00000100;

   if (a7 != 0) {
       result = result & 0x000000ff;
       result = result ^ 0x1b;
  }

   return result;
}

static int GFMul3(int s) {
   return GFMul2(s) ^ s;
}

static int GFMul4(int s) {
   return GFMul2(GFMul2(s));
}

static int GFMul8(int s) {
   return GFMul2(GFMul4(s));
}

static int GFMul9(int s) {
   return GFMul8(s) ^ s;
}

static int GFMul11(int s) {
   return GFMul9(s) ^ GFMul2(s);
}

static int GFMul12(int s) {
   return GFMul8(s) ^ GFMul4(s);
}

static int GFMul13(int s) {
   return GFMul12(s) ^ s;
}

static int GFMul14(int s) {
   return GFMul12(s) ^ GFMul2(s);
}

/**
* GF上的二元运算
*/
static int GFMul(int n, int s) {
   int result;

   if (n == 1)
       result = s;
   else if (n == 2)
       result = GFMul2(s);
   else if (n == 3)
       result = GFMul3(s);
   else if (n == 0x9)
       result = GFMul9(s);
   else if (n == 0xb)//11
       result = GFMul11(s);
   else if (n == 0xd)//13
       result = GFMul13(s);
   else if (n == 0xe)//14
       result = GFMul14(s);

   return result;
}

/**
* 把4X4数组转回字符串
*/
static void convertArrayToStr(int array[4][4], char* str) {
   int i, j;
   for (i = 0; i < 4; i++)
       for (j = 0; j < 4; j++)
           *str++ = (char)array[j][i];
}

/**
* 根据索引从逆S盒中获取值
*/
static int getNumFromS1Box(int index) {
   int row = getLeft4Bit(index);
   int col = getRight4Bit(index);
   return S2[row][col];
}
/**
* 逆字节变换
*/
static void deSubBytes(int array[4][4]) {
   int i, j;
   for (i = 0; i < 4; i++)
       for (j = 0; j < 4; j++)
           array[i][j] = getNumFromS1Box(array[i][j]);
}
/**
* 把4个元素的数组循环右移step位
*/
static void rightLoop4int(int array[4], int step) {
   int temp[4];
   int i;
   int index;
   for (i = 0; i < 4; i++)
       temp[i] = array[i];

   index = step % 4 == 0 ? 0 : step % 4;
   index = 3 - index;
   for (i = 3; i >= 0; i--) {
       array[i] = temp[index];
       index--;
       index = index == -1 ? 3 : index;
  }
}

/**
* 逆行移位
*/
static void deShiftRows(int array[4][4]) {
   int rowTwo[4], rowThree[4], rowFour[4];
   int i;
   for (i = 0; i < 4; i++) {
       rowTwo[i] = array[1][i];
       rowThree[i] = array[2][i];
       rowFour[i] = array[3][i];
  }

   rightLoop4int(rowTwo, 1);
   rightLoop4int(rowThree, 2);
   rightLoop4int(rowFour, 3);

   for (i = 0; i < 4; i++) {
       array[1][i] = rowTwo[i];
       array[2][i] = rowThree[i];
       array[3][i] = rowFour[i];
  }
}
/**
* 逆列混合用到的矩阵
*/
static const int deColM[4][4] = { 0xe, 0xb, 0xd, 0x9,
   0x9, 0xe, 0xb, 0xd,
   0xd, 0x9, 0xe, 0xb,
   0xb, 0xd, 0x9, 0xe };

/**
* 逆列混合
*/
static void deMixColumns(int array[4][4]) {
   int tempArray[4][4];
   int i, j;
   for (i = 0; i < 4; i++)
       for (j = 0; j < 4; j++)
           tempArray[i][j] = array[i][j];

   for (i = 0; i < 4; i++)
       for (j = 0; j < 4; j++) {
           array[i][j] = GFMul(deColM[i][0], tempArray[0][j]) ^ GFMul(deColM[i][1], tempArray[1][j])
               ^ GFMul(deColM[i][2], tempArray[2][j]) ^ GFMul(deColM[i][3], tempArray[3][j]);
      }
}
/**
* 把两个4X4数组进行异或
*/
static void addRoundTowArray(int aArray[4][4], int bArray[4][4]) {
   int i, j;
   for (i = 0; i < 4; i++)
       for (j = 0; j < 4; j++)
           aArray[i][j] = aArray[i][j] ^ bArray[i][j];
}
/**
* 从4个32位的密钥字中获得4X4数组,
* 用于进行逆列混合
*/
static void getArrayFrom4W(int i, int array[4][4]) {
   int index, j;
   int colOne[4], colTwo[4], colThree[4], colFour[4];
   index = i * 4;
   splitIntToArray(w[index], colOne);
   splitIntToArray(w[index + 1], colTwo);
   splitIntToArray(w[index + 2], colThree);
   splitIntToArray(w[index + 3], colFour);

   for (j = 0; j < 4; j++) {
       array[j][0] = colOne[j];
       array[j][1] = colTwo[j];
       array[j][2] = colThree[j];
       array[j][3] = colFour[j];
  }

}

/**
* 参数 c: 密文的字符串数组。
* 参数 clen: 密文的长度。
* 参数 key: 密钥的字符串数组。
*/
void deAes(char* c, int clen, char* key) {

   int cArray[4][4];
   int keylen, k;
   keylen = strlen(key);
   if (clen == 0 || clen % 16 != 0) {
       printf("密文字符长度必须为16的倍数!现在的长度为%d\n", clen);
       exit(0);
  }

   extendKey(key);//扩展密钥

   for (k = 0; k < clen; k += 16) {
       int i;
       int wArray[4][4];

       convertToIntArray(c + k, cArray);
       addRoundKey(cArray, 10);

       for (i = 9; i >= 1; i--) {
           deSubBytes(cArray);
           deShiftRows(cArray);
           deMixColumns(cArray);
           getArrayFrom4W(i, wArray);
           deMixColumns(wArray);

           addRoundTowArray(cArray, wArray);
      }
       deSubBytes(cArray);
       deShiftRows(cArray);
       addRoundKey(cArray, 0);
       convertArrayToStr(cArray, c + k);

  }
}
int main() {
   char encodebuffer[] = { 0x2B, 0xC8, 0x20, 0x8B, 0x5C, 0xD, 0xA7, 0x9B, 0x2A, 0x51, 0x3A, 0xD2, 0x71, 0x71, 0xCA, 0x50 };
   char* key = (char*)"Re_1s_eaSy123456";
   deAes(encodebuffer, 16, key);
   printf("%s", encodebuffer);
}