C语言实现DES加密

!!!!!!!!!!!!!!!!!!!!!!!!!!

代码写错了,更新下,新地址:C++实现DES加密—-算法

!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
学习密码学,准备写个DES加密的程序,本来毫无头绪,就去百度了下,学习了别人写的代码,发现了现在百度上分享的DES加密算法大多都是错误的。

错误点1:输入8位char类型的字符串转换为64位输入密码的时候使用的ByteToBit字节组转换成位组函数

错误代码:

void ByteToBit(bool *Out, const char *In, int bits)//字节组转换成位组
{
    for(int i = 0; i < bits; i++)
    {
        Out[i] = (In[i/8] >> (i%8)) & 1;
    }
}

错误点在于输入的char字节转换成的二进制反了,例如输入‘a’,十进制是97,二进制是01100001,通过这个函数计算出的结果是10000110

因此正确的代码是:

void ByteToBit(bool *Out, const char *In, int bits)
{
    for(int i=0;i<bits;i++)
    {
        Out[i]=(In[i/8]<<(i%8)) &0x80;
    }
}

错误点2:根据DES加密函数参考资料上给出的过程,一共进行16轮加密,但是前轮加密会交换l r的位置,但是最后一次不会交换,而网上的代码16次轮转都是一样的过程,明显出了问题。

错误代码:

void Des_Run(char Out[8], char In[8], bool Type)
{
    static bool M[64], Tmp[32], *Li = &M[0], *Ri = &M[32];
    ByteToBit(M, In, 64);// 字节组转换成位组
    Transform(M, M, IP_Table, 64);// 变换
    if( Type == ENCRYPT ){
        for(int i=0; i<16; i++) {
            memcpy(Tmp, Ri, 32);
            F_func(Ri, SubKey[i]);
            Xor(Ri, Li, 32);// 异或
            memcpy(Li, Tmp, 32);
        }
    }else{
        for(int i=15; i>=0; i--) {
            memcpy(Tmp, Li, 32);
            F_func(Li, SubKey[i]);
            Xor(Li, Ri, 32);// 异或
            memcpy(Ri, Tmp, 32);
        }
    }
    Transform(M, M, IPR_Table, 64);// 变换
    BitToByte(Out, M, 64);
}

正确代码:

void Des_Run(char Out[8], char In[8])
{
    static bool Mingwen[64],temp[32],*Li=&Mingwen[0],*Ri=&Mingwen[32];
    ByteToBit(Mingwen,In,64); //明文转2进制
    Transform(Mingwen,Mingwen,IP_Table,64);   //置换ip
    for(int i=0;i<15;i++)     //前15轮
    {
        memcpy(temp,Ri,32);
        F_func(Ri,SubKey[i]);
        Xor(Ri,Li,32);
        memcpy(Li,temp,32);
    }
    memcpy(temp,Ri,32);        //补充第16轮1
    F_func(temp,SubKey[i]);
    Xor(Li,temp,32);

    Transform(Mingwen,Mingwen,IPR_Table,64); //逆置换
    ShowInHex(Mingwen);
}

学习参考
memcpy
c和c++使用的内存拷贝函数,memcpy函数的功能是从源src所指的内存地址的起始位置开始拷贝n个字节到目标dest所指的内存地址的起始位置中。
函数原型编辑
void *memcpy(void *dest, const void *src, size_t n);
使用这个函数可以轻松简单的实现数组的赋值,部分赋值和循环左移操作

16进制
定义16进制数例如 0x80会被系统自动识别为16进制的80
输出16进制数int x=10 printf(“%x”,x)输出就是以16进制输出的(a)

2^2*In[xxx] 执行顺序会出错

char str[]; 不确定的str数组错误
char str[]=”abcd”; 初始化了str,可以通过
char *str=new char[8]; 我的函数使用这个方式绕过了没有数组长度不能通过的问题
char str[]={abcd}; 错误
char str[]={‘a’,’b’,’c’,’d’};正确

DES加密算法源码:

#include "memory.h"
#include "stdio.h"
#include "conio.h"

void Des_Run(char Out[8], char In[8]);//核心加密算法
void SetKey(const char Key[8]);// 设置密钥
static void F_func(bool In[32], const bool Ki[48]);// f 函数
static void S_func(bool Out[32], const bool In[48]);// S 盒代替
static void Transform(bool *Out, bool *In, const char *Table, int len);// 变换
static void Xor(bool *InA, const bool *InB, int len);// 异或
static void RotateL(bool *In, int len, int loop);// 循环左移
static void ByteToBit(bool *Out, const char *In, int bits);// 字节组转换成位组
static void ShowInHex(const bool *In);     //以16进制输出

//置换IP表
const static char IP_Table[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-1表
const static char IPR_Table[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
};
//E位选择表(扩展置换表)
static const char E_Table[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
};
//P换位表(单纯换位表)
const static char P_Table[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
};
//PC1选位表(密钥生成置换表1)
const static char PC1_Table[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
};
//PC2选位表(密钥生成置换表2)
const static char PC2_Table[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
};
//左移位数表 
const static char LOOP_Table[16] = {
    1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1
};
// S盒
const static char S_Box[8][4][16] = {
        // 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
};

static bool SubKey[16][48];// 16圈子密钥

void ByteToBit(bool *Out, const char *In, int bits)
{
    for(int i=0;i<bits;i++)
    {
        Out[i]=(In[i/8]<<(i%8)) &0x80;
    }
}


void Transform(bool *Out, bool *In, const char *Table, int len)// 变换
{
    static bool Temp[256];
    for(int i = 0; i < len; i++)
    {
      Temp[i] = In[ Table[i] - 1 ];     //表上显示的是第几个数,-1才是数组的下标
    }
    memcpy(Out, Temp, len);
}


void Xor(bool *InA, const bool *InB, int len)// 异或
{
    for(int i=0;i<len;i++)
    {
        InA[i]=InA[i]^InB[i];
    }
}


void RotateL(bool *In, int len, int loop)// 循环左移
{
    static bool temp[256];
    memcpy(temp,In,loop);
    memcpy(In,In+loop,len-loop);
    memcpy(In+len-loop,temp,loop);
}

void SetKey(const char Key[8])// 设置密钥SubKey
{
    static  bool Key2[64],*C = &Key2[0], *D = &Key2[28];
    ByteToBit(Key2,Key,64);
    Transform(Key2,Key2,PC1_Table,56);
    for(int i=0;i<16;i++)
    {
        RotateL(C,28,LOOP_Table[i]);//c左移
        RotateL(D,28,LOOP_Table[i]);//d左移
        Transform(SubKey[i],Key2,PC2_Table,48);
    }
}


void F_func(bool In[32], const bool Ki[48])
{
    static bool Mr[48];
    Transform(Mr,In,E_Table,48);
    Xor(Mr,Ki,48);
    S_func(In,Mr);
    Transform(In,In,P_Table,32);
}


void S_func(bool Out[32], const bool In[48])
{
    for(int i=0;i<8;i++)  //8个s盒
    {
        int h=2*In[i*6]+1*In[i*6+5];
        int l=8*In[i*6+1]+4*In[i*6+2]+2*In[i*6+3]+1*In[i*6+4];        //这个地方不能写2^2*In[xxx]  执行顺序会出错
        int snum=S_Box[i][h][l];
        for(int j=0;j<4;j++)
        {
            Out[i*4+3-j]=snum%2;
            snum=snum/2;
        }
    }
}


void Des_Run(char Out[8], char In[8])
{
    static bool Mingwen[64],temp[32],*Li=&Mingwen[0],*Ri=&Mingwen[32];
    ByteToBit(Mingwen,In,64); //明文转2进制
    Transform(Mingwen,Mingwen,IP_Table,64);   //置换ip
    for(int i=0;i<15;i++)     //前15轮
    {
        memcpy(temp,Ri,32);
        F_func(Ri,SubKey[i]);
        Xor(Ri,Li,32);
        memcpy(Li,temp,32);
    }
    memcpy(temp,Ri,32);        //补充第16轮1
    F_func(temp,SubKey[i]);
    Xor(Li,temp,32);

    Transform(Mingwen,Mingwen,IPR_Table,64); //逆置换
    ShowInHex(Mingwen);
}


void ShowInHex(const bool In[64])
{
    unsigned int Hex[16]={0};
    for(int i=0;i<16;i++)
    {
        Hex[i]=8*In[0+i*4]+4*In[1+i*4]+2*In[2+i*4]+1*In[3+i*4];
    }

    for(i=0;i<16;i++)
    {
        printf("%x",Hex[i]);
    }

    printf("\n");
}


int main(int argc, char *argv[])
{
    char key[8];
    char *str=new char[8];
    printf("请输入秘钥(8位)");
    gets(key);
    printf("请输入你要加密的密文(8位)");
    gets(str);
    puts("Before encrypting");
    puts(str);
    SetKey(key);
    puts("After decrypting");
    Des_Run(str, str);
    return 0;
}

测试:
秘钥:“security”
明文:“computer”

加密后的密码:“3b6c72b2710eb513”

评论 6
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值