密码学三：DES加密算法

最新推荐文章于 2023-03-19 17:18:56 发布
最新推荐文章于 2023-03-19 17:18:56 发布
阅读量242 收藏
点赞数
分类专栏： 密码学 文章标签： c++ 密码学 加密解密
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_50749380/article/details/118977452
版权

结果截图：
在这里插入图片描述
代码如下：

// DES加密算法.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
#include <iostream>
#include <string>
#include <vector>

using namespace std;

vector<int> LeftMsg(vector<int>msg)
{
    vector<int> result;
    int num = msg.size() / 2;
    for (int i = 0; i < num; ++i)
    {
        result.push_back(msg[i]);
    }
    return result;
}
vector<int> RightMsg(vector<int>msg)
{
    vector<int> result;
    int num = msg.size() / 2;
    for (int i = num; i<msg.size(); ++i)
    {
        result.push_back(msg[i]);
    }
    return result;
}
vector<int> fun1(vector<int>k,vector<vector<int>>table) {
    vector<int>result;
    for (int i = 0; i < table.size(); ++i)
    {
        for (int j = 0; j < table[i].size(); ++j)
        {
            result.push_back(k[table[i][j]-1]);
        }
    }
    return result;

}
vector<int> ShiftVector(vector<int> v, int num){
    vector<int> result;
    for (int i = 0; i < v.size(); ++i)
    {
        result.push_back(v[(i+num)%v.size()]);
    }
    return result;
}
vector<vector<int>> Shift_C_D(vector<int>shiftNum,vector<int>c0,vector<int>d0) {
    vector<vector<int>> result;
    for (int i = 0; i < shiftNum.size(); ++i)
    {
        if (i == 0) {
            vector<int> c1 = ShiftVector(c0, shiftNum[i]);
            result.push_back(c1);
        }
        else
        {
            vector<int> cn = ShiftVector(result.back(), shiftNum[i]);
            result.push_back(cn);
        }
    }
    for (int i = 0; i < shiftNum.size(); ++i)
    {
        if (i == 0) {
            vector<int> d1 = ShiftVector(d0, shiftNum[i]);
            result.push_back(d1);
        }
        else
        {
            vector<int> dn = ShiftVector(result.back(), shiftNum[i]);
            result.push_back(dn);
        }
    }

    return result;
}
vector<vector<int>> Shift_CN_DN(vector<vector<int>>PC2,vector<vector<int>>C1_C16_D1_D16) {
    vector<vector<int>> result;
    for (int i = 0; i < C1_C16_D1_D16.size()/2; ++i)
    {
        vector<int> temp;
        for (int j = 0; j < PC2.size(); ++j)
        {
            for (int k = 0; k < PC2[j].size(); ++k)
            {
                int index = PC2[j][k];
                if (index <= 28)
                {
                    temp.push_back(C1_C16_D1_D16[i][index - 1]);
                }
                else
                {
                    temp.push_back(C1_C16_D1_D16[i + 16][index - 1 - 28]);
                }
            }
        }
        result.push_back(temp);
    }
    return result;
    
}
vector<int> XOR(vector<int> v1, vector<int>v2) {
    vector<int> result;
    if (v1.size() != v2.size())
    {
        cout << "两个向量长度不一致，不能执行异或操作！！！";
        return result;
    }
    for (int i = 0; i < v1.size(); ++i)
    {
        result.push_back(v1[i] != v2[i]);
    }
    return result;
}
vector<int> get_S_Trans(vector<int> v)
{
    vector<int> result;
    vector<vector<vector<int>>> S_Box = {
        {
            {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}
        }
    };

    for (int i = 0; i < v.size(); i = i + 6)
    {
        int row = v[i] * 2 + v[i + 5];
        int cul = v[i + 1] * 8 + v[i + 2] * 4 + v[i + 3] * 2 + v[i + 4];
        int num = i / 6;
        result.push_back(S_Box[num][row][cul]);
    }
    return result;
}
vector<int> vectotToBinary(vector<int> v)
{
    vector<int> result;
    for (int i = 0; i < v.size(); ++i)
    {
        int num = v[i];
        for (int j = 0; j < 4; ++j)
        {
            result.push_back(num % 2);
            num = num / 2;
        }
        int temp = result[i * 4];
        result[i * 4] = result[i * 4 + 3];
        result[i * 4 + 3] = temp;

        temp = result[i * 4 + 1];
        result[i * 4 + 1] = result[i * 4 + 2];
        result[i * 4 + 2] = temp;
    }
    return result;
}
vector<vector<int>> get_L0_L16_R0_R16(vector<int> L0,vector<int>R0,vector<vector<int>> K1_KN) {
    vector<vector<int>> result;
    vector<vector<int>> expandTable = {
        {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}
    };
    /*
    vector<vector<vector<int>>> S_Box = {
        {
            {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}
        }

    };
    */
    for (int i = 0; i <= 16; ++i)
    {
        if (i == 0)
        {
            result.push_back(L0);
            result.push_back(R0);
        }
        else
        {
            vector<int> LN = result.back();
            vector<int> R = result.back();

            vector<int> expand_R = fun1(R, expandTable);

            vector<int> XOR_R_KN = XOR(expand_R, K1_KN[i-1]);
            //result.push_back(XOR_R_KN);
            //break;

            vector<int> S_Trans = get_S_Trans(XOR_R_KN);
            
            vector<int> S_Trans_Binary = vectotToBinary(S_Trans);

            vector<vector<int>> P_Box = {
                {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<int> P_Trans = fun1(S_Trans_Binary, P_Box);

            int len = result.size();
            vector<int> L_N__1 = result[len - 2];
            vector<int> RN = XOR(P_Trans, L_N__1);

            result.push_back(LN);
            result.push_back(RN);
        }
    }
    return result;

}


void printVector(vector<int> v,int row) {
    for (int i = 1; i <= v.size(); ++i)
    {
        cout << v[i-1] << " ";
        if (i % row == 0)
            cout << endl;
    }

    cout << endl;
}
//解密
vector<int> fun2(vector<int> v,vector<vector<int>> table) {
    int num = table.size() * table[0].size();
    vector<int> result(num);
    int k = 0;
    for (int i = 0; i < table.size(); ++i)
    {
        for (int j = 0; j < table[i].size(); ++j)
        {
            result[table[i][j]-1] = v[k];
            k++;
        }
    }

    return result;
}
vector<vector<int>> get_R16_L16_R0_L0(vector<int> L16, vector<int>R16, vector<vector<int>>K1_KN)
{
    vector<vector<int>> result;
    vector<vector<int>> expandTable = {
        {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 = 16; i >= 0; --i)
    {
        if (i == 16)
        {
            result.push_back(R16);
            result.push_back(L16);
        }
        else
        {
            vector<int> R_N__1 = result.back();
            vector<int> expand_R_N__1 = fun1(R_N__1, expandTable);
            vector<int> XOR_R_N__1_KN = XOR(expand_R_N__1, K1_KN[i]);
            vector<int> S_Trans = get_S_Trans(XOR_R_N__1_KN);
            vector<int> S_Trans_Binary = vectotToBinary(S_Trans);
            vector<vector<int>> P_Box = {
                {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<int> P_Trans = fun1(S_Trans_Binary, P_Box);

            vector<int> RN = result[(15-i)*2];
            vector<int> L_N__1 = XOR(P_Trans, RN);
            result.push_back(R_N__1);
            result.push_back(L_N__1);
            //break;
        }
    }

    return result;
}

int main()
{
	vector<int> Msg = { 0,0,0,0, 0,0,0,1, 0,0,1,0, 0,0,1,1, 0,1,0,0, 0,1,0,1, 0,1,1,0, 0,1,1,1,
						1,0,0,0, 1,0,0,1, 1,0,1,0, 1,0,1,1, 1,1,0,0, 1,1,0,1, 1,1,1,0, 1,1,1,1 };
	cout << "明文Msg为：" << endl;;
	printVector(Msg, 4);
	cout << "\nDES加密中……\n" << endl;
	vector<int> L = LeftMsg(Msg);
	vector<int> R = RightMsg(Msg);

	vector<int> K = { 0,0,0,1, 0,0,1,1, 0,0,1,1, 0,1,0,0, 0,1,0,1, 0,1,1,1, 0,1,1,1, 1,0,0,1,
					  1,0,0,1, 1,0,1,1, 1,0,1,1, 1,1,0,0, 1,1,0,1, 1,1,1,1, 1,1,1,1, 0,0,0,1 };
	vector < vector<int >> TransTable = {
		{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} };

	vector<int> K0 = fun1(K, TransTable);
	vector<int> C0 = LeftMsg(K0);
	vector<int> D0 = RightMsg(K0);
	//printVector(C0,7);
	//cout << endl;
	//printVector(D0,7);

	vector<int> shiftNum = { 1,1,2,2, 2,2,2,2, 1,2,2,2, 2,2,2,1 };
	vector<vector<int>> C1_C16_D1_D16 = Shift_C_D(shiftNum, C0, D0);
	//cout << endl;
	//printVector(C1_C16_D1_D16[15],7);
	//cout << endl;
	//printVector(C1_C16_D1_D16[31],7);

	vector<vector<int>> PC2 = {
		{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<vector<int>> K1_KN = Shift_CN_DN(PC2, C1_C16_D1_D16);
	//cout << endl;
	//printVector(K1_KN[15],6);

	vector<vector<int>> IP = {
		{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}

	};

	vector<int> IP2 = fun1(Msg, IP);
	//printVector(IP2, 4);

	vector<int> L0 = LeftMsg(IP2);
	vector<int> R0 = RightMsg(IP2);
	//cout << "正向L 0和 R 0:\n";
	//printVector(L0, 16);
	//printVector(R0, 16);

	vector<vector<int>> L0_R0_L16_R16 = get_L0_L16_R0_R16(L0, R0, K1_KN);

	vector<int> L16 = L0_R0_L16_R16[32];
	vector<int> R16 = L0_R0_L16_R16[33];
	vector<int> L15 = L0_R0_L16_R16[30];
	vector<int> R15 = L0_R0_L16_R16[31];

	//cout << "正向L 15和 R 15:\n";
	//printVector(L15, 16);
	//printVector(R15, 16);
	//cout << "正向L 16和 R 16:\n";
	//printVector(L16, 16);
	//printVector(R16, 16);

	R16.insert(R16.end(), L16.begin(), L16.end());

	vector<vector<int>> IP_1_Table = {
		{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}
	};

	vector<int> pwd = fun1(R16, IP_1_Table);
	cout << "\nDES加密完成！！！\n" << endl;
	cout << "密文Pwd为：" << endl;;
	printVector(pwd, 8);

	cout << "\nDES解密中……\n" << endl;
	R16.clear();
	R16 = fun2(pwd, IP_1_Table);

	L16.clear();
	L16.insert(L16.end(), R16.begin() + 32, R16.end());
	R16.erase(R16.begin() + 32, R16.end());

	//cout << "逆向L 16和 R 16:\n";
	//printVector(L16, 16);
	//printVector(R16, 16);

	vector<vector<int>> R16_L16_R0_L0 = get_R16_L16_R0_L0(L16, R16, K1_KN);
	L15.clear();
	R15.clear();
	R15 = R16_L16_R0_L0[2];
	L15 = R16_L16_R0_L0[3];

	// cout << "逆向L 15和 R 15:\n";
	// printVector(L15, 16);
	// printVector(R15, 16);


	L0.clear();
	R0.clear();
	R0 = R16_L16_R0_L0[32];
	L0 = R16_L16_R0_L0[33];
	//cout << "逆向L 0和 R 0:\n";
	//printVector(L0, 16);
	//printVector(R0, 16);

	L0.insert(L0.end(), R0.begin(), R0.end());

	Msg.clear();
	Msg = fun2(L0, IP);
	cout << "\nDES解密完成！！！\n" << endl;

	cout << "解密结果为：\n";
	printVector(Msg, 4);
	return 0;
}
5436649486
关注
专栏目录
DES加密算法C++程序
12-28
VC6环境下，100%正确 函数声明 ： int DES_MakeSubKeys(ElemType key[64],ElemType subKeys[16][48]); int DES_PC1_Transform(ElemType key[64], ElemType tempbts[56]); int DES_PC2_Transform(ElemType key[56], ElemType tempbts[48]); int DES_ROL(ElemType data[56], int time); int DES_IP_Transform(ElemType data[64]); int DES_IP_1_Transform(ElemType data[64]); int DES_E_Transform(ElemType data[48]); int DES_P_Transform(ElemType data[32]); int DES_SBOX(ElemType data[48]); int DES_XOR(ElemType R[48], ElemType L[48],int count); int DES_Swap(ElemType left[32],ElemType right[32]); int DES_EncryptBlock(ElemType plainBlock[8], ElemType subKeys[16][48], ElemType cipherBlock[8]); int DES_DecryptBlock(ElemType cipherBlock[8], ElemType subKeys[16][48], ElemType plainBlock[8]); int DES_Encrypt(char *plainFile, char *keyStr,char *cipherFile); int DES_Decrypt(char *cipherFile, char *keyStr,char *plainFile);
密码学DES算法编程
11-12
1、编写程序实现DES加、解密： 编程实现基于自己的名字来构造一DES密钥； 应用获得的密钥将一段英文（或文件）进行加、解密。 2、用DES实现口令的安全： 如：登陆计算机（或连接服务器）时，用户的口令作为DES的密钥，加密某个固定的明文，生成的密文存储在计算机中。下次登陆时，把生成的密文和已存储的密文进行比较，若一致则登陆成功。
DES加密算法及演示程序（GO-算法核心实现+Python-前端演示系统）
npu_nazi的博客
03-19 814
该程序实现了DES加密算法的软件实现，使用Golang语言实现核心算法，使用Python实现前端展示程序，功能有字符串的加解密演示、文件的加解密演示。
密码程序之DES
dk_zhe的专栏
01-24 944
通过编程实现des加密，更加深入的了解其原理，掌握des算法。 （1）      建立初始的明密文置换表单和各个加密模块的数组。 （2）      输入密钥 （3）      把输入的字符的ascii码转换成二进制 （4）      密钥经过PC1_Table和 PC2_Table变为48位 （5）      输入明文 （6）      把输入的字符的ascii码转换成二进制 （
DES加密算法（c语言实现）
06-11
DES，DES加密算法，DES算法源码。用C写的DES加密算法。 DES，DES加密算法，DES算法源码。 DES加密算法（c语言实现） （本程序可以直接使用）
密码学：DES加密算法
最新发布
01-13
DES加密算法MATLAB实现
现代密码学~DES加密算法实验报告.doc
10-11
现代密码学~DES 加密算法实验报告 现代密码学是研究秘密通信的原理和破译秘密信息的方法的一门学科。密码学的根本技术就是对数据进行一组可逆的数学变换，使未授权者不能理解它的真实含义。密码学包括密码编码学和...
DES加密算法实验
09-27
### DES加密算法实验知识点 #### 一、实验背景与目的 **DES（Data Encryption Standard）加密算法**是一种经典的对称加密技术，在信息安全领域占据着重要地位。本实验旨在通过实践操作，加深对DES算法工作原理的...
密码学实验_对称加密算法DES_非对称加密算法RSA.pdf
02-20
本实验报告主要涉及两种加密算法：对称加密算法DES（Data Encryption Standard）和非对称加密算法RSA。实验旨在帮助学生深入理解这两种算法的基本原理，并通过Python编程实现加密和解密过程。 ### **对称加密算法...
应用密码学：协议、算法与C源程序_.rar_应用密码学
07-14
接着，书中的核心内容将涉及密码学的主要分支，如对称加密算法（如DES、AES）和非对称加密算法（如RSA、ECC）。这些算法是数据加密的基石，通过对它们的工作原理进行详细解析，读者可以了解如何实现数据的保密性。...
DES算法加密解密C++源码及程序（完整的工程文件）
06-05
DES算法加密解密C++源码及程序（完整的工程文件），内容绝对完整，VC++6.0完美打开，控制台应用程序，而且可以计算加密解密时间的哦
DES加密算法C++实现
06-05
DES加密算法C++实现支持多个key输入、支持ECB、CBC填充模式 3、不是.exe程序，是代码段；
DES加密算法（C语言版）源代码
06-08
采用C语言实现的DES加密算法，支持文件的加解密，其中包含源代码及可执行程序。
DES算法实现对文件的加密
07-31
利用MFC基于对话框实现DES算法对整个文件加密，不只是加密文档，视频，图片，声音等文件都能实现加密
DES加密算法原理
热门推荐
张维鹏的博客
10-07 4万+
目录： 一、DES算法： 二、主要流程： 1、初始置换： 2、加密处理--16轮迭代过程： 2.1 秘钥置换--子密钥生成： 2.2扩展置换E（E位选择表） 2.3 S-盒代替（功能表S盒） 2.4P-盒置换： 3、逆置换： 4、DES解密： 一、DES算法： 1、DES算法简介： DES算法为密码体制中的对称密码体制。需要加密的明文按64位进行分组，加密...
DES加密算法编程实现 C++实现
Frost_JunAn的博客
06-14 392
#include <iostream> #include "置换表.cpp" //根据置换表p，将数组src的元素放进数组des。 template<std::size_t N> void Permutation(const std::array<int, N> p, const int* src, int* des) { for (int i = 0; i < N; ++i) des[i] = src[p[i] - 1]; } void S盒(int*
DES加密程序代码(带有比较详细的讲解)
rainysky的专栏
11-19 2027
此代码分块复制出来后可以直接运行，并且带有部分文件操作，如果嫌麻烦的话，在我的空间代码库里有整理好的代码，可以参考下，上图也不是特别相信，希望大家有选择的看。                    一、准备     首先，头文件与宏定义。 C代码 #include "stdio.h"       #include "memory.h"       #include "time.h
DES数据加密算法 加密算法源代码
05-07
DES数据加密算法 加密算法源代码，信息安全专业课程设计
密码学实验：DES与RSA加密算法实现
"该资源是一份完整的密码学实验报告，主要涵盖了对称加密算法DES和非对称加密算法RSA的理论学习与Python实现。实验旨在让学习者理解这两种加密体制的基本原理，并能通过编程实现加密和解密过程。报告包含了实验目的...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

5436649486

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付：¥1
获取中
扫码支付

您的余额不足，请更换扫码支付或充值

打赏作者

实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

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

余额充值