#include<bits/stdc++.h>
using namespace std;
int pc[56]={
57,49,41,33,25,17,9,1,58,50,42,34,26,18,10,2,59,51,43,35,27,19,11,3,60,52
,44,36,63,55,47,39,31,23,15,7,62,54,46,38,30,22,14,6,61,53,45,37,29,21,13,5,28,20,12,4};
int pc_16[16]={1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};
int pc_16_k[48]={
14,17,11,24,1,5,
3,28,15,6,21,10,
23,19,12,4,26,8,
16,7,27,20,13,2,
41,52,31,37,47,55,
30,40,51,45,33,48,
44,49,39,56,34,53,
46,42,50,36,29,32};
//子密钥
vector<string> runPc(string s){
string res;
for(int i=0;i<56;i++){
res+=s[pc[i]-1];
}
//return res;
//十六轮迭代，得到子密钥c，d 28+28
cout<<"------------C D-----------\n\n";
string d0[17],d1[17];
d0[0]=string(res.begin(),res.begin()+28);
d1[0]=string(res.begin()+28,res.end());
for(int i=1;i<17;i++){
d0[i]=string(d0[i-1].begin()+pc_16[i-1],d0[i-1].end())+string(d0[i-1].begin(),d0[i-1].begin()+pc_16[i-1]);
d1[i]=string(d1[i-1].begin()+pc_16[i-1],d1[i-1].end())+string(d1[i-1].begin(),d1[i-1].begin()+pc_16[i-1]);
cout<<d0[i]<<" "<<d1[i]<<endl;
}
cout<<"\n\n\n--------------------k-----------------\n\n";
//十六论迭代，子密钥k,48b
vector<string> k_child(16);
for(int k=0;k<16;k++){
string cd=d0[k+1]+d1[k+1];
for(int i=0;i<48;i++){
k_child[k]+=cd[pc_16_k[i]-1];
}
cout<<k_child[k]<<endl;
}
return k_child;
}
int s_box[8][4][16]={
//s1
{
{14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7},
{0,15,7,4,14,2,13,1,10,6,12,11,9,5,3,8},
{4,1,14,8,13,6,2,11,15,12,9,7,3,10,5,0},
{15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13}
},
//s2
{
{15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10},
{3,13,4,7,15,2,8,14,12,0,1,10,6,9,11,5},
{0,14,7,11,10,4,13,1,5,8,12,6,9,3,2,15},
{13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9}
},
//s3
{
{10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8},
{13,7,0,9,3,4,6,10,2,8,5,14,12,11,15,1},
{13,6,4,9,8,15,3,0,11,1,2,12,5,10,14,7},
{1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12}
},
//s4
{
{7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15},
{13,8,11,5,6,15,0,3,4,7,2,12,1,10,14,9},
{10,6,9,0,12,11,7,13,15,1,3,14,5,2,8,4},
{3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14}
},
//s5
{
{2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9},
{14,11,2,12,4,7,13,1,5,0,15,10,3,9,8,6},
{4,2,1,11,10,13,7,8,15,9,12,5,6,3,0,14},
{11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3}
},
//s6
{
{12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11},
{10,15,4,2,7,12,9,5,6,1,13,14,0,11,3,8},
{9,14,15,5,2,8,12,3,7,0,4,10,1,13,11,6},
{4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13}
},
//s7
{
{4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1},
{13,0,11,7,4,9,1,10,14,3,5,12,2,15,8,6},
{1,4,11,13,12,3,7,14,10,15,6,8,0,5,9,2},
{6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12}
},
//s8
{
{13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7},
{1,15,13,8,10,3,7,4,12,5,6,11,0,14,9,2},
{7,11,4,1,9,12,14,2,0,6,10,13,15,3,5,8},
{2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11}
}
};
string Xor(string x,string y){
string res;
for(int i=0;i<x.size();i++){
if(x[i]==y[i])res+='0';
else res+='1';
}
return res;
}
string str_int(int res){ //int ---> string
string ret;
if(res>=8){
ret+='1';
res-=8;
}else{
ret+='0';
}
if(res>=4){
ret+='1';
res-=4;
}else{
ret+='0';
}
if(res>=2){
ret+='1';
res-=2;
}else{
ret+='0';
}
if(res>=1){
ret+='1';
res-=1;
}else{
ret+='0';
}
return ret;
}
string f_box(string s,int id){ //6-4
int x = (s[0]-'0')*2+(s[5]-'0');
int y = (s[1]-'0')*8+(s[2]-'0')*4+(s[3]-'0')*2+(s[4]-'0');
int res = s_box[id][x][y];
return str_int(res);
}
string f_boxs(string s){//48 - 32
string res;
for(int i=0,j=0;i<48;i+=6,j++){
res+=f_box(string(s.begin()+i,s.begin()+i+6),j);
}
return res;
}
string f(string l,string r,string k){
int pc[48]={
32,1,2,3,4,5,
4,5,6,7,8,9,
8,9,10,11,12,13,
12,13,14,15,16,17,
16,17,18,19,20,21,
20,21,22,23,24,25,
24,25,26,27,28,29,
28,29,30,31,32,1};
string rs;
for(int i=0;i<48;i++){ //32-48
rs+=r[pc[i]-1];
}
//cout<<rs<<endl;
rs=Xor(rs,k); // 48^48
//cout<<r<<endl;
rs=f_boxs(rs); //48-32
//单纯变换
string rsx;
int pd[32]={16,7,20,21,29,12,28,17,1,15,23,26,5,18,31,10,2,8,24,14,32,27,3,9,19,13,30,6,22,11,4,25};
for(int i=0;i<32;i++){
rsx+=rs[pd[i]-1];
}
//cout<<rs<<endl;
return Xor(l,rsx);
}
//对明文进行加密
string runMing(string s,string MiMa){
string ip;
int pc_1[64]={58,50,42,34,26,18,10,2,60,52,44,36,28,20,12,4,
62,54,46,38,30,22,14,6,64,56,48,40,32,24,16,8,
57,49,41,33,25,17,9,1,59,51,43,35,27,19,11,3,
61,53,45,37,29,21,13,5,63,55,47,39,31,23,15,7};
for(int i=0;i<64;i++){
ip+=s[pc_1[i]-1];
}
cout<<"ip="<<ip<<endl;
string L[17],R[17];
L[0]=string(ip.begin(),ip.begin()+32);
R[0]=string(ip.begin()+32,ip.end());
vector<string> K=runPc(MiMa);
cout<<"----------L R-----------\n\n";
for(int i=1;i<=16;i++){
L[i]=string(R[i-1].begin(),R[i-1].end());
R[i]=f(L[i-1],string(R[i-1].begin(),R[i-1].end()),K[i-1]);
cout<<"L["<<i<<"]="<<L[i]<<" R["<<i<<"]="<<R[i]<<endl;
}
cout<<"\n\n\n";
//finally
string lr=R[16]+L[16];
int ip_1[64]={
40,8,48,16,56,24,64,32,39,7,47,15,55,23,63,31,
38,6,46,14,54,22,62,30,37,5,45,13,53,21,61,29,
36,4,44,12,52,20,60,28,35,3,43,11,51,19,59,27,
34,2,42,10,50,18,58,26,33,1,41,9,49,17,57,25};
string Mi;
for(int i=0;i<64;i++){
Mi+=lr[ip_1[i]-1];
}
cout<<"return MIWen="<<Mi<<endl;
return Mi;
}
int main(){
//freopen("1.in","r",stdin);
//freopen("1.txt","w",stdout);
//cout<<f("11001100000000001100110011111111","11110000101010101111000010101010","000110110000001011101111111111000111000001110010")<<endl;
string MiYao="0110111110111100101010101100101110100101111110100000011101010100";
string MiWen="0011001101111001100100101110101100010111101101101111110010100110";
// string MiYao="0001001100110100010101110111100110011011101111001101111111110001";
// string MiWen="0000000100100011010001010110011110001001101010111100110111101111";
runMing(MiWen,MiYao);
}
https://www.cnblogs.com/LoganChen/p/11432092.html
投递阿里云等公司10个岗位