DES算法进行时

<pre name="code" class="cpp">#include <iostream>
#include <cstring>
#include <string>
#include <map>
using namespace std;

string K[16];
void   chushizhihuan(string &ss)
{
    string sss=ss;
    int zh1[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++)
    {
        ss[i]=sss[zh1[i]-1];
    }
}
void nichushi(string &ss)
{

    string sss=ss;
    int zh1[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,
                 };

    for(int i=0; i<64; i++)
    {
        ss[i]=sss[zh1[i]-1];
    }



}
void zhihuanip1(string &ss)
{
    string sss=ss;
    ss=ss.substr(0,56);
    int zh1[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
                 };

    for(int i=0; i<56; i++)
    {
        ss[i]=sss[zh1[i]-1];
    }


}
void zhihuanip2(string &ss)
{

    string sss=ss;
    ss=ss.substr(0,48);
    int zh1[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
                 };

    for(int i=0; i<48; i++)
    {
        ss[i]=sss[zh1[i]-1];
    }


}
void   left(string &c,string &d)
{
    char s0=c[0],s1=d[0];
    for(int i=0; i<27; i++)
    {
        c[i]=c[i+1];
        d[i]=d[i+1];
    }
    c[27]=s0;
    d[27]=s1;

}
void   left2(string &c,string &d)
{
    char s0=c[0],s2=c[1],s1=d[0],s3=d[1];
    for(int i=0; i<26; i++)
    {
        c[i]=c[i+2];
        d[i]=d[i+2];
    }
    c[26]=s0;
    c[27]=s2;
    d[26]=s1;
    d[27]=s3;


}
void getK(string k)
{
    string c=k.substr(0,28);
    string d=k.substr(28,28);
    for(int i=0; i<16; i++)
    {
        if(i==0||i==1||i==8||i==15)
            left(c,d);

        else
            left2(c,d);
        string cd=c+d;
        zhihuanip2(cd);
        K[i]=cd;
    }


}
void yasuo(string &ss)
{
    string  sss=ss;
    ss=ss.substr(0,32);
    int s1[8][4][16]= { {
            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
        },
        {
            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,10,5,14,9
        },
        {
            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
        },
        {
            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
        },
        {
            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
        },
        {
            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
        },
        {
            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
        },
        {
            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 s[8];
    int p=0;
    for(int i=0; i<8; i++)
    {
        s[i]=sss.substr(i*6,6);
        int x=(s[i][0]-'0')*2+(s[i][5]-'0');
        int y=(s[i][1]-'0')*8+(s[i][2]-'0')*4+(s[i][3]-'0')*2+(s[i][4]-'0');
        int xy=s1[i][x][y];
        if(xy>=8)
        {
            ss[p]='1';
            xy-=8;
        }
        else ss[p]='0';
        p++;
        if(xy>=4)
        {
            ss[p]='1';
            xy-=4;
        }
        else ss[p]='0';
        p++;
        if(xy>=2)
        {
            ss[p]='1';
            xy-=2;
        }
        else ss[p]='0';
        p++;
        if(xy>=1)
        {
            ss[p]='1';
            xy-=1;
        }
        else ss[p]='0';
        p++;

    }


}
string  yihuo(string s1,string s2)
{
    string ss=s1;
    int n=s1.length();
    for(int i=0; i<n; i++)
    {
        if(s1[i]==s2[i])
            ss[i]='0';
        else ss[i]='1';
    }
    return ss;
}
void zhihuanE(string &ss)
{

    string sss=ss;
    ss=ss+ss.substr(0,16);
    int zh1[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
                 };

    for(int i=0; i<48; i++)
    {
        ss[i]=sss[zh1[i]-1];
    }
}
void zhihuanP(string &ss)
{
    string sss=ss;
    ss=ss;
    int zh1[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++)
    {
        ss[i]=sss[zh1[i]-1];
    }


}
void root(string &s)
{
    string l=s.substr(0,32);
    string r=s.substr(32,32);
    for(int i=0; i<16; i++)
    {
        string temp=r;
        zhihuanE(r);
        string yh=yihuo(r,K[i]);
        yasuo(yh);
        zhihuanP(yh);
        r=yihuo(l,yh);
        l=temp;
    }
    s=r+l;
}
void zhuanhuan(string &ss)
{
    string m[16] =
    {
        "0000","0001","0010","0011",
        "0100","0101","0110","0111",
        "1000","1001","1010","1011",
        "1100","1101","1110","1111",
    };
    string sss="";
    for(int i=0; i<16; i++)
    {
        if(ss[i]<='9')
            sss+=m[ss[i]-'0'];
        else sss+=m[ss[i]-'a'+10];
    }
    ss=sss;
}
int main()
{

    string s,k;
    cin>>s;
    cin>>k;
    zhuanhuan(s);
    zhuanhuan(k);
    chushizhihuan(s);
    zhihuanip1(k);
    getK(k);
    root(s);
    cout<<s<<endl;
  nichushi(s);
        cout<<s<<endl;
    /*
       string s="111010110011011110100100000011010110010101110111v";
       yasuo(s);
       cout<<s<<endl;
       return 0;
    */
}


                
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值