DES加密算法C++实现,全程位运算!

/*
 *  DES加密&解密算法实现
 *  源代码参考:https://www.bilibili.com/h5/note-app/view?cvid=13258932&pagefrom=comment
 *  二进制优化&代码重构:XiaoWei_ObertysCrtys 2023/10/14
 *  编译环境:GNU GCC Complier -std=gnu++17 CodeblocksIDE
 */
#include<cstdint>
#include<iostream>

using namespace std;
class DES
{
    static const uint8_t IP1[64];   //初始IP置换表
    static const uint8_t IP_1[64]; //逆IP置换表
    static const uint8_t EBox[48];
    static const uint8_t PBox[32];
    static const uint8_t SBox[8][4][16];
    static const uint8_t PC1[56];    //密钥置换选择表1
    static const uint8_t PC2[48];    //密钥置换选择表2
    static const uint8_t keyShiftTable[16]; //子密钥循环左移表

private:
    static constexpr uint64_t highestBit64=(0x1ULL<<63);
    static constexpr uint32_t highestBit32=(0x1U<<31);
    uint64_t key[17] {}; //密钥的比特表示
    uint64_t word; //数据的比特表示
    uint32_t L[17];  //轮次左数据半块的比特表示
    uint32_t R[17];  //轮次右数据半块的比特表示

    uint32_t F(uint32_t Ri, uint64_t Ki); //费斯妥函数F
    uint64_t E(uint32_t Ri); //E盒扩展
    uint32_t S(uint64_t Ri); //S盒压缩
    uint32_t P(uint32_t Ri); //P盒置换
    void generateKey(void); //密钥生成
    void initialPermutation(void); //初始IP置换
    void enIterate(); //16轮加密回次
    void deIterate(); //16轮解密回次
    void finalPermutation(void); //逆IP置换

public:
    explicit inline DES(uint64_t mword=0,uint64_t mkey=0);
    ~DES()=default;
    uint64_t enCode(void);
    uint64_t deCode(void);
    inline uint64_t getResult(void) const; //获取运算结果
};

int main(void)
{
    uint64_t (*strToData)(char*)=[](char* str)
    {
        uint64_t res=0;
        for(int i=0; i<7; ++i)
        {
            res|=str[i];
            res<<=8;
        }
        res|=str[7];
        return res;
    };  //8位字符串转数据块
    char* (*dataToStr)(uint64_t code,char*)=[](uint64_t code,char* str)
    {
        for(int i=0; i<8; ++i)
        {
            str[7-i]=code&0xff;
            code>>=8;
        }
        return str;
    };  //数据块转8位字符串
    ios::sync_with_stdio(false);
    char oralWord[9]="hi,world";
    DES password(strToData(oralWord),202310141957ULL);
    cout<<dataToStr(password.enCode(),oralWord)<<endl;
    cout<<dataToStr(password.deCode(),oralWord)<<endl;
    DES password2(strToData(oralWord),0ULL);
    cout<<dataToStr(password2.enCode(),oralWord)<<endl;
    cout<<dataToStr(password2.deCode(),oralWord)<<endl;
    DES password4(strToData(oralWord),111ULL);
    cout<<dataToStr(password4.enCode(),oralWord)<<endl;
    cout<<dataToStr(password4.deCode(),oralWord)<<endl;
    DES password3(strToData(oralWord),~0ULL);
    cout<<dataToStr(password3.enCode(),oralWord)<<endl;
    cout<<dataToStr(password3.deCode(),oralWord)<<endl;
    DES t(0x8C4CCC2CAC6CEC1CULL,0);
    printf("%llX\n",t.enCode());
    printf("%llX\n",t.deCode());
    DES t2(0x8C4CCC2CAC6CEC1CULL,2);
    printf("%llX\n",t2.enCode());
    printf("%llX\n",t2.deCode());
    DES t3(0x8C4CCC2CAC6CEC1CULL,4);
    printf("%llX\n",t3.enCode());
    printf("%llX\n",t3.deCode());
    DES t4(0x8C4CCC2CAC6CEC1CULL,8);
    printf("%llX\n",t4.enCode());
    printf("%llX\n",t4.deCode());
    return 0;
}


inline DES::DES(uint64_t mword, uint64_t mkey):word(mword)
{
    key[0]=mkey;
    generateKey();
}

uint64_t DES::enCode(void)
{
    initialPermutation();
    enIterate();
    finalPermutation();
    return getResult();
}
uint64_t DES::deCode(void)
{
    initialPermutation();
    deIterate();
    finalPermutation();
    return getResult();
}

void DES::initialPermutation(void)   //初始IP置换
{
    uint64_t temp(0ULL);
    for(int i=0; i<64; ++i)
        if(word&(highestBit64>>(IP1[i]-1)))
            temp|=highestBit64>>i;
    L[0]=(temp&(0xffffffffULL<<32))>>32;
    R[0]=temp&0xffffffffULL;
    return;
}

void DES::finalPermutation(void) //IP逆置换
{
    uint64_t temp(0ULL);
    word=(static_cast<uint64_t>(R[16])<<32)|static_cast<uint64_t>(L[16]);
    for(int i=0; i<64; ++i)
        if(word&(highestBit64>>(IP_1[i]-1)))
            temp|=highestBit64>>i;
    word=temp;
    return;
}

void DES::enIterate(void) //16轮加密回次
{
    for(int i=0; i<16; ++i)
    {
        L[i+1]=R[i];
        uint32_t temp=F(R[i],key[i+1]);
        R[i+1]=L[i]^temp;
    }
    return;
}
void DES::deIterate(void) //16轮解密回次
{
    for(int i=0; i<16; ++i)
    {
        L[i+1]=R[i];
        uint32_t temp=F(R[i],key[16-i]);
        R[i+1]=L[i]^temp;
    }
    return;
}

uint32_t DES::F(uint32_t Ri,uint64_t Ki) //轮函数F
{
    uint64_t temp=E(Ri);
    temp^=Ki;
    uint32_t res=S(temp);
    return P(res);
}

uint64_t DES::E(uint32_t Ri)   //E盒拓展
{
    uint64_t res(0ULL);
    for(int i=0; i<48; ++i)
        if(Ri&(highestBit32>>(EBox[i]-1)))
            res|=highestBit64>>i;
    return res;
}

uint32_t DES::S(uint64_t Ri) //S盒压缩
{
    uint32_t res(0U);
    for(int i=0; i<8; ++i)
    {
        res<<=4;
        //uint8_t single6=Ri&(0x3FULL<<(16+6*(7-i)));
        //uint8_t n=SBox[i][(single6&0x1)|(single6&0x20)>>4][(single6>>1)&0xf];
        uint8_t single6=(Ri&(0xFC00000000000000ULL>>(i*8)))>>(56-6*i);
        uint8_t n=SBox[i][((single6&0x80)>>6)|((single6&0x4)>>2)][(single6>>3)&0xF];
        res|=n;
    }
    return res;
}

uint32_t DES::P(uint32_t Ri) //P盒置换
{
    uint32_t res(0U);
    for(int i=0; i<32; ++i)
        if(Ri&(highestBit32>>(PBox[i]-1)))
            res|=highestBit32>>i;
    return res;
}

void DES::generateKey(void) //密钥生成
{
    uint32_t (*forMoveLeftSingle)(uint32_t)=[](uint32_t x)
    {
        uint32_t l=(x&highestBit32)>>27;
        x<<=1;
        x|=l;
        return x;
    };
    uint32_t (*forMoveLeftDouble)(uint32_t)=[](uint32_t x)
    {
        uint32_t ll=x&(0x3U<<30);
        x<<=2;
        x|=ll>>26;
        return x;
    };
    uint64_t key56(0ULL);
    for(int i=0; i<56; ++i)
        if(key[0]&(highestBit64>>(PC1[i]-1)))
            key56|=highestBit64>>i;
    uint32_t C=(key56&0xFFFFFFF000000000ULL)>>32,D=(key56&0xFFFFFFF00ULL)>>4;
    for(int i=0; i<16; ++i)
    {
        if(keyShiftTable[i]==1)
        {
            C=forMoveLeftSingle(C);
            D=forMoveLeftSingle(D);
        }
        else
        {
            C=forMoveLeftDouble(C);
            D=forMoveLeftDouble(D);
        }
        key56=(static_cast<uint64_t>(C)<<32)|(static_cast<uint64_t>(D)<<4);
        for(int j=0; j<48; ++j)
            if(key56&(highestBit64>>(PC2[j]-1)))
                key[i+1]|=highestBit64>>j;
    }
}

inline uint64_t DES::getResult(void) const  //获取运算结果
{
    return word;
}

constexpr uint8_t DES::IP1[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
};
constexpr uint8_t DES::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
};
constexpr uint8_t DES::EBox[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
};
constexpr uint8_t DES::PBox[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
};
constexpr uint8_t DES::SBox[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}
    },// S1盒
    {
        {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}
    },// S2盒
    {
        {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}
    },// S3盒
    {
        {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}
    },// S4盒
    {
        {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}
    },// S5盒
    {
        {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}
    },// S6盒
    {
        {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}
    },// S7盒
    {
        {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}
    }// S8盒
};
constexpr uint8_t DES::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,
    3, 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
constexpr uint8_t DES::PC2[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
constexpr uint8_t DES::keyShiftTable[16] = { 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 }; //子密钥循环左移表

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值