#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include "des.h"
#define ENCRYPT 1
#define DECRYPT 0
typedef struct des_key_schedule {
unsigned char b[16][48];
} des_key_schedule;
static void unbit(unsigned char *to, unsigned char *from, int len);
static void pkbit(unsigned char *to, unsigned char *from, int len);
static void perm(unsigned char *to, const unsigned char *op, unsigned char *from, int bits);
static void rot(unsigned char *r, int len, int bits);
static void add2(unsigned char *to, unsigned char *from, int bits);
static void subs(unsigned char *o, unsigned char *i, int s);
static int des_set_key(unsigned char *key, des_key_schedule *ks);
static void des_func(unsigned char* in, unsigned char* out, unsigned char* key, int enc);
static void des_encrypt_char(unsigned char* sPlain, unsigned char* sCipher,unsigned char* sKey);
static void des_decrypt_char(unsigned char* sCipher, unsigned char* sPlain, unsigned char* sKey);
/***************************************************************
* Data Structure:initial permutation IP
*
* Description:
* The first permutation for input data. 64 bits ----> 64 bits.
*
***************************************************************/
static const unsigned char 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
};
/****************************************************************
* Data Structure:final permutation FP
*
* Description:
* The inverse of initial permutation(IP). 64 bits ----> 64 bits
*
****************************************************************/
static const unsigned char 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
};
/***************************************************************
* Data Structure: left shift table for key schedule LS
*
* Description:
* The rotation left shift for key schedule. In main encrypt loop,
* 56-bit keys(exclude the check bits 8,16,etc.) pass into PC1, and
* then divide into 2 groups, every group(28-bit) rotation left
* shift LS[i] bits in the i-th loop. At last, the two groups(56-bit)
* pass into PC2.
*
***************************************************************/
static const unsigned char LS[16] =
{
1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1
};
/***************************************************************
* Data Structure:permuted-choice tables for key schedule pc1, pc2
*
* Description:
* For input 56-bit keys, it produce the other order keys via
* the permuted-choice tables.
* 56 bits ----> 56 bits.
*
***************************************************************/
/* Use the key schedule specified in the standard ( ANSI X3.92-1981 ), */
static const unsigned char 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,
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
};
static const unsigned char 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
};
/****************************************************************
* Data Structure:bit-selection table E
*
* Descripton:
* bit-selection and expansion algriothm: 32 bits ----> 48 bits.
*
****************************************************************/
static const unsigned char 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
};
/***************************************************************
* Data Structure:substitution tables ST
*
* Description:
* 48 bits ----> 32 bits. (6 bits --> 4 bits)
* selection-compression substitution table: Divide input 48 bits
* into 8 groups, 6 bits per group. Then pass this 8 groups into
* 8 seperate S-box, where every S-box is a nonlinear substitution
* network with 6 bits input and 4 bits output. The following are
* 8 selection-compression functions for 8 S-box, every function
* contains a 2-dimension array(4 X 16 = 64 elements).
*
***************************************************************/
static const unsigned char ST[8][64] = {
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
};
/***************************************************************
* Data Structure:permutation table P
*
* Description:
* 32 bits ----> 32 bits
* Bit's index exchange.
*
***************************************************************/
static const unsigned char 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
};
/***************************************************************
* Routine:unbit(to, from, len) -- unpack len bytes to bits
*
* Description:
* Convert bytes array into bits stream.
*
* Parameter:
* to : Output; The pointer to output bits stream.
* from : Input; The input char (byte) array.
* len : Input; The length of input char array.
*
************************
刘良运
- 粉丝: 77
- 资源: 1万+
最新资源
- 冒泡排序算法详解及Java与Python实现
- 字幕网页文字检测20-YOLO(v5至v11)、COCO、CreateML、Paligemma、TFRecord、VOC数据集合集.rar
- FastAdmin后台框架开源且可以免费商用,一键生成CRUD, 一款基于ThinkPHP和Bootstrap的极速后台开发框架,基于Auth验证的权限管理系统,一键生成 CRUD,自动生成控制器等
- IMG_4525.jpg
- 基于 Spring Cloud 的一个分布式系统套件的整合 具备 JeeSite4 单机版的所有功能,统一身份认证,统一基础数据管理,弱化微服务开发难度
- GigaDevice.GD32F4xx-DFP.2.1.0 器件安装包
- 智慧校园数字孪生,三维可视化
- 多种土地使用类型图像分类数据集【已标注,约30,000张数据】
- 3.0(1).docx
- 国产文本编辑器:EverEdit用户手册 1.1.0
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈