DES算法C++

#include<stdio.h>
#include<string>
#include<iostream>
#include<string.h>
#include<math.h>
#include<stdlib.h>
using namespace std;
string k[16]; //存储16个子秘钥
int s[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};

int e[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};

int pc1[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 pc2[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};

int ip[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};

int ipni[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};

int p[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};
int weishu[16]={1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};//循环左移的位数
int gcd(int x,int y) //判断两个数是否互素
{
    int i;
    for(i=x;i>=1;i--)
    {
        if(x%i==0&&y%i==0)
            return i;
    }
}
string leftshift(string s,int n)//循环左移
{
    int i;
    string a;
    for(int i=0;i<28;i++)
        a+='0';
    for(i=n;i<28;i++)
        a[i-n]=s[i];
    for(i=0;i<n;i++)
        a[i+28-n]=s[i];
    return a;
}
string tentotwo2(int a)//十进制转二进制4位的
{
    string s="0000",c="0000";
    int i=0;
    while(a!=0){
        s[i]=a%2+'0';
        a=a/2;
        i++;
    }
    for(i=0;i<4;i++)
    {
        c[i]=s[3-i];
    }
    return c;
}
string tentotwo1(int a)//十进制转二进制8位的
{
    string s="00000000",c="00000000";
    int i=0;
    while(a!=0)
    {
        s[i]=a%2+'0';
        a=a/2;
        i++;
    }
    for(i=0;i<8;i++)
    {
        c[i]=s[7-i];
    }
    return c;
}
string bytetobits(string s)//字节转比特
{
    string a;
    for(int i=0;i<8;i++){
        int y=s[i];
        a+=tentotwo1(y);
    }
    return a;
}
void sczmy(string a)//生成子秘钥算法
{
    int i;
    string b;
    string c,d,g;
    for(i=0;i<56;i++)
        b+=a[pc1[i]-1];
    for(i=0;i<28;i++)
        c+=b[i];
    for(i=28;i<56;i++)
        d+=b[i];
    for(i=0;i<16;i++)
    {
        c=leftshift(c,weishu[i]);
        d=leftshift(d,weishu[i]);
        g=c+d;
        for(int j=0;j<48;j++){
            k[i]+=g[pc2[j]-1];
        }
    }
}
string f(string a,string k)//轮函数f算法
{
    int i,j,m;
    string r,b[8],c,f,q;
    int d[8];
    for(i=0;i<48;i++)
    {
        r+=a[e[i]-1];
    }
    for(i=0;i<48;i++){
        if(r[i]==k[i])
        {
            c+='0';
        }
        else
        {
            c+='1';
        }
    }
    for(i=0;i<8;i++)
    {
        for(j=6*i;j<6*i+6;j++)
        {
            b[i]+=c[j];
        }
        d[i]=s[i][(b[i][0]-'0')*2+b[i][5]-'0'][(b[i][1]-'0')*8+(b[i][2]-'0')*4+(b[i][3]-'0')*2+b[i][4]-'0'];
        f+=tentotwo2(d[i]);
    }
    for(i=0;i<32;i++)
        q+=f[p[i]-1];
    return q;
}
string Xor(string a,string b)//异或运算
{
    int i;
    string c;
    for(i=0;i<32;i++){
        if(a[i]==b[i])
        {
            c+='0';
        }
        else
        {
            c+='1';
        }
    }
    return c;
}
void bitTobyte(string a)//比特转字节
{
    int i,j,c[8];
    string b[8],d;
    int w[300];
    for(i=0;i<300;i++)
        w[i]=i;
    for(i=0;i<8;i++)
    {
        for(j=0;j<8;j++)
        {
            b[i]+=a[8*i+j];
        }
        c[i]=(b[i][0]-'0')*128+(b[i][1]-'0')*64+(b[i][2]-'0')*32+(b[i][3]-'0')*16+(b[i][4]-'0')*8+(b[i][5]-'0')*4+(b[i][6]-'0')*2+(b[i][7]-'0');
    }
    for(i=0;i<8;i++)
        printf("%c",w[c[i]]);
    printf("\n");
}
int main()
{
    int i;
    string m,key,m1,ki,m2,m3,m4,m5,m6,m7;
    //printf("输入明文：");
    cout<<"输入明文:";
    cin>>m;
    //printf("输入秘钥：");
    cout<<"输入秘钥:";
    cin>>key;
    ki=bytetobits(key);
    m1=bytetobits(m);
    sczmy(ki);
    for(i=0;i<64;i++)
    {
        m2+=m1[ip[i]-1];
    }                       //IP置换
    string L,R;
    for(i=0;i<32;i++)//把64位的比特分成两个部分
    {
        L+=m2[i];
        R+=m2[i+32];
    }
    for(i=0;i<16;i++)//16轮加密
    {
        string temp;
        temp=L;
        L=R;
        R=Xor(temp,f(R,k[i]));
    }
    m3+=R+L;
    for(i=0;i<64;i++)
    {
        m4+=m3[ipni[i]-1];
    }
    cout<<"加密的密文为:"<<m4<<endl;
    //解密算法
    for(i=0;i<64;i++)
    {
        m5+=m4[ip[i]-1];
    }
    string l,r;
    for(i=0;i<32;i++)
    {
        l+=m5[i];
        r+=m5[i+32];
    }
    for(i=0;i<16;i++)
    {
        string temp;
        temp=l;
        l=r;
        r=Xor(temp,f(r,k[15-i]));
    }
    m6+=r+l;
    for(i=0;i<64;i++)
    {
        m7+=m6[ipni[i]-1];
    }
    cout<<"明文的比特表示为:"<<m7<<endl;
    cout<<"明文的字符串表示:";
    bitTobyte(m7);//把解密后的比特转成字节
}