AES基于扩展欧几里德求逆元的S-Box生成

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>  
#include<iostream>
using namespace std;
const int Bit_Num = sizeof(int)* 8;

//求解非零最高位  
int GF_index_of_max(int value){
    int index = 0;
    for (int i = 0; i<Bit_Num; ++i)
    if (value & (1 << i))
        index = i;
    return index;
}

//有限域GF(2^8)内的除法运算  
int GF_divide(int m, int b, int &r){
  //m为模数，b为要求逆元的数
    int m_MSB = GF_index_of_max(m);
    int b_MSB = GF_index_of_max(b);