SM4算法实现 JAVA

package sino.java.test;

import org.junit.Test;

public class SM4Test {
    static final int FK[] = {
            0xa3b1bac6, 0x56aa3350, 0x677d9197, 0xb27022dc
    };

    static final int 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
    };

    static final int SboxTable[][] =
    {
            {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}
    };


    final int SM4_DECRYPT = 0;
    final int SM4_ENCRYPT = 1;
    //681EDF34D206965E86B3E94F536E4246
    @Test
    public void decrypt() {
        int mode  = SM4_DECRYPT;
//        681EDF34 D206965E 86B3E94F 536E4246
        int X0 = 0x681EDF34;
        int X1 = 0xD206965E;
        int X2 = 0x86B3E94F;
        int X3 = 0x536E4246;
        int buf[] = new int[36];
        buf[0] = X0;
        buf[1] = X1;
        buf[2] = X2;
        buf[3] = X3;
        int MK[] = new int[4];
        MK[0] = 0x01234567;
        MK[1] = 0x89ABCDEF;
        MK[2] = 0xFEDCBA98;
        MK[3] = 0x76543210;
        int []rk = rkGen(MK,mode);
        for(int i=0; i<32; i++){
            buf[4+i] = F(buf[i],buf[1+i],buf[2+i],buf[3+i],rk[i]);
            System.out.printf("rk["+i+"]= %08x\n",rk[i]);
//            System.out.printf("X["+i+"]= %08x\n",buf[4+i]);
        }

        for(int i=buf.length; i>buf.length-4;i--){
            System.out.printf("%08X",buf[i-1]);
        }
    }

    @Test
    public void encrypt() {
        int mode  = SM4_ENCRYPT;
        int X0 = 0x01234567;
        int X1 = 0x89ABCDEF;
        int X2 = 0xFEDCBA98;
        int X3 = 0x76543210;
        int buf[] = new int[36];
        buf[0] = X0;
        buf[1] = X1;
        buf[2] = X2;
        buf[3] = X3;
        int MK[] = new int[4];
        MK[0] = X0;
        MK[1] = X1;
        MK[2] = X2;
        MK[3] = X3;
        int []rk = rkGen(MK,mode);
        for(int i=0; i<32; i++){
            buf[4+i] = F(buf[i],buf[1+i],buf[2+i],buf[3+i],rk[i]);
//            System.out.printf("rk["+i+"]= %08x\n",rk[i]);
//            System.out.printf("X["+i+"]= %08x\n",buf[4+i]);
        }

        for(int i=buf.length; i>buf.length-4;i--){
            System.out.printf("%08X",buf[i-1]);
        }
    }

    int[] rkGen(int MK[] ,int mode) {
        int k[] = new int[36];
        int rk[] = new int[32];

        k[0] = (MK[0] ^ FK[0]);
        k[1] = (MK[1]) ^ FK[1];
        k[2] = (MK[2]) ^ FK[2];
        k[3] = (MK[3]) ^ FK[3];

        for (int i = 0; i < 32; i++) {
            k[i + 4] = k[i] ^ (T_(k[i + 1] ^ k[i + 2] ^ k[i + 3] ^ CK[i]));
            rk[i] = k[i+4];
        }
        if(mode != 1){
            int decrypt_rk[] = new int[32];
            for(int i=0; i<32; i++){
                decrypt_rk[i] = rk[31-i];
            }
            return decrypt_rk;
        }
        return rk;
    }

    int T_(int A) {
        return L_(t(A));
    }

    public int t(int A) {
        int a0 = (A >> 24) & 0xFF;
        int a1 = (A >> 16) & 0xFF;
        int a2 = (A >> 8) & 0xFF;
        int a3 = (A >> 0) & 0xFF;

        int b0 = Sbox(a0);
        int b1 = Sbox(a1);
        int b2 = Sbox(a2);
        int b3 = Sbox(a3);

        return (((b0 & 0xff) << 24) | ((b1 & 0xff) << 16) | ((b2 & 0xff) << 8) | ((b3 & 0xff) << 0));
    }

    int Rotl(int x, int y){
        return x<<y | x>>>(32-y);
    }

    int L_(int B) {
        return (B) ^ Rotl(B,13) ^ Rotl(B,23);
    }

    public int F(int X0, int X1, int X2, int X3, int rk) {
        return X0 ^ T(X1 ^ X2 ^ X3 ^ rk);
    }


    public int T(int v) {
        return L(t(v));
    }


    public int L(int B) {
        return B ^ Rotl(B,2) ^ Rotl(B,10) ^ Rotl(B,18) ^ Rotl(B,24);
    }

    public int Sbox(int a) {
        int h = (a & 0x0f0) >> 4;
        int l = (a & 0x0f);
        return SboxTable[h][l];
    }

}
  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值