DES加密算法的实现(C++语言)

DES加密的流程如下


1.对64位明文进行初置换,结果为A

2.将A分为两部分,左32位记为L,右32位记为R

3.对R进行拓展置换,得到X(48位)

4.将第I轮的密钥与X异或,得到Y(48位)

5.将Y穿入S盒,得到Z(32位)

6.将Z与L异或,结果传入L中

7.交换R和L

8.再次重复2~7,共计16次

9.将L和R整合,并将结果做末置换,加密完成


解密的流程其实是一样的额,只不过密钥不一样

假设加密时第i轮用的密钥Ki,那么解密时第i轮用的密钥是K(17-i)


下面说一下密钥生成的过程:


首先,我们一开始输入的密钥为X(64位)

1.将密钥X做密钥置换,取出其中58位记为T(58位)

2.取T左边28位为L,T右边28位为R

3.分别对R,L作循环左移

4.再对其做扩展运算,得到K[i]

6.重复3~4,共16次


#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
const int maxn=105;
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
},

FP[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
},

KP[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
},

KM[16] =     //密钥位移
{
    1 ,  1 ,  2 ,  2 ,  2 ,  2 ,  2 ,  2 ,
    1 ,  2 ,  2 ,  2 ,  2 ,  2 ,  2 ,  1
},

CP[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
},

EP[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
},

S_box[8][4][16] =      //S盒
{
    //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}
    }
},

PP[32] =     //P盒
{
    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
};

vector  v;
map mp;
map mt;
char key[maxn],a[maxn],b[maxn];

void initial()
{
    mp['0']="0000";mp['1']="0001";mp['2']="0010";mp['3']="0011";
    mp['4']="0100";mp['5']="0101";mp['6']="0110";mp['7']="0111";
    mp['8']="1000";mp['9']="1001";mp['a']="1010";mp['b']="1011";
    mp['c']="1100";mp['d']="1101";mp['e']="1110";mp['f']="1111";
    for(map::iterator it=mp.begin(); it!=mp.end(); it++)  mt[it->second]=it->first;
}

string change(char t[])   // 将16位16进制的数 转化成 64位2进制的数
{
    string st;
    for(int i=1; i<=16; i++)  st=st+mp[t[i]];
    return st;
}

string LOR(string st,int num)   // 将st 循环左移num位
{
    for(int i=0; i='0' && ch<='9')  return ch-'0';
    else  return ch-'a'+10;
}

string XOR(string ty,string tx)   // 异或
{
    int len=ty.size();
    string p;
    for(int i=0; i


附运行结果:

DES加密算法的实现(C++语言)_第1张图片


你可能感兴趣的:(密码学)