百度到的论文已给出算法。

flag为1为解密，flag为0是加密。

  1. #include<bits/stdc++.h>
  2. using  namespace std;
  3. typedef long long ll;
  4. #define Rotl(_x,_y) ((_x)<<(_y)|(_x)>>(32-(_y)))
  5. #define SboxTrans(_A) (Sbox[(_A)>>24&0xFF]<<24|Sbox[(_A)>>16&0xFF]<<16|Sbox[(_A)>>8&0xFF]<<8|Sbox[(_A)&0xFF])
  6. #define L1(x) ((x)^Rotl(x,2)^Rotl(x,10)^Rotl(x,18)^Rotl(x,24))
  7. #define L2(x) ((x)^Rotl(x,13)^Rotl(x,23))
  8. const unsigned int CK[] = {
  9.     0x00070e15, 0x1c232a31, 0x383f464d, 0x545b6269,
  10.     0x70777e85, 0x8c939aa1, 0xa8afb6bd, 0xc4cbd2d9,
  11.     0xe0e7eef5, 0xfc030a11, 0x181f262d, 0x343b4249,
  12.     0x50575e65, 0x6c737a81, 0x888f969d, 0xa4abb2b9,
  13.     0xc0c7ced5, 0xdce3eaf1, 0xf8ff060d, 0x141b2229,
  14.     0x30373e45, 0x4c535a61, 0x686f767d, 0x848b9299,
  15.     0xa0a7aeb5, 0xbcc3cad1, 0xd8dfe6ed, 0xf4fb0209,
  16.     0x10171e25, 0x2c333a41, 0x484f565d, 0x646b7279 };
  17. const unsigned int RK[]={0xA3B1BAC6, 0x56AA3350, 0x677D9197, 0xB27022DC};
  18. const unsigned char Sbox[] = {
  19.     0xd6,0x90,0xe9,0xfe,0xcc,0xe1,0x3d,0xb7,0x16,0xb6,0x14,0xc2,0x28,0xfb,0x2c,0x05,
  20.     0x2b,0x67,0x9a,0x76,0x2a,0xbe,0x04,0xc3,0xaa,0x44,0x13,0x26,0x49,0x86,0x06,0x99,
  21.     0x9c,0x42,0x50,0xf4,0x91,0xef,0x98,0x7a,0x33,0x54,0x0b,0x43,0xed,0xcf,0xac,0x62,
  22.     0xe4,0xb3,0x1c,0xa9,0xc9,0x08,0xe8,0x95,0x80,0xdf,0x94,0xfa,0x75,0x8f,0x3f,0xa6,
  23.     0x47,0x07,0xa7,0xfc,0xf3,0x73,0x17,0xba,0x83,0x59,0x3c,0x19,0xe6,0x85,0x4f,0xa8,
  24.     0x68,0x6b,0x81,0xb2,0x71,0x64,0xda,0x8b,0xf8,0xeb,0x0f,0x4b,0x70,0x56,0x9d,0x35,
  25.     0x1e,0x24,0x0e,0x5e,0x63,0x58,0xd1,0xa2,0x25,0x22,0x7c,0x3b,0x01,0x21,0x78,0x87,
  26.     0xd4,0x00,0x46,0x57,0x9f,0xd3,0x27,0x52,0x4c,0x36,0x02,0xe7,0xa0,0xc4,0xc8,0x9e,
  27.     0xea,0xbf,0x8a,0xd2,0x40,0xc7,0x38,0xb5,0xa3,0xf7,0xf2,0xce,0xf9,0x61,0x15,0xa1,
  28.     0xe0,0xae,0x5d,0xa4,0x9b,0x34,0x1a,0x55,0xad,0x93,0x32,0x30,0xf5,0x8c,0xb1,0xe3,
  29.     0x1d,0xf6,0xe2,0x2e,0x82,0x66,0xca,0x60,0xc0,0x29,0x23,0xab,0x0d,0x53,0x4e,0x6f,
  30.     0xd5,0xdb,0x37,0x45,0xde,0xfd,0x8e,0x2f,0x03,0xff,0x6a,0x72,0x6d,0x6c,0x5b,0x51,
  31.     0x8d,0x1b,0xaf,0x92,0xbb,0xdd,0xbc,0x7f,0x11,0xd9,0x5c,0x41,0x1f,0x10,0x5a,0xd8,
  32.     0x0a,0xc1,0x31,0x88,0xa5,0xcd,0x7b,0xbd,0x2d,0x74,0xd0,0x12,0xb8,0xe5,0xb4,0xb0,
  33.     0x89,0x69,0x97,0x4a,0x0c,0x96,0x77,0x7e,0x65,0xb9,0xf1,0x09,0xc5,0x6e,0xc6,0x84,
  34.     0x18,0xf0,0x7d,0xec,0x3a,0xdc,0x4d,0x20,0x79,0xee,0x5f,0x3e,0xd7,0xcb,0x39,0x48
  35. };
  36. //const unsigned int Rotl(unsigned int n,int b){ return n<<b|n>>(32-b); }
  37. unsigned int xx[];
  38. void SM4KeyExt(unsigned int *key,unsigned int *rk, unsigned int CryptFlag){//秘钥扩展算法,flag为1代表解密
  39.     unsigned int r,tmp,k0,k1,k2,k3;
  40.     k0=key[]^RK[];
  41.     k1=key[]^RK[];
  42.     k2=key[]^RK[];
  43.     k3=key[]^RK[];
  44.     for(r=;r<;r+=){
  45.         /*rk(i) = k(4+i) = k(i) xor T[k(i+1) xor k(i+2) xor k(i+3) xor CK(i)]*/
  46.         /*合成置换T的过程包括非线性变换（ByteSub函数，从SBox中查找）和线性变换（L2函数，移位和异或运算）*/
  47.         tmp=k1^k2^k3^CK[r+];
  48.         tmp=SboxTrans(tmp);
  49.         k0=k0^L2(tmp);
  50.         rk[r+]=k0;  
  51.  
  52.         tmp=k2^k3^k0^CK[r + ];
  53.         tmp=SboxTrans(tmp);
  54.         k1=k1^L2(tmp);
  55.         rk[r+]=k1;  
  56.  
  57.         tmp= k3^k0^k1^CK[r+];
  58.         tmp=SboxTrans(tmp);
  59.         k2=k2^L2(tmp);
  60.         rk[r+]=k2;  
  61.  
  62.         tmp=k0^k1^k2^CK[r + ];
  63.         tmp=SboxTrans(tmp);
  64.         k3=k3^L2(tmp);
  65.         rk[r+]=k3;
  66.     }
  67.     if(CryptFlag==){
  68.         for(r=;r<;r++) swap(rk[r],rk[-r]);
  69.     }
  70. }
  71.  
  72. void SM4Crypt(unsigned int *Input, unsigned int *Output, unsigned int *rk){
  73.     unsigned int r, tmp, x0, x1, x2, x3, *y;
  74.     y=(unsigned int *)Input;
  75.     x0=y[];
  76.     x1=y[];
  77.     x2=y[];
  78.     x3=y[];
  79.     for (r=;r<;r+=){
  80.         /*x4 = x0 ^ T(x1 ^ x2 ^ x3 ^ rk[0])*/
  81.         tmp=x1^x2^x3^rk[r+];
  82.         tmp=SboxTrans(tmp);
  83.         x0^=L1(tmp);
  84.           xx[r+]=x0;
  85.         tmp=x2^x3^x0^rk[r+];
  86.         tmp=SboxTrans(tmp);
  87.         x1^=L1(tmp);
  88.           xx[r+]=x1;
  89.         tmp=x3^x0^x1^rk[r+];
  90.         tmp=SboxTrans(tmp);
  91.         x2^=L1(tmp);
  92.           xx[r+]=x2;
  93.         tmp=x0^x1^x2^rk[r+];
  94.         tmp=SboxTrans(tmp);
  95.         x3^=L1(tmp);
  96.         xx[r+]=x3;
  97.     }
  98.     y=(unsigned int *)Output;
  99.     /*(y0,y1,y2,y3) = (x35,x34,x33,x32)*/
  100.     y[]=x3;
  101.     y[]=x2;
  102.     y[]=x1;
  103.     y[]=x0;
  104. }
  105.  
  106. unsigned int key[]={0x01234567,0x89abcdef,0xfedcba98,0x76543210};
  107. unsigned int miwen[]={0x595298c7,0xc6fd271f,0x0402f804,0xc33d3f66};
  108. unsigned int mingwen[]={0x01234567,0x89abcdef,0xfedcba98,0x76543210};
  109. unsigned int rk[];
  110. unsigned int output[]={};
  111. void solve1(){
  112.     printf("题目1:\n");
  113.     SM4KeyExt(key,rk,);
  114.     printf("rk数组:\n");
  115.     for(int i=;i<;i++) printf("%08x\n",rk[i]);
  116.     printf("\n");
  117.     printf("x数组：\n");
  118.     SM4Crypt(mingwen,output,rk);
  119.     for(int i=;i<;i++) printf("%08x\n",xx[i]);
  120.     printf("结果：\n");
  121.     for(int i=;i<;i++) printf("%08x ",output[i]);
  122.     printf("\n");
  123. }
  124. void solve2(){
  125.     printf("题目2：\n");
  126.     SM4KeyExt(key,rk,);
  127.     for(int i=;i<;i++){
  128.         SM4Crypt(mingwen,mingwen,rk);
  129.     }
  130.     for(int i=;i<;i++) cout<<hex<<mingwen[i]<<" ";
  131.     cout<<"\n";
  132. }
  133. int main(){
  134.     //freopen("out.txt","w",stdout);
  135.     solve1();
  136.     solve2();
  137.     return ;
  138. }

将模板缩减了一下，sbox的结果是unsigned char，进行移位运算之后是int，SboxTrans的结果为int，右移是算术右移导致出错，最好分开写或者强转。

  1. #include<bits/stdc++.h>
  2. using  namespace std;
  3. typedef long long ll;
  4. #define Rotl(_x,_y) ((_x)<<(_y)|(_x)>>(32-(_y)))
  5. #define SboxTrans(_A) (Sbox[(_A)>>24&0xFF]<<24|Sbox[(_A)>>16&0xFF]<<16|Sbox[(_A)>>8&0xFF]<<8|Sbox[(_A)&0xFF])
  6. #define L1(x) ((x)^Rotl(x,2)^Rotl(x,10)^Rotl(x,18)^Rotl(x,24))
  7. #define L2(x) ((x)^Rotl(x,13)^Rotl(x,23))
  8. const unsigned int CK[] = {
  9.     0x00070e15, 0x1c232a31, 0x383f464d, 0x545b6269,
  10.     0x70777e85, 0x8c939aa1, 0xa8afb6bd, 0xc4cbd2d9,
  11.     0xe0e7eef5, 0xfc030a11, 0x181f262d, 0x343b4249,
  12.     0x50575e65, 0x6c737a81, 0x888f969d, 0xa4abb2b9,
  13.     0xc0c7ced5, 0xdce3eaf1, 0xf8ff060d, 0x141b2229,
  14.     0x30373e45, 0x4c535a61, 0x686f767d, 0x848b9299,
  15.     0xa0a7aeb5, 0xbcc3cad1, 0xd8dfe6ed, 0xf4fb0209,
  16.     0x10171e25, 0x2c333a41, 0x484f565d, 0x646b7279 };
  17. const unsigned int RK[]={0xA3B1BAC6, 0x56AA3350, 0x677D9197, 0xB27022DC};
  18. const unsigned char Sbox[] = {
  19.     0xd6,0x90,0xe9,0xfe,0xcc,0xe1,0x3d,0xb7,0x16,0xb6,0x14,0xc2,0x28,0xfb,0x2c,0x05,
  20.     0x2b,0x67,0x9a,0x76,0x2a,0xbe,0x04,0xc3,0xaa,0x44,0x13,0x26,0x49,0x86,0x06,0x99,
  21.     0x9c,0x42,0x50,0xf4,0x91,0xef,0x98,0x7a,0x33,0x54,0x0b,0x43,0xed,0xcf,0xac,0x62,
  22.     0xe4,0xb3,0x1c,0xa9,0xc9,0x08,0xe8,0x95,0x80,0xdf,0x94,0xfa,0x75,0x8f,0x3f,0xa6,
  23.     0x47,0x07,0xa7,0xfc,0xf3,0x73,0x17,0xba,0x83,0x59,0x3c,0x19,0xe6,0x85,0x4f,0xa8,
  24.     0x68,0x6b,0x81,0xb2,0x71,0x64,0xda,0x8b,0xf8,0xeb,0x0f,0x4b,0x70,0x56,0x9d,0x35,
  25.     0x1e,0x24,0x0e,0x5e,0x63,0x58,0xd1,0xa2,0x25,0x22,0x7c,0x3b,0x01,0x21,0x78,0x87,
  26.     0xd4,0x00,0x46,0x57,0x9f,0xd3,0x27,0x52,0x4c,0x36,0x02,0xe7,0xa0,0xc4,0xc8,0x9e,
  27.     0xea,0xbf,0x8a,0xd2,0x40,0xc7,0x38,0xb5,0xa3,0xf7,0xf2,0xce,0xf9,0x61,0x15,0xa1,
  28.     0xe0,0xae,0x5d,0xa4,0x9b,0x34,0x1a,0x55,0xad,0x93,0x32,0x30,0xf5,0x8c,0xb1,0xe3,
  29.     0x1d,0xf6,0xe2,0x2e,0x82,0x66,0xca,0x60,0xc0,0x29,0x23,0xab,0x0d,0x53,0x4e,0x6f,
  30.     0xd5,0xdb,0x37,0x45,0xde,0xfd,0x8e,0x2f,0x03,0xff,0x6a,0x72,0x6d,0x6c,0x5b,0x51,
  31.     0x8d,0x1b,0xaf,0x92,0xbb,0xdd,0xbc,0x7f,0x11,0xd9,0x5c,0x41,0x1f,0x10,0x5a,0xd8,
  32.     0x0a,0xc1,0x31,0x88,0xa5,0xcd,0x7b,0xbd,0x2d,0x74,0xd0,0x12,0xb8,0xe5,0xb4,0xb0,
  33.     0x89,0x69,0x97,0x4a,0x0c,0x96,0x77,0x7e,0x65,0xb9,0xf1,0x09,0xc5,0x6e,0xc6,0x84,
  34.     0x18,0xf0,0x7d,0xec,0x3a,0xdc,0x4d,0x20,0x79,0xee,0x5f,0x3e,0xd7,0xcb,0x39,0x48
  35. };
  36. //const unsigned int Rotl(unsigned int n,int b){ return n<<b|n>>(32-b); }
  37. unsigned int xx[];
  38. void SM4KeyExt(unsigned int *key,unsigned int *rk, unsigned int CryptFlag){//秘钥扩展算法,flag为1代表解密
  39.     unsigned int r,tmp,k[];
  40.     for(int i=;i<;i++) k[i]=key[i]^RK[i];
  41.     for(int i=;i<;i+=){
  42.         for(int j=;j<;j++){
  43.             tmp=SboxTrans(k[(j+)%]^k[(j+)%]^k[(j+)%]^CK[i+j]);
  44.             rk[i+j]=k[j]^=L2(tmp);
  45.         }
  46.     }
  47.     if(CryptFlag==) for(r=;r<;r++) swap(rk[r],rk[-r]);  
  48.  
  49. }
  50.  
  51. void SM4Crypt(unsigned int *Input, unsigned int *Output, unsigned int *rk){
  52.     unsigned int tmp, x[], *y;
  53.     y=(unsigned int *)Input;
  54.     for(int i=;i<;i++) x[i]=y[i];
  55.     for(int i=;i<;i+=){
  56.         for(int j=;j<;j++){
  57.             tmp=SboxTrans(x[(j+)%]^x[(j+)%]^x[(j+)%]^rk[i+j]);//为什么这样就好了？
  58.             x[j]^=L1(tmp);
  59.             xx[i+j]=x[j];
  60.         }
  61.     }
  62.     y=(unsigned int *)Output;
  63.     for(int i=;i<;i++) y[i]=x[-i];
  64. }
  65.  
  66. unsigned int key[]={0x01234567,0x89abcdef,0xfedcba98,0x76543210};
  67. unsigned int miwen[]={0x595298c7,0xc6fd271f,0x0402f804,0xc33d3f66};
  68. unsigned int mingwen[]={0x01234567,0x89abcdef,0xfedcba98,0x76543210};
  69. unsigned int rk[];
  70. unsigned int output[]={};
  71. void solve1(){
  72.     printf("题目1:\n");
  73.     SM4KeyExt(key,rk,);
  74.     printf("rk数组:\n");
  75.     for(int i=;i<;i++) printf("%08x\n",rk[i]);
  76.     printf("\n");
  77.     printf("x数组：\n");
  78.     SM4Crypt(mingwen,output,rk);
  79.     for(int i=;i<;i++) printf("%08x\n",xx[i]);
  80.     printf("结果：\n");
  81.     for(int i=;i<;i++) printf("%08x ",output[i]);
  82.     printf("\n");
  83. }
  84. void solve2(){
  85.     printf("题目2：\n");
  86.     SM4KeyExt(key,rk,);
  87.     for(int i=;i<;i++){
  88.         SM4Crypt(mingwen,mingwen,rk);
  89.     }
  90.     for(int i=;i<;i++) cout<<hex<<mingwen[i]<<" ";
  91.     cout<<"\n";
  92. }
  93. int main(){
  94.     //freopen("out.txt","w",stdout);
  95.     solve1();
  96.     solve2();
  97.     return ;
  98. }

坑爹的错误

  1. #include<bits/stdc++.h>
  2. using  namespace std;
  3. typedef long long ll;
  4. #define Rotl(_x,_y) ((_x)<<(_y)|(_x)>>(32-(_y)))
  5. #define SboxTrans(_A) (Sbox[(_A)>>24&0xFF]<<24|Sbox[(_A)>>16&0xFF]<<16|Sbox[(_A)>>8&0xFF]<<8|Sbox[(_A)&0xFF])
  6. #define L1(x) ((x)^Rotl(x,2)^Rotl(x,10)^Rotl(x,18)^Rotl(x,24))
  7. #define L2(x) ((x)^Rotl(x,13)^Rotl(x,23))
  8. const unsigned int CK[] = {
  9.     0x00070e15, 0x1c232a31, 0x383f464d, 0x545b6269,
  10.     0x70777e85, 0x8c939aa1, 0xa8afb6bd, 0xc4cbd2d9,
  11.     0xe0e7eef5, 0xfc030a11, 0x181f262d, 0x343b4249,
  12.     0x50575e65, 0x6c737a81, 0x888f969d, 0xa4abb2b9,
  13.     0xc0c7ced5, 0xdce3eaf1, 0xf8ff060d, 0x141b2229,
  14.     0x30373e45, 0x4c535a61, 0x686f767d, 0x848b9299,
  15.     0xa0a7aeb5, 0xbcc3cad1, 0xd8dfe6ed, 0xf4fb0209,
  16.     0x10171e25, 0x2c333a41, 0x484f565d, 0x646b7279 };
  17. const unsigned int RK[]={0xA3B1BAC6, 0x56AA3350, 0x677D9197, 0xB27022DC};
  18. const unsigned char Sbox[] = {
  19.     0xd6,0x90,0xe9,0xfe,0xcc,0xe1,0x3d,0xb7,0x16,0xb6,0x14,0xc2,0x28,0xfb,0x2c,0x05,
  20.     0x2b,0x67,0x9a,0x76,0x2a,0xbe,0x04,0xc3,0xaa,0x44,0x13,0x26,0x49,0x86,0x06,0x99,
  21.     0x9c,0x42,0x50,0xf4,0x91,0xef,0x98,0x7a,0x33,0x54,0x0b,0x43,0xed,0xcf,0xac,0x62,
  22.     0xe4,0xb3,0x1c,0xa9,0xc9,0x08,0xe8,0x95,0x80,0xdf,0x94,0xfa,0x75,0x8f,0x3f,0xa6,
  23.     0x47,0x07,0xa7,0xfc,0xf3,0x73,0x17,0xba,0x83,0x59,0x3c,0x19,0xe6,0x85,0x4f,0xa8,
  24.     0x68,0x6b,0x81,0xb2,0x71,0x64,0xda,0x8b,0xf8,0xeb,0x0f,0x4b,0x70,0x56,0x9d,0x35,
  25.     0x1e,0x24,0x0e,0x5e,0x63,0x58,0xd1,0xa2,0x25,0x22,0x7c,0x3b,0x01,0x21,0x78,0x87,
  26.     0xd4,0x00,0x46,0x57,0x9f,0xd3,0x27,0x52,0x4c,0x36,0x02,0xe7,0xa0,0xc4,0xc8,0x9e,
  27.     0xea,0xbf,0x8a,0xd2,0x40,0xc7,0x38,0xb5,0xa3,0xf7,0xf2,0xce,0xf9,0x61,0x15,0xa1,
  28.     0xe0,0xae,0x5d,0xa4,0x9b,0x34,0x1a,0x55,0xad,0x93,0x32,0x30,0xf5,0x8c,0xb1,0xe3,
  29.     0x1d,0xf6,0xe2,0x2e,0x82,0x66,0xca,0x60,0xc0,0x29,0x23,0xab,0x0d,0x53,0x4e,0x6f,
  30.     0xd5,0xdb,0x37,0x45,0xde,0xfd,0x8e,0x2f,0x03,0xff,0x6a,0x72,0x6d,0x6c,0x5b,0x51,
  31.     0x8d,0x1b,0xaf,0x92,0xbb,0xdd,0xbc,0x7f,0x11,0xd9,0x5c,0x41,0x1f,0x10,0x5a,0xd8,
  32.     0x0a,0xc1,0x31,0x88,0xa5,0xcd,0x7b,0xbd,0x2d,0x74,0xd0,0x12,0xb8,0xe5,0xb4,0xb0,
  33.     0x89,0x69,0x97,0x4a,0x0c,0x96,0x77,0x7e,0x65,0xb9,0xf1,0x09,0xc5,0x6e,0xc6,0x84,
  34.     0x18,0xf0,0x7d,0xec,0x3a,0xdc,0x4d,0x20,0x79,0xee,0x5f,0x3e,0xd7,0xcb,0x39,0x48
  35. };
  36. //const unsigned int Rotl(unsigned int n,int b){ return n<<b|n>>(32-b); }
  37. unsigned int xx[];
  38. void SM4KeyExt(unsigned int *key,unsigned int *rk, unsigned int CryptFlag){//秘钥扩展算法,flag为1代表解密
  39.     unsigned int r,tmp,k[];
  40.     for(int i=;i<;i++) k[i]=key[i]^RK[i];
  41.     for(int i=;i<;i+=){
  42.         for(int j=;j<;j++){
  43.             k[j]^=L2((unsigned int)SboxTrans(k[(j+)%]^k[(j+)%]^k[(j+)%]^CK[i+j]));
  44.             rk[i+j]=k[j];
  45.         }
  46.     }
  47.     if(CryptFlag==) for(r=;r<;r++) swap(rk[r],rk[-r]);  
  48.  
  49. }
  50.  
  51. void SM4Crypt(unsigned int *Input, unsigned int *Output, unsigned int *rk){
  52.     unsigned int tmp, x[], *y;
  53.     y=(unsigned int *)Input;
  54.     for(int i=;i<;i++) x[i]=y[i];
  55.     for(int i=;i<;i+=){
  56.         for(int j=;j<;j++){
  57.             x[j]^=L1((unsigned int)SboxTrans(x[(j+)%]^x[(j+)%]^x[(j+)%]^rk[i+j]));
  58.             xx[i+j]=x[j];
  59.         }
  60.     }
  61.     y=(unsigned int *)Output;
  62.     for(int i=;i<;i++) y[i]=x[-i];
  63. }
  64.  
  65. unsigned int key[]={0x01234567,0x89abcdef,0xfedcba98,0x76543210};
  66. unsigned int miwen[]={0x595298c7,0xc6fd271f,0x0402f804,0xc33d3f66};
  67. unsigned int mingwen[]={0x01234567,0x89abcdef,0xfedcba98,0x76543210};
  68. unsigned int rk[];
  69. unsigned int output[]={};
  70. void solve1(){
  71.     printf("题目1:\n");
  72.     SM4KeyExt(key,rk,);
  73.     printf("rk数组:\n");
  74.     for(int i=;i<;i++) printf("%08x\n",rk[i]);
  75.     printf("\n");
  76.     printf("x数组：\n");
  77.     SM4Crypt(mingwen,output,rk);
  78.     for(int i=;i<;i++) printf("%08x\n",xx[i]);
  79.     printf("结果：\n");
  80.     for(int i=;i<;i++) printf("%08x ",output[i]);
  81.     printf("\n");
  82. }
  83. void solve2(){
  84.     printf("题目2：\n");
  85.     SM4KeyExt(key,rk,);
  86.     for(int i=;i<;i++){
  87.         SM4Crypt(mingwen,mingwen,rk);
  88.     }
  89.     for(int i=;i<;i++) cout<<hex<<mingwen[i]<<" ";
  90.     cout<<"\n";
  91. }
  92. int main(){
  93.     //freopen("out.txt","w",stdout);
  94.     solve1();
  95.     solve2();
  96.     return ;
  97. }

SM4算法的c++实现的更多相关文章

  1. sm4算法（附源码、测试代码）

    from:http://blog.csdn.net/mao0514/article/details/52930944 SM4是我们自己国家的一个分组密码算法,是国家密码管理局于2012年发布的.网址戳 ...

  2. SM4密码算法（附源码）

    SM4是我们自己国家的一个分组密码算法,是国家密码管理局于2012年发布的.网址戳→_→:http://www.cnnic.NET.cn/jscx/mixbz/sm4/ 具体的密码标准和算法官方有非常 ...

  3. 关于国密算法 SM1，SM2，SM3，SM4 的笔记

    国密即国家密码局认定的国产密码算法.主要有SM1,SM2,SM3,SM4.密钥长度和分组长度均为128位. SM1 为对称加密.其加密强度与AES相当.该算法不公开,调用该算法时,需要通过加密芯片的接 ...

  4. SM系列国密算法（转）

    原文地址:科普一下SM系列国密算法(从零开始学区块链 189) 众所周知,为了保障商用密码的安全性,国家商用密码管理办公室制定了一系列密码标准,包括SM1(SCB2).SM2.SM3.SM4.SM7. ...

  5. Java国密相关算法（bouncycastle）

    公用类算法: PCIKeyPair.java /** * @Author: dzy * @Date: 2018/9/27 14:18 * @Describe: 公私钥对 */ @Data @AllAr ...

  6. 2017-2018-2 20179207 《网络攻防技术》第十三周作业 python3实现SM234算法

    国密算法SM234 的python3实现 国家标准 GM/T 0002-2012 <SM4分组密码算法> GM/T 0003.1-2012 <SM2椭圆曲线公钥密码算法 第1部分:总 ...

  7. 2017-2018-2 20179204《网络攻防实践》第十三周学习总结 python实现国密算法

    国密商用算法是指国密SM系列算法,包括基于椭圆曲线的非对称公钥密码SM2算法.密码杂凑SM3算法.分组密码SM4算法,还有只以IP核形式提供的非公开算法流程的对称密码SM1算法等. 第1节 SM2非对 ...

  8. 【原创】SM4password算法源代码接口具体解释

    [原创]SM4password算法源代码接口具体解释 近期几天想把cryptdb的加密算法换成国产的sm4加密算法.所以花了时间研究了一下sm4的源代码和基本原理,避免忘记,写下这篇博客以作记录. 先 ...

  9. OpenSSL 1.1.1 国密算法支持

    OpenSSL 1.1.1 国密算法支持 https://www.openssl.org/ https://github.com/openssl/openssl OpenSSL 1.1.1 新特性: ...

随机推荐

  1. rails 注释

    view -# js.erb <%# xxxx %> 单行注释

  2. 培训笔记——Linux目录说明

    一般我们的电脑里都只有一块硬盘,但是这块硬盘怎么使用呢? 我们的头脑里大体有个分区的概念,为什么要分区呢? 不是很清楚,不过有句话说 不要把鸡蛋放在同一个篮子里,可能有这种考虑吧. 好,最起码知道分区 ...

  3. [原创]java WEB学习笔记27：深入理解面向接口编程

    本博客为原创:综合 尚硅谷(http://www.atguigu.com)的系统教程(深表感谢)和 网络上的现有资源(博客,文档,图书等),资源的出处我会标明 本博客的目的:①总结自己的学习过程,相当 ...

  4. [GUI] QT事件与X11的关系

    做了一段时间linux下与QT事件相关的工作,经常会遇到X11,总是苦于无法完全理解其与linux以及QT事件之间的关系,所以用两篇文章来简单总结下linux中的图形管理和QT事件与X11的关系. & ...

  5. MongoDB分片搭建

    环境 $ cat /etc/redhat-release CentOS Linux release 7.0.1406 (Core) $ uname -a Linux zhaopin-2-201 3.1 ...

  6. 剑指offer之 二叉搜索树与双向链表

    class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) ...

  7. LINQ 学习路程 -- 查询操作 where

    1.where Filtering Operators Description Where Returns values from the collection based on a predicat ...

  8. linux新增用户和删除用户

    新增用户 新增用户命令:useradd 参数: 参数 说明 -u 指定UID,也就是自定义UID -g 知道GID,也就是初始化用户组,/etc/passwd文件中的第四个字段. -G 后面接用户组的 ...

  9. delphi完美经典-第16章 Delphi数据库程序设计----使用BDE组件

    第16章 Delphi数据库程序设计----使用BDE组件 Delphi访问数据库的方式有:ADO.BDE.dbExpress.InterBase Express. 一.TDataSet组件 虽然De ...

  10. 单机版 RedisPoolUtil（{基本操作封装工具类}）【一】

    <!--集成的RedisJAR--> <!--引入jedis需的jar包--> <dependency> <groupId>redis.clients& ...