c++ bitset 实现SMS4加密算法

#include
#include

using namespace std;

unsigned char mingwen[16];
unsigned char miyao[16];


bitset<128> init(unsigned char a[16])
{
    bitset<128> temp;
    for(int i=0;i<16;i++)
    {
        for(int j=0;j<8;j++)
        {
            temp[i*8+j]=(a[i]>>(7-j))&1;
        }
    }
    return temp;
}



int *change(bitset<32>& a)//这个转换是为了在S盒操作中确定行列值
{
    int *result=new int[8];
    
    for(int i=0;i<8;i++)
    {
        result[i]=a[i*4]*8+a[i*4+1]*4+a[i*4+2]*2+a[i*4+3];
    }
    return result;
    
}

bitset<32> change2(int a[4])
{
    bitset<32> result;
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<8;j++)
        {
            result[i*8+j]=a[i]>>(7-j)&1;
        }
    }
    return result;
}
bitset<32> *change3(bitset<128> a)
{
    bitset<32> *b=new bitset<32>[4];
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<32;j++)
        {
            b[i][j]=a[i*32+j];
        }
    }
    return b;
}
bitset<32> *change4(unsigned int a[4])
{
    bitset<32> *result=new bitset<32>[4];
    bitset<32> b1(a[0]); bitset<32> b2(a[1]); bitset<32> b3(a[2]); bitset<32> b4(a[3]);
    result[0]=b1; result[1]=b2; result[2]=b3; result[3]=b4;
    
    return result;
        
}

bitset<32> *change5(unsigned int a[32])
{
    bitset<32> *result=new bitset<32>[32];
    for(int i=0;i<32;i++)
    {
        result[i]=*(new bitset<32>(a[i]));
    }

    
    return result;
        
}
unsigned char *change6(bitset<32> a[4])
{
    unsigned char *result=new unsigned char[16];
    for(int i=0;i<16;i++)
    {
        for(int j=0;j<8;j++)
        {
            result[i]=a[i/4][(i%4)*8]*128+a[i/4][(i%4)*8+1]*64+a[i/4][(i%4)*8+2]*32+a[i/4][(i%4)*8+3]*16+a[i/4][(i%4)*8+4]*8+a[i/4][(i%4)*8+5]*4
            +a[i/4][(i%4)*8+6]*2+a[i/4][(i%4)*8+7];
        }
    }
    return result;
}
bitset<32> *f(bitset<32> a[4],bitset<32> b)//f函数
{
    bitset<32> *result=new bitset<32>[4];
    bitset<32> temp;
    int s_box[16][16] = //S盒
{ 0xd6,0x90,0xe9,0xfe,0xcc,0xe1,0x3d,0xb7,0x16,0xb6,0x14,0xc2,0x28,0xfb,0x2c,0x05,
0x2b,0x67,0x9a,0x76,0x2a,0xbe,0x04,0xc3,0xaa,0x44,0x13,0x26,0x49,0x86,0x06,0x99,
0x9c,0x42,0x50,0xf4,0x91,0xef,0x98,0x7a,0x33,0x54,0x0b,0x43,0xed,0xcf,0xac,0x62,
0xe4,0xb3,0x1c,0xa9,0xc9,0x08,0xe8,0x95,0x80,0xdf,0x94,0xfa,0x75,0x8f,0x3f,0xa6,
0x47,0x07,0xa7,0xfc,0xf3,0x73,0x17,0xba,0x83,0x59,0x3c,0x19,0xe6,0x85,0x4f,0xa8,
0x68,0x6b,0x81,0xb2,0x71,0x64,0xda,0x8b,0xf8,0xeb,0x0f,0x4b,0x70,0x56,0x9d,0x35,
0x1e,0x24,0x0e,0x5e,0x63,0x58,0xd1,0xa2,0x25,0x22,0x7c,0x3b,0x01,0x21,0x78,0x87,
0xd4,0x00,0x46,0x57,0x9f,0xd3,0x27,0x52,0x4c,0x36,0x02,0xe7,0xa0,0xc4,0xc8,0x9e,
0xea,0xbf,0x8a,0xd2,0x40,0xc7,0x38,0xb5,0xa3,0xf7,0xf2,0xce,0xf9,0x61,0x15,0xa1,
0xe0,0xae,0x5d,0xa4,0x9b,0x34,0x1a,0x55,0xad,0x93,0x32,0x30,0xf5,0x8c,0xb1,0xe3,
0x1d,0xf6,0xe2,0x2e,0x82,0x66,0xca,0x60,0xc0,0x29,0x23,0xab,0x0d,0x53,0x4e,0x6f,
0xd5,0xdb,0x37,0x45,0xde,0xfd,0x8e,0x2f,0x03,0xff,0x6a,0x72,0x6d,0x6c,0x5b,0x51,
0x8d,0x1b,0xaf,0x92,0xbb,0xdd,0xbc,0x7f,0x11,0xd9,0x5c,0x41,0x1f,0x10,0x5a,0xd8,
0x0a,0xc1,0x31,0x88,0xa5,0xcd,0x7b,0xbd,0x2d,0x74,0xd0,0x12,0xb8,0xe5,0xb4,0xb0,
0x89,0x69,0x97,0x4a,0x0c,0x96,0x77,0x7e,0x65,0xb9,0xf1,0x09,0xc5,0x6e,0xc6,0x84,
0x18,0xf0,0x7d,0xec,0x3a,0xdc,0x4d,0x20,0x79,0xee,0x5f,0x3e,0xd7,0xcb,0x39,0x48 };


    temp=a[1]^a[2]^a[3]^b;
    
    int *temp2=change(temp);
    int temp3[4];
    for(int i=0;i<4;i++)
    {
        temp3[i]=s_box[temp2[i*2]][temp2[i*2+1]];
    }
    
    temp=change2(temp3);
    temp=temp^(temp<<2)^(temp<<10)^(temp<<18)^(temp<<24);
    temp=a[0]^temp;
    result[0]=a[1]; result[1]=a[2]; result[2]=a[3]; result[3]=temp;
    
    return result;
    
    
}

bitset<32> f2(bitset<32> a)//密钥扩展算法中的f函数
{
    bitset<32> result;

    int s_box[16][16] = //S盒
{ 0xd6,0x90,0xe9,0xfe,0xcc,0xe1,0x3d,0xb7,0x16,0xb6,0x14,0xc2,0x28,0xfb,0x2c,0x05,
0x2b,0x67,0x9a,0x76,0x2a,0xbe,0x04,0xc3,0xaa,0x44,0x13,0x26,0x49,0x86,0x06,0x99,
0x9c,0x42,0x50,0xf4,0x91,0xef,0x98,0x7a,0x33,0x54,0x0b,0x43,0xed,0xcf,0xac,0x62,
0xe4,0xb3,0x1c,0xa9,0xc9,0x08,0xe8,0x95,0x80,0xdf,0x94,0xfa,0x75,0x8f,0x3f,0xa6,
0x47,0x07,0xa7,0xfc,0xf3,0x73,0x17,0xba,0x83,0x59,0x3c,0x19,0xe6,0x85,0x4f,0xa8,
0x68,0x6b,0x81,0xb2,0x71,0x64,0xda,0x8b,0xf8,0xeb,0x0f,0x4b,0x70,0x56,0x9d,0x35,
0x1e,0x24,0x0e,0x5e,0x63,0x58,0xd1,0xa2,0x25,0x22,0x7c,0x3b,0x01,0x21,0x78,0x87,
0xd4,0x00,0x46,0x57,0x9f,0xd3,0x27,0x52,0x4c,0x36,0x02,0xe7,0xa0,0xc4,0xc8,0x9e,
0xea,0xbf,0x8a,0xd2,0x40,0xc7,0x38,0xb5,0xa3,0xf7,0xf2,0xce,0xf9,0x61,0x15,0xa1,
0xe0,0xae,0x5d,0xa4,0x9b,0x34,0x1a,0x55,0xad,0x93,0x32,0x30,0xf5,0x8c,0xb1,0xe3,
0x1d,0xf6,0xe2,0x2e,0x82,0x66,0xca,0x60,0xc0,0x29,0x23,0xab,0x0d,0x53,0x4e,0x6f,
0xd5,0xdb,0x37,0x45,0xde,0xfd,0x8e,0x2f,0x03,0xff,0x6a,0x72,0x6d,0x6c,0x5b,0x51,
0x8d,0x1b,0xaf,0x92,0xbb,0xdd,0xbc,0x7f,0x11,0xd9,0x5c,0x41,0x1f,0x10,0x5a,0xd8,
0x0a,0xc1,0x31,0x88,0xa5,0xcd,0x7b,0xbd,0x2d,0x74,0xd0,0x12,0xb8,0xe5,0xb4,0xb0,
0x89,0x69,0x97,0x4a,0x0c,0x96,0x77,0x7e,0x65,0xb9,0xf1,0x09,0xc5,0x6e,0xc6,0x84,
0x18,0xf0,0x7d,0xec,0x3a,0xdc,0x4d,0x20,0x79,0xee,0x5f,0x3e,0xd7,0xcb,0x39,0x48 };


    result=a;
    
    int *temp1=change(result);
    int temp2[4];
    for(int i=0;i<4;i++)
    {
        temp2[i]=s_box[temp1[i*2]][temp1[i*2+1]];
    }
    
    result=change2(temp2);
    result=result^(result<<13)^(result<<23);
    
    return result;
    
    
}
bitset<32> *key(bitset<128>& a)//密钥扩展
{
    bitset<32> *result=new bitset<32>[32];
    bitset<32> *input=change3(a);
    bitset<32> K[36];
    unsigned int FK[4]={
        0xA3B1BAC6,0x56AA3350,0x677D9197,0xB27022DC
    };
    unsigned int CK[32] = //固定参数CK
{ 0x00070e15,0x1c232a31,0x383f464d,0x545b6269,
0x70777e85,0x8c939aa1,0xa8afb6bd,0xc4cbd2d9,
0xe0e7eef5,0xfc030a11,0x181f262d,0x343b4249,
0x50575e65,0x6c737a81,0x888f969d,0xa4abb2b9,
0xc0c7ced5,0xdce3eaf1,0xf8ff060d,0x141b2229,
0x30373e45,0x4c535a61,0x686f767d,0x848b9299,
0xa0a7aeb5,0xbcc3cad1,0xd8dfe6ed,0xf4fb0209,
0x10171e25,0x2c333a41,0x484f565d,0x646b7279 };

    bitset<32> *ck=change5(CK);
    bitset<32> *temp=change4(FK);
    K[0]=input[0]^temp[0]; K[1]=input[1]^temp[1]; K[2]=input[2]^temp[2]; K[3]=input[3]^temp[3];
    for(int i=4;i<36;i++)
    {
        K[i]=K[i-4]^f2(K[i-3]^K[i-2]^K[i-1]^ck[i-4]);
    }
    for(int i=0;i<32;i++)
    {
        result[i]=K[i+4];
    }
    return result;
}
int main()
{
    cout<<"请输入明文:"<     for(int i=0;i<16;i++)
    {
        scanf("%xuc",mingwen+i);
    }
    cout<<"请输入密钥"<     getchar();
    for(int i=0;i<16;i++)
    {
        scanf("%xuc",miyao+i);
    }
    
    bitset<128> mingwen1=init(mingwen);  bitset<128> miyao1=init(miyao);//把16个16进制数转化为128个bit位
    bitset<32> *miyao2=key(miyao1);//密钥扩展
    
    bitset<32> *mingwen2=change3(mingwen1);//把128位分成四个字
    
    for(int i=0;i<32;i++)
    {
        mingwen2=f(mingwen2,miyao2[i]);//加密
    }
    
    bitset<32> *mingwen3=new bitset<32>[4];
    mingwen3[0]=mingwen2[3]; mingwen3[1]=mingwen2[2]; mingwen3[2]=mingwen2[1]; mingwen3[3]=mingwen2[0];//32轮加密之后，交换次序
    
    unsigned char *miwen=change6(mingwen3);//把四个字转化为16个16进制数输出
    
    for(int i=0;i<16;i++)
    {
        printf("%x ",miwen[i]);
    }
    return 0;
}