aes加密算法(有首轮加密结果可调试)

本文为aes加密过程,未进行密钥扩展,有第一轮数据,可以参考调试

*#include<bits/stdc++.h>
using namespace std;
uint8_t mixColumnsMatrix[][4]=
{
    2,3,1,1,
    1,2,3,1,
    1,1,2,3,
    3,1,1,2
};
unsigned char S[][16] = {
        0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30, 0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76,
        0xCA, 0x82, 0xC9, 0x7D, 0xFA, 0x59, 0x47, 0xF0, 0xAD, 0xD4, 0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0,
        0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34, 0xA5, 0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15,
        0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07, 0x12, 0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75,
        0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52, 0x3B, 0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84,
        0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A, 0xCB, 0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF,
        0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45, 0xF9, 0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8,
        0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC, 0xB6, 0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2,
        0xCD, 0x0C, 0x13, 0xEC, 0x5F, 0x97, 0x44, 0x17, 0xC4, 0xA7, 0x7E, 0x3D, 0x64, 0x5D, 0x19, 0x73,
        0x60, 0x81, 0x4F, 0xDC, 0x22, 0x2A, 0x90, 0x88, 0x46, 0xEE, 0xB8, 0x14, 0xDE, 0x5E, 0x0B, 0xDB,
        0xE0, 0x32, 0x3A, 0x0A, 0x49, 0x06, 0x24, 0x5C, 0xC2, 0xD3, 0xAC, 0x62, 0x91, 0x95, 0xE4, 0x79,
        0xE7, 0xC8, 0x37, 0x6D, 0x8D, 0xD5, 0x4E, 0xA9, 0x6C, 0x56, 0xF4, 0xEA, 0x65, 0x7A, 0xAE, 0x08,
        0xBA, 0x78, 0x25, 0x2E, 0x1C, 0xA6, 0xB4, 0xC6, 0xE8, 0xDD, 0x74, 0x1F, 0x4B, 0xBD, 0x8B, 0x8A,
        0x70, 0x3E, 0xB5, 0x66, 0x48, 0x03, 0xF6, 0x0E, 0x61, 0x35, 0x57, 0xB9, 0x86, 0xC1, 0x1D, 0x9E,
        0xE1, 0xF8, 0x98, 0x11, 0x69, 0xD9, 0x8E, 0x94, 0x9B, 0x1E, 0x87, 0xE9, 0xCE, 0x55, 0x28, 0xDF,
        0x8C, 0xA1, 0x89, 0x0D, 0xBF, 0xE6, 0x42, 0x68, 0x41, 0x99, 0x2D, 0x0F, 0xB0, 0x54, 0xBB, 0x16
};
uint8_t matrix[4][4];
uint8_t key[4][4];
void transformationProcess(uint8_t* matrixArr,uint8_t* keyArr)//including arr and keyArr
{
    uint8_t *p1=matrixArr;
    uint8_t *p2=keyArr;
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<4;j++)
        {
            matrix[j][i]=*p1;
            key[j][i]=*p2;
            p1++;
            p2++;
        }
    }
}
void sBoxChange()//arr.size()=16
{
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<4;j++)
        {
            uint8_t temp=matrix[j][i];
            //cout<<(int)temp<<" ";
            uint8_t low=(temp&15);
            uint8_t high=((temp>>4)&15);
            //printf("%2x %2x \n",high,low);
            //cout<<(int)high<<" "<<(int)low;
            matrix[j][i]=S[high][low];
        }
        //cout<<endl;
    }
}
void shiftRows()
{
    uint8_t temp=matrix[1][0];
    matrix[1][0]=matrix[1][1];
    matrix[1][1]=matrix[1][2];
    matrix[1][2]=matrix[1][3];
    matrix[1][3]=temp;
    temp=matrix[2][0];
    uint8_t temp2=matrix[2][1];
    matrix[2][0]=matrix[2][2];
    matrix[2][1]=matrix[2][3];
    matrix[2][2]=temp;
    matrix[2][3]=temp2;
    temp=matrix[3][0];
    temp2=matrix[3][1];
    uint8_t temp3=matrix[3][2];
    matrix[3][0]=matrix[3][3];
    matrix[3][1]=temp;
    matrix[3][2]=temp2;
    matrix[3][3]=temp3;
}
uint8_t GMul(uint8_t u,uint8_t data)
{
    if(u==1) return data;
    if(u==2)
    {
        if(data & 0x80)//high bit is 1
            return (data<<1)^0x1B;
        else
            return data<<1;
    }
    //following is u=3
    uint8_t temp;
    if(data & 0x80)//high bit is 1
        temp=(data<<1)^0x1B;
    else
        temp=data<<1;
    return temp^data;
}
void mixColumns()
{
    uint8_t temp[4][4];
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<4;j++)
        {
            temp[i][j]=matrix[i][j];
        }
    }
    uint8_t curValue;
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<4;j++)
        {
            curValue=0;
            for(int k=0;k<4;k++)
            {
                curValue=curValue ^ GMul(mixColumnsMatrix[i][k],temp[k][j]);
            }
            matrix[i][j]=curValue;
        }
    }
}
void addRoundKey()
{
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<4;j++)
        {
            matrix[i][j]=matrix[i][j]^key[i][j];
        }
    }
}
void printMatrix()
{
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<4;j++)
        {
            printf("%02x ",matrix[i][j]);
            //cout<<(int)matrix[i][j]<<" ";
        }
        cout<<endl;
    }
}
void printResult()
{
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<4;j++)
        {
            printf("%02x",matrix[j][i]);
        }
    }
    cout<<endl;
}
int main()
{
    uint8_t arr[16]={0x18,0x3D,0xE3,0xB6,0xA1,0xF5,0xE2,0x3D,0xC6,0xC4,0x8D,0x5B,0xF8,0xF5,0x45,0x63};
    uint8_t keyArr[16]={0xA0,0xFA,0xFE,0x17,0x88,0x54,0x2C,0xB1,0x23,0xA3,0x39,0x39,0x2A,0x6C,0x76,0x05};
    transformationProcess(arr,keyArr);
    sBoxChange();
    cout<<"Following is an example from courseware(first turn):"<<endl;
    cout<<endl;
    cout<<"after S box change:"<<endl;
    printMatrix();
    cout<<endl;
    shiftRows();
    cout<<"after shift rows:"<<endl;
    printMatrix();
    cout<<endl;
    mixColumns();
    cout<<"after mix columns:"<<endl;
    printMatrix();
    cout<<endl;
    addRoundKey();
    cout<<"after addRoundKey:"<<endl;
    printMatrix();
    cout<<endl;
    //following is a complete process
    transformationProcess(arr,keyArr);
    addRoundKey();
    for(int i=0;i<9;i++)
    {
        sBoxChange();
        shiftRows();
        mixColumns();
        addRoundKey();
    }
    sBoxChange();
    shiftRows();
    addRoundKey();
    cout<<"the result of a complete process(after encryption):"<<endl;
    printResult();
}
  • 2
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值