一，whirlpool算法介绍
whirlpool算法用于生成消息摘要。
该算法输入长度小于2^256位，输出长度为512位。分组长度为512位，预留的明文长度填充为256位。
该算法使用512位的密钥，参考了分组密码的思路，使用轮函数加迭代，算法结构与AES相似。
二，填充说明
若分组不够512bit，则进行填充。第一位填充1，其余位填充0，最后剩余256位填充明文的长度。
若分组不够512bit，但超过256bit，则需再扩充512bit以便填入明文长度。
三，代码实现
1 #include<bits/stdc++.h> 2 using namespace std; 3 vector<int> X;//8*64=512，每个下标存放8位 4 int Turn;//加密分组数量 5 int A[64],B[64],K[64],Ciph[64];//k为密钥 6 int subK[11][64]; //11个轮密钥 7 int S[256]={ //S盒 8 0x68,0x10,0xeb,0x2b,0x48,0x9d,0x6a,0xe4, 9 0xe3,0xa3,0x56,0x81,0x7d,0xf1,0x85,0x93, 10 0x2c,0x8e,0x78,0xca,0x17,0xa9,0x61,0xd5, 11 0x5d,0x0b,0x8c,0x3c,0x77,0x51,0x22,0x42, 12 0x3f,0x54,0x41,0x80,0xcc,0x86,0xb3,0x18, 13 0x2e,0x57,0x06,0x62,0xf4,0x36,0xd1,0x6b, 14 0x1b,0x65,0x75,0x10,0xda,0x49,0x26,0xf9, 15 0xcb,0x66,0xe7,0xba,0xae,0x50,0x52,0xab, 16 0x05,0xf0,0x0d,0x73,0x3b,0x04,0x20,0xfe, 17 0xdd,0xf5,0xb4,0x5f,0x0a,0xb5,0xc0,0xa0, 18 0x71,0xa5,0x2d,0x60,0x72,0x93,0x39,0x08, 19 0x83,0x21,0x5c,0x87,0xb1,0xe0,0x00,0xc3, 20 0x12,0x91,0x8a,0x02,0x1c,0xe6,0x45,0xc2, 21 0xc4,0xfd,0xbf,0x44,0xa1,0x4c,0x33,0xc5, 22 0x84,0x23,0x7c,0xb0,0x25,0x15,0x35,0x69, 23 0xff,0x94,0x4d,0x70,0xa2,0xaf,0xcd,0xd6, 24 0x6c,0xb7,0xf8,0x09,0xf3,0x67,0xa4,0xea, 25 0xec,0xb6,0xd4,0xd2,0x14,0x1e,0xe1,0x24, 26 0x38,0xc6,0xdb,0x4b,0x7a,0x3a,0xde,0x5e, 27 0xdf,0x95,0xfc,0xaa,0xd7,0xce,0x07,0x0f, 28 0x3d,0x58,0x9a,0x98,0x9c,0xf2,0xa7,0x11, 29 0x7e,0x8b,0x43,0x03,0xe2,0xdc,0xe5,0xb2, 30 0x4e,0xc7,0x6d,0xe9,0x27,0x40,0xd8,0x37, 31 0x92,0x8f,0x01,0x1d,0x53,0x3e,0x59,0xc1, 32 0x4f,0x32,0x16,0xfa,0x74,0xfb,0x63,0x9f, 33 0x34,0x1a,0x2a,0x5a,0x8d,0xc9,0xcf,0xf6, 34 0x90,0x28,0x88,0x9b,0x31,0x0e,0xbd,0x4a, 35 0xe8,0x96,0xa6,0x0c,0xc8,0x79,0xbc,0xbe, 36 0xef,0x6e,0x46,0x97,0x5b,0xed,0x19,0xd9, 37 0xac,0x99,0xa8,0x29,0x64,0x1f,0xad,0x55, 38 0x13,0xbb,0xf7,0x6f,0xb9,0x47,0x2f,0xee, 39 0xb8,0x7b,0x89,0x30,0xd3,0x7f,0x76,0x82 40 }; 41 int C[64]={//θ变换用到的数组C 42 1,1,3,1,5,8,9,5, 43 5,1,1,3,1,5,8,9, 44 9,5,1,1,3,1,5,8, 45 8,9,5,1,1,3,1,5, 46 5,8,9,5,1,1,3,1, 47 1,5,8,9,5,1,1,3, 48 3,1,5,8,9,5,1,1, 49 1,3,1,5,8,9,5,1 50 }; 51 void printX() {//输出填充后的文本 52 printf("\n明文填充后为：\n"); 53 for (int i = 0; i < X.size(); i++) { 54 printf("%02x", X[i]); 55 if ((i + 1) % 4 == 0) 56 printf(" "); 57 if ((i + 1) % 16 == 0) 58 printf("\n"); 59 } 60 } 61 62 void printC(int T[64]){ //输出512位 63 for(int i=0;i<64;i++) printf("%02x",T[i]); 64 } 65 66 void append(string m) {//文本的填充处理 67 Turn = (m.size() + 32) / 64 + 1;//32*8=256为填充长度的预留位 68 X.resize(Turn * 64); //Turn为分组数 一组512bit 为64个十六进制 69 int i = 0; 70 for (; i < m.size(); i++) { 71 X[i] = m[i]; 72 } 73 X[i++] = 0x80; 74 while (i < X.size() - 32) { 75 X[i] = 0; 76 i++; 77 } 78 long long int a = m.size() * 8; //明文长度 79 for (i = X.size() - 1; i >= X.size() - 32; i--) { 80 X[i] = a % 256; 81 a /= 256; 82 } 83 } 84 85 void appendKey(string m){ //当密钥位数不够时用0扩充 86 if(m.size()>63){ 87 cout<<"密钥应为512位！"<<endl; 88 return; 89 } 90 int i=0; 91 for(;i<m.size();i++) K[i]=m[i]; 92 for(;i<64;i++) K[i]=0; 93 } 94 95 void r_transform(int a[64],int b[64]){//r变换，S盒 96 for(int i=0;i<64;i++) b[i]=S[a[i]]; 97 memcpy(a,b,sizeof(int)*64); 98 } 99 100 void column_transform(int a[64],int b[64]){//列循环变换 101 for(int i=0;i<8;i++){ 102 for(int j=0;j<8;j++) b[8*j+i]=a[((j-i+8)%8)*8+i]; 103 } 104 memcpy(a,b,sizeof(int)*64); 105 } 106 107 void row_mixture(int a[64],int b[64]){//线性扩散变换 108 for(int i=0;i<8;i++) 109 for(int j=0;j<8;j++){ 110 b[8*i+j]=0; 111 for(int k=0;k<8;k++)b[8*i+j]+=a[8*i+k]*C[8*k+j]; 112 b[8*i+j]%=256; 113 } 114 memcpy(a,b,sizeof(int)*64); 115 } 116 117 void add_subkey(int n,int a[64],int b[64]){//密钥加法 118 for(int i=0;i<64;i++) b[i]=a[i]^subK[n][i]; 119 memcpy(a,b,sizeof(int)*64); 120 } 121 122 void one_round(int n,int a[64],int b[64]){ //轮函数 123 r_transform(a,b); 124 column_transform(a,b); 125 row_mixture(a,b); 126 add_subkey(n,a,b); 127 } 128 129 void create_subkey(){ //子密钥导出 130 for(int i=0;i<64;i++) subK[0][i]=K[i]; 131 int Con[64]; //轮常数 132 for(int r=1;r<11;r++){ 133 for(int i=0;i<8;i++) 134 for(int j=0;j<8;j++){ 135 if(i==0) Con[8*i+j]=S[8*(r-1)+j]; 136 else Con[8*i+j]=0x00; 137 } 138 one_round(r-1,Con,subK[r]); 139 } 140 } 141 142 int main(){ 143 string str,strk;//明文 144 cout<<"请输入明文："; 145 cin>>str; 146 cout<<"请输入密钥："; 147 cin>>strk; 148 append(str); //填充明文 149 appendKey(strk); //填充初始密钥 150 create_subkey(); //导出轮密钥 151 cout<<"完整密钥为："<<endl; 152 printC(K); //输出密钥 153 printX(); //输出填充后的文本 154 for(int i=0;i<64;i++) Ciph[i]=0x00; 155 for(int i=0;i<Turn;i++){ 156 for(int j=0;j<64;j++) A[j]=X[i*64+j]; 157 for(int R=0;R<11;R++) one_round(R,A,B); 158 for(int j=0;j<64;j++) Ciph[j]^=A[j]; 159 } 160 cout<<"密文为："<<endl; 161 printC(Ciph); //输出密文 162 return 0; 163 }
四，实现截图
