DES 算法：

算法原理概述：
简介：
DES算法为密码体制中的对称密码体制，又被称为美国数据加密标准。

总体结构：
–置换IP与逆置换IP-

模块分解:
以下图为例：

分解模块从对整个过程而言，分为：

对应于下文代码中的 Ip()函数;

迭代过程主要是Feistel轮函数f(Ri-1, Ki),对应于下文代码中的Mul_trans()函数。其中异或L16以及R16过程为L_R()函数。值得一提最后连接R16L16,而不是L16R16.
另外还有S盒的使用，以及P置换，使用S_P()以及D_B()函数实现，由于最初看错一步，导致对S盒元素的选取出错，后面解密加密均出了错。
在此一提，S盒6位输入第一位与最后一位决定行，中间四位确定列。

数据结构：
此次代码的编写主要是通过设信息空间是由{0，1}组成的，主要是展示DES算法原理以及整体结构。

使用的语言是c++，使用的数据结构是向量vector。

大多数一维向量用于存储明文密文，以及迭代过程中使用到的的L,R,C,D等。

使用的二维向量用来存储获取的子密钥。

c++code:

#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <vector>
using namespace std; 

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 IP1[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,57,27,34,2,42,10,50,18,58,26,33,1,41,9,49,17,57,25
                };
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 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,0,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 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 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[56] = {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<int> Ip(vector<int> v){ // 初始置换IP
    vector<int> ip;
    for(int i=0; i<64; i++)
    ip.push_back(v.at(IP[i]-1));
    return ip;
}

void print(vector<int> k){
    for(int i =0 ; i< k.size();i++)
        cout<<k.at(i);
    cout<<endl;
}

vector<int> Expand(vector<int> r){ //选择扩展运算 32->48
    vector<int> Er;
    for(int i=0; i<48; i++)
        Er.push_back(r.at(E[i]-1));
    return Er;
}

void D_B(vector<int> &s_out, vector<int> temp, int i){//将得到的S十进制转成二进制，并将得到的数转为二进制存到s_out中
    int x,y,s;
    int b[4] = {0};

    x = temp[0]*2 + temp[5];
    y = temp[1]*8 + temp[2]*4 + temp[3]*2 + temp[4];
    s = S[i][x][y];

    int j = 3;
    while(s != 0){ 
        b[j--] = s%2;
        s /= 2;
    }

    for(j = 0; j < 4; j++)
        s_out.push_back(b[j]);
}

vector<int> S_P(vector<int> key_en){ //选择压缩运算S
    vector<int> temp;
    vector<int> s_out;
    vector<int> s_p;
    for(int i = 0; i<8; i++){
        for(int j = 0; j<6; j++){
            temp.push_back(key_en.at(6*i+j));
        }
            D_B(s_out,temp,i);
    }

    for(int k = 0; k < 32; k++)   //P置换

        s_p.push_back(s_out.at(P[k]-1));


    return s_p;
}

vector<int> Key_en(vector<int> key, vector<int> Er){ 
    vector<int> key_en;
    for(int i=0; i<48; i++)     //密钥加密运算
        key_en.push_back( (key.at(i)+Er.at(i))%2 );
    return S_P(key_en);
}



vector<int> L_R(vector<int> l, vector<int> r){//L按位异或R
    vector<int> l_r;
    for(int i=0; i<32; i++)
        l_r.push_back((l.at(i)+r.at(i))%2);
    return l_r;
}

vector<int> Mul_trans(vector<int> ip, vector<vector<int> > key){ //乘积变换
        vector<int> l;
        vector<int> r;
        vector<int> l1;

        for(int i=0; i<32; i++)
            l.push_back(ip.at(i));

        for(int j=32; j<64; j++)
            r.push_back(ip.at(j));



        for(int i = 1; i<=16; i++){
            l1 = r;
            r = Key_en(key.at(i),Expand(r)); //按位异或子密钥Ki与扩展后Ri
            r = L_R(l,r);
            l = l1;
        }
        r.insert(r.end(),l.begin(),l.end());  

        return r;
}

vector<int> D_Mul_trans(vector<int> ip, vector<vector<int> > key){ //乘积变换 解密
        vector<int> l;
        vector<int> r;
        vector<int> l1;
        for(int i=0; i<32; i++)
            l.push_back(ip.at(i));

        for(int j=32; j<64; j++)
            r.push_back(ip.at(j));

        for(int i = 16; i>=1; i--){ //颠倒Ki 从16———1
            l1 = r;
            r = Key_en(key.at(i),Expand(r));
            r = L_R(l,r);
            l = l1;
        }
        l.insert(l.end(),r.begin(),r.end());  

        return l;
}

vector<int> Ip1(vector<int> lr){ // 逆初始置换IP

    vector<int> ip1;
    for(int i=0; i<64; i++)
    ip1.push_back(lr.at(IP1[i]-1));

    return ip1;
}

vector<vector<int>> Create_key(vector<int> father_key){
    vector<int> C;
    vector<int> D;
    vector<vector<int> > key(17, vector<int>(48, 0));

    for(int i=0; i<56; i++){  //PC1置换得到C0,D0
        if(i<=27) C.push_back(father_key.at(PC1[i]-1));
        else D.push_back(father_key.at(PC1[i]-1));
    }

    for(int j = 1; j<=16; j++){  //产生密钥Ki

        if(j==1 || j==2 || j==9 || j==16){ //循环左移一位

            int c = C.at(0);
            int d = D.at(0);
            C.erase(C.begin());
            D.erase(D.begin());
            C.push_back(c);
            D.push_back(d); 

        }else{                              //循环左移两位
            int c1 = C.at(0);
            int c2 = C.at(1);
            C.erase(C.begin());
            C.erase(C.begin());
            C.push_back(c1);
            C.push_back(c2); 

            int d1 = D.at(0);
            int d2 = D.at(1);
            D.erase(D.begin());
            D.erase(D.begin());
            D.push_back(d1);
            D.push_back(d2); 
        }

          for(int k=0; k<48; k++){
            if(PC2[k] <= 28)
                key.at(j).push_back(C.at(PC2[k] - 1));
            else
                key.at(j).push_back(D.at(PC2[k] - 29));

          }
    }
    return key;
}

vector<int> Encryption(vector<int> Clear_text, vector<vector<int>> child_key){
    vector<int> decry;

    decry = Ip(Clear_text);
    decry = Mul_trans(decry,child_key);
    decry = Ip1(decry);
    return decry;
}
vector<int> Decrypted(vector<int> Ciphertext,vector<vector<int> > child_key){
    vector<int> decry;

    decry = Ip(Ciphertext);
    decry = D_Mul_trans(decry,child_key);
    decry = Ip1(decry);
    return decry;
}

int main(){ //实例测试
        vector<vector<int> > child_key;
        vector<int> Clear_text;
        vector<int> Ciphertext;
        vector<int> cl;
        vector<int> father_key;

        for(int i=0; i<64; i++){
            Clear_text.push_back(0);
            father_key.push_back(0);
        }
        child_key = Create_key(father_key);

        Ciphertext = Encryption(Clear_text,child_key);

        print(Ciphertext);

        cl = Decrypted(Ciphertext, child_key);

        print(cl);

        return 0;
}

运行截图：