目錄
實(shí)驗(yàn)內(nèi)容
實(shí)驗(yàn)原理
DES加密解密
ECB(電碼本模式)
代碼
DES函數(shù)的構(gòu)建
RE_DES函數(shù)的構(gòu)建
ECB函數(shù)的構(gòu)建
RE_ECB的函數(shù)的構(gòu)建
主函數(shù)的構(gòu)建
總代碼
測(cè)試結(jié)果
實(shí)驗(yàn)內(nèi)容
輸入一個(gè)文本文件,通過ECB和DES進(jìn)行加密,再將內(nèi)容儲(chǔ)存在新的文本文件中,再通過ECB和DES解密,將內(nèi)容儲(chǔ)存在新的文本文件中
實(shí)驗(yàn)原理
DES加密解密
DES的加密與解密(C語(yǔ)言實(shí)現(xiàn))——大三密碼學(xué)實(shí)驗(yàn)_西瓜妹妹的唯一男朋友的博客-CSDN博客
ECB(電碼本模式)
對(duì)明文分塊后,每一塊明文塊都使用相同的密鑰,通過加密器生成對(duì)應(yīng)的密文塊,每個(gè)明文塊加密中不會(huì)受到彼此的影響
可以進(jìn)行并行操作,一個(gè)密文塊傳輸錯(cuò)誤不會(huì)影響后續(xù)密文解密,但是缺點(diǎn)是無(wú)法避免重放攻擊
代碼
?大部分代碼都在這篇博客中說過
DES的加密與解密(C語(yǔ)言實(shí)現(xiàn))——大三密碼學(xué)實(shí)驗(yàn)_西瓜妹妹的唯一男朋友的博客-CSDN博客
主要把主函數(shù)中的DES加密定義成一個(gè)函數(shù),解密定義成一個(gè)函數(shù)
DES函數(shù)的構(gòu)建
void DES(unsigned char a[8],unsigned char b[8],unsigned char plus3[8])
{
int m_a[64] = { 0 };
int m_b[64]; //IP置換前后的明文
int s_a[64] = { 0 };
int s_b[56]; //置換1前后的二進(jìn)制密鑰
int r; //輪數(shù)
int miwen[8] = { 0 }; //最終密文
int i, j = 0;
int key_l[17][28];//16輪密鑰
int key_r[17][28];
int key_2[17][56];
for (i = 0; i < 8; i++)
{
shizhuaner(m_a, (int)a[i], i, 64);
}
for (i = 0; i < 8; i++)
{
shizhuaner(s_a, (int)b[i], i, 64);
}
exchange(m_a, m_b, IP, 64); //明文進(jìn)行初始置換
int min_l[17][32];
int min_r[17][32];
for (i = 0; i < 32; i++)//明文第0輪的左半部分
min_l[0][i] = m_b[i];
for (i = 32; i < 64; i++)//明文的右半部分
min_r[0][i - 32] = m_b[i];
exchange(s_a, s_b, zhihuan1, 56);//密鑰進(jìn)行PC-1置換
int run = 1;
for (int i = 0; i < 28; i++) {
key_l[0][i] = s_b[i];
key_r[0][i] = s_b[i + 28];
}
int n;
for (r = 1; r <= 16; r++) {
n = get(r);
left_move(key_l[run], key_l[run - 1], n);
left_move(key_r[run], key_r[run - 1], n);
run++;
}
//結(jié)合
for (r = 1; r <= 16; r++) {
for (i = 0; i < 28; i++) {
key_2[r][i] = key_l[r][i];
key_2[r][i + 28] = key_r[r][i];
}
}
//pc-2置換
for (r = 1; r <= 16; r++) {
exchange(key_2[r], key_3[r], zhihuan2, 48);
}
//真正的16輪密鑰到此生成
int temp6[48], temp1[32];
for (int r = 1; r <= 16; r++) {
fuck(min_l[r], min_r[r - 1], 32);//左半部分等于上一輪右半部分
exchange(min_r[r - 1], temp6, e, 48);//E置換
yihuo(temp6, key_3[r], 48);//準(zhǔn)備S盒置換
s_box(temp1, temp6);//s盒替換完畢
exchange(temp1, temp6, p, 32);//P置換
yihuo(temp6, min_l[r - 1], 32);
fuck(min_r[r], temp6, 32);
}
int plus1[64] = { 0 };
int plus2[64] = { 0 };
for (i = 0; i < 32; i++) {
plus1[i] = min_r[16][i];
plus1[i + 32] = min_l[16][i];
}
exchange(plus1, plus2, IP_1, 64);
erzhuanshi(plus2, plus3, 64);
//plus3是密文
}
輸入:數(shù)組a(8字節(jié)明文)數(shù)組b(8字節(jié)密鑰)數(shù)組plus3(8字節(jié)生成的密文)
最后結(jié)果是生成密文plus3
生成16輪密鑰,再經(jīng)過16輪Feistel體制,即可生成密文
RE_DES函數(shù)的構(gòu)建
void RE_DES(unsigned char a[8],unsigned char b[8],unsigned char min_plus[8]) {
//開始解密
int plus2[64],plus1[64],min_l[17][32],min_r[17][32];
for (int i = 0; i < 8; i++) {
shizhuaner(plus2, int(a[i]), i, 64);
}
exchange(plus2, plus1, IP, 64);//IP_1置換
for (int i = 0; i < 32; i++) {
min_l[16][i] = plus1[i + 32];
min_r[16][i] = plus1[i];
}
cout << endl;
for (int r = 16; r >= 1; r--) {
fuck(min_r[r - 1], min_l[r], 32);//這一輪的左等于上一輪的右
exchange(min_r[r - 1], plus1, e, 48);//E擴(kuò)展
yihuo(plus1, key_3[r], 48);//與密鑰異或
s_box(plus2, plus1);//S盒置換
exchange(plus2, plus1, p, 32);//p盒置換
fuck(min_l[r - 1], plus1, 32);
yihuo(min_l[r - 1], min_r[r], 32);//異或
}
for (int i = 0; i < 32; i++) {
plus1[i + 32] = min_r[0][i];
plus1[i] = min_l[0][i];
}
exchange(plus1, plus2, IP_1, 64);;
erzhuanshi(plus2, min_plus, 64);
//min_plus是明文
}
解密過程
輸入:
輸入:數(shù)組a(8字節(jié)密文)數(shù)組b(8字節(jié)密鑰)數(shù)組plus3(8字節(jié)生成的明文)
最后結(jié)果是生成明文plus3
ECB函數(shù)的構(gòu)建
int ECB(unsigned char b[8]) {
FILE* input = fopen("C:\\Users\\Administrator\\Desktop\\ECB.txt", "r");
FILE* output = fopen("C:\\Users\\Administrator\\Desktop\\ECB_1.txt", "a");
int size,size1;
unsigned char a[8],plus3[8];
fseek(input, 0, SEEK_END);
size = ftell(input);
fseek(input, 0, SEEK_SET);
for (int i = 0; i < size/8; i++) {
fread(a, 8, 1, input);
DES(a, b, plus3);
fwrite(plus3, 8, 1, output);
}
size1 = size % 8;
fread(a, size1, 1, input);
for (int i = size1; i < 8 ; i++) {
a[size1] = '0';
}
DES(a, b, plus3);
fwrite(plus3, 8, 1, output);
fclose(input);
fclose(output);
return size;
}
ECB函數(shù)是讀取一個(gè)文件,對(duì)其加密,結(jié)果存儲(chǔ)在新的文本文件中
輸入為數(shù)組b,即密鑰
input是讀取明文文件的指針,output是要寫入密文文本的指針,size是明文文件的大小
每次讀取八字節(jié)作為明文,通過DES算法生成密文并存儲(chǔ)在文本中
如果最后讀取的字節(jié)少于八字節(jié),就對(duì)明文補(bǔ)"0",使其夠8字節(jié),再進(jìn)行DES算法并存儲(chǔ)
RE_ECB的函數(shù)的構(gòu)建
void RE_ECB(unsigned char b[8],int size) {
FILE* input1 = fopen("C:\\Users\\Administrator\\Desktop\\ECB_1.txt", "r");
FILE* output1 = fopen("C:\\Users\\Administrator\\Desktop\\ECB_2.txt", "a");
unsigned char min_plus[8];
int size1;
unsigned char a[8];
fseek(input1, 0, SEEK_END);
size1 = ftell(input1);
fseek(input1, 0, SEEK_SET);
for (int i = 0; i < size/8; i++) {
fread(a, 8, 1, input1);
RE_DES(a, b, min_plus);
fwrite(min_plus, 8, 1, output1);
}
size1 = 8-(size1 - size);
fread(a, 8, 1, input1);
RE_DES(a, b, min_plus);
fwrite(min_plus, size1, 1, output1);
fclose(input1);
fclose(output1);
}
RE_ECB函數(shù)是讀取一個(gè)密文文件,對(duì)其解密,結(jié)果存儲(chǔ)在新的文本文件中
輸入:密鑰b,原明文的字節(jié)數(shù)size
每次讀取八字節(jié)進(jìn)行解密,由于密文文件字節(jié)數(shù)是8的整數(shù)倍,而我們需要的解密文件不是8的整數(shù)倍,則讀到最后一個(gè)9字節(jié)密文時(shí),解密出來(lái)的明文選取合適的字節(jié)儲(chǔ)存進(jìn)去即可
主函數(shù)的構(gòu)建
int main() {
unsigned char b[8];
int size;
cout << "請(qǐng)輸入密鑰" << endl;
for (int i = 0; i < 8; i++) {
cin >> b[i];
}
size=ECB(b);
RE_ECB(b,size);
FILE* min = fopen("C:\\Users\\Administrator\\Desktop\\ECB_2.txt", "r ");
FILE* min1 = fopen("C:\\Users\\Administrator\\Desktop\\ECB.txt", "r");
char p, q;
int flag = 0;
for (int i = 0; i < size; i++) {
fread(&p, 1, 1, min);
fread(&q, 1, 1, min1);
if (p != q) {
flag = 1;
break;
}
}
if (flag==0) {
cout << "解密成功";
}
else {
cout<<"解密失敗";
}
return 0;
}
先輸入密鑰,再ECB加密,解密,然后將解密后的文件與原明文的文件進(jìn)行比較
如果相同則解密成功,否則解密失敗
總代碼
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <iostream>
using namespace std;
int key_3[17][48];
int zhihuan2[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 }; //置換2
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 }; //E盒
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 }; //P盒
int zhihuan1[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 }; //置換1
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 }; //IP置換
int IP_1[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 }; //IP_1置換
int get(int r) //得到第r輪的移位數(shù)
{
int i;
if (r == 1 || r == 2 || r == 9 || r == 16) {
i = 1;
}
else {
i = 2;
}
return i;
}
void yihuo(int* a, int* b, int num) //異或
{
int i;
for (i = 0; i < num; i++)
{
if (a[i] == b[i]) {//相同為0
a[i] = 0;
}
else {//不同為1
a[i] = 1;
}
}
}
void fuck(int a[64], int b[64], int n) {
for (int i = 0; i < n; i++) {
a[i] = b[i];
}
}
void left_move(int s[28], int s1[28], int n) //左移
{
int i, t, temp;
fuck(s, s1, 28);
for (i = 0; i < n; i++) {
temp = s[0];
for (t = 0; t < 27; t++) {
s[t] = s[t + 1];
}
s[27] = temp;//原先的左半部分第一位賦給最后一位
}
}
void exchange(int* a, int* b, int* biao, int n) //置換
{
int i, loc;
for (i = 0; i < n; i++)//輸入的第biao[i]位是輸出的第i位
{
loc = biao[i];
b[i] = a[loc - 1];
}
return;
}
void erzhuanshi(int* a, unsigned char* b, int n)
// a是二進(jìn)制數(shù)組,b是存放十六進(jìn)制的數(shù)組,n是二進(jìn)制數(shù)組的大小
{
int i, j;
n = n / 8;
for (i = 0; i < n; i++)
{
j = 128 * a[8 * i] + 64 * a[8 * i + 1] + 32 * a[8 * i + 2] + 16 * a[8 * i + 3] + 8 * a[8 * i + 4] + 4 * a[8 * i + 5] + 2 * a[8 * i + 6] + 1 * a[8 * i + 7];//先轉(zhuǎn)換為十進(jìn)制
b[i] = (char)j;//轉(zhuǎn)換為char型字符
}
}
void shizhuaner(int* a, int x, int i, int n)
// a是存放二進(jìn)制的數(shù)組,x是需要進(jìn)行轉(zhuǎn)換的十進(jìn)制數(shù),i是第i個(gè)十進(jìn)制數(shù),n是數(shù)組大小
{
int j; n = n / 8; j = n - 1;
do {
a[i * n + j] = x % 2;//x的2進(jìn)制最后一位,0or1
x = x / 2;//右移
j--;
} while (x != 0);
while (j >= 0)//如果右移后出現(xiàn)000....的情況
{
a[i * n + j] = 0;
j--;
}
return;
}
void s_box(int a[32], int b[48]) //S盒
{
int i, r, c, s;
int s1[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 } },
s2[4][16] = { { 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[4][16] = { { 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[4][16] = { { 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, 3 },{ 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14 } },
s5[4][16] = { { 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[4][16] = { { 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][16] = { { 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[4][16] = { { 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 (i = 0; i < 8; i++)
{
r = 2 * b[6 * i] + b[6 * i + 5];//第一位和最后一位構(gòu)建行
c = 8 * b[6 * i + 1] + 4 * b[6 * i + 2] + 2 * b[6 * i + 3] + b[6 * i + 4];//中間四位構(gòu)建列
switch (i) //選擇盒子
{
case 0:s = s1[r][c]; break;
case 1:s = s2[r][c]; break;
case 2:s = s3[r][c]; break;
case 3:s = s4[r][c]; break;
case 4:s = s5[r][c]; break;
case 5:s = s6[r][c]; break;
case 6:s = s7[r][c]; break;
case 7:s = s8[r][c]; break;
}
shizhuaner(a, s, i, 32); //轉(zhuǎn)化為二進(jìn)制
}
}
void DES(unsigned char a[8],unsigned char b[8],unsigned char plus3[8])
{
int m_a[64] = { 0 };
int m_b[64]; //IP置換前后的明文
int s_a[64] = { 0 };
int s_b[56]; //置換1前后的二進(jìn)制密鑰
int r; //輪數(shù)
int miwen[8] = { 0 }; //最終密文
int i, j = 0;
int key_l[17][28];//16輪密鑰
int key_r[17][28];
int key_2[17][56];
for (i = 0; i < 8; i++)
{
shizhuaner(m_a, (int)a[i], i, 64);
}
for (i = 0; i < 8; i++)
{
shizhuaner(s_a, (int)b[i], i, 64);
}
exchange(m_a, m_b, IP, 64); //明文進(jìn)行初始置換
int min_l[17][32];
int min_r[17][32];
for (i = 0; i < 32; i++)//明文第0輪的左半部分
min_l[0][i] = m_b[i];
for (i = 32; i < 64; i++)//明文的右半部分
min_r[0][i - 32] = m_b[i];
exchange(s_a, s_b, zhihuan1, 56);//密鑰進(jìn)行PC-1置換
int run = 1;
for (int i = 0; i < 28; i++) {
key_l[0][i] = s_b[i];
key_r[0][i] = s_b[i + 28];
}
int n;
for (r = 1; r <= 16; r++) {
n = get(r);
left_move(key_l[run], key_l[run - 1], n);
left_move(key_r[run], key_r[run - 1], n);
run++;
}
//結(jié)合
for (r = 1; r <= 16; r++) {
for (i = 0; i < 28; i++) {
key_2[r][i] = key_l[r][i];
key_2[r][i + 28] = key_r[r][i];
}
}
//pc-2置換
for (r = 1; r <= 16; r++) {
exchange(key_2[r], key_3[r], zhihuan2, 48);
}
//真正的16輪密鑰到此生成
int temp6[48], temp1[32];
for (int r = 1; r <= 16; r++) {
fuck(min_l[r], min_r[r - 1], 32);//左半部分等于上一輪右半部分
exchange(min_r[r - 1], temp6, e, 48);//E置換
yihuo(temp6, key_3[r], 48);//準(zhǔn)備S盒置換
s_box(temp1, temp6);//s盒替換完畢
exchange(temp1, temp6, p, 32);//P置換
yihuo(temp6, min_l[r - 1], 32);
fuck(min_r[r], temp6, 32);
}
int plus1[64] = { 0 };
int plus2[64] = { 0 };
for (i = 0; i < 32; i++) {
plus1[i] = min_r[16][i];
plus1[i + 32] = min_l[16][i];
}
exchange(plus1, plus2, IP_1, 64);
erzhuanshi(plus2, plus3, 64);
//plus3是密文
}
void RE_DES(unsigned char a[8],unsigned char b[8],unsigned char min_plus[8]) {
//開始解密
int plus2[64],plus1[64],min_l[17][32],min_r[17][32];
for (int i = 0; i < 8; i++) {
shizhuaner(plus2, int(a[i]), i, 64);
}
exchange(plus2, plus1, IP, 64);//IP_1置換
for (int i = 0; i < 32; i++) {
min_l[16][i] = plus1[i + 32];
min_r[16][i] = plus1[i];
}
cout << endl;
for (int r = 16; r >= 1; r--) {
fuck(min_r[r - 1], min_l[r], 32);//這一輪的左等于上一輪的右
exchange(min_r[r - 1], plus1, e, 48);//E擴(kuò)展
yihuo(plus1, key_3[r], 48);//與密鑰異或
s_box(plus2, plus1);//S盒置換
exchange(plus2, plus1, p, 32);//p盒置換
fuck(min_l[r - 1], plus1, 32);
yihuo(min_l[r - 1], min_r[r], 32);//異或
}
for (int i = 0; i < 32; i++) {
plus1[i + 32] = min_r[0][i];
plus1[i] = min_l[0][i];
}
exchange(plus1, plus2, IP_1, 64);;
erzhuanshi(plus2, min_plus, 64);
//min_plus是明文
}
int ECB(unsigned char b[8]) {
FILE* input = fopen("C:\\Users\\Administrator\\Desktop\\ECB.txt", "r");
FILE* output = fopen("C:\\Users\\Administrator\\Desktop\\ECB_1.txt", "a");
int size,size1;
unsigned char a[8],plus3[8];
fseek(input, 0, SEEK_END);
size = ftell(input);
fseek(input, 0, SEEK_SET);
for (int i = 0; i < size/8; i++) {
fread(a, 8, 1, input);
DES(a, b, plus3);
fwrite(plus3, 8, 1, output);
}
size1 = size % 8;
fread(a, size1, 1, input);
for (int i = size1; i < 8 ; i++) {
a[size1] = '0';
}
DES(a, b, plus3);
fwrite(plus3, 8, 1, output);
fclose(input);
fclose(output);
return size;
}
void RE_ECB(unsigned char b[8],int size) {
FILE* input1 = fopen("C:\\Users\\Administrator\\Desktop\\ECB_1.txt", "r");
FILE* output1 = fopen("C:\\Users\\Administrator\\Desktop\\ECB_2.txt", "a");
unsigned char min_plus[8];
int size1;
unsigned char a[8];
fseek(input1, 0, SEEK_END);
size1 = ftell(input1);
fseek(input1, 0, SEEK_SET);
for (int i = 0; i < size/8; i++) {
fread(a, 8, 1, input1);
RE_DES(a, b, min_plus);
fwrite(min_plus, 8, 1, output1);
}
size1 = 8-(size1 - size);
fread(a, 8, 1, input1);
RE_DES(a, b, min_plus);
fwrite(min_plus, size1, 1, output1);
fclose(input1);
fclose(output1);
}
int main() {
unsigned char b[8];
int size;
cout << "請(qǐng)輸入密鑰" << endl;
for (int i = 0; i < 8; i++) {
cin >> b[i];
}
size=ECB(b);
RE_ECB(b,size);
FILE* min = fopen("C:\\Users\\Administrator\\Desktop\\ECB_2.txt", "r ");
FILE* min1 = fopen("C:\\Users\\Administrator\\Desktop\\ECB.txt", "r");
char p, q;
int flag = 0;
for (int i = 0; i < size; i++) {
fread(&p, 1, 1, min);
fread(&q, 1, 1, min1);
if (p != q) {
flag = 1;
break;
}
}
if (flag==0) {
cout << "解密成功";
}
else {
cout<<"解密失敗";
}
return 0;
}
測(cè)試結(jié)果
明文文件
密文文件
解密文件
最終結(jié)果文章來(lái)源:http://www.zghlxwxcb.cn/news/detail-439760.html
文章來(lái)源地址http://www.zghlxwxcb.cn/news/detail-439760.html
到了這里,關(guān)于DES的加密解密在ECB上的使用(C語(yǔ)言實(shí)現(xiàn))——大三密碼學(xué)實(shí)驗(yàn)的文章就介紹完了。如果您還想了解更多內(nèi)容,請(qǐng)?jiān)谟疑辖撬阉鱐OY模板網(wǎng)以前的文章或繼續(xù)瀏覽下面的相關(guān)文章,希望大家以后多多支持TOY模板網(wǎng)!