3des-wjcdes.cpp

一个SCSI的编程

#include "memory.h"
#include "WjcDes.h"
#include<stdlib.h>
#include<stdio.h>
#include<time.h>

#define bool char

//////////////////////////////////////////////////////////////////////////

// initial permutation IP
const static int 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
};
// final permutation IP^-1 ，reverse permutation
const static int 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};
// expansion operation matrix
static const int 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
};
// 32-bit permutation function P used on the output of the S-boxes 
const static int 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};
// permuted choice table (key) 
const static int 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
};
// permuted choice key (table) 
const static int 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
};
// number left rotations of pc1 
const static int LOOP_Table[16] = {
	1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1
};
// The (in)famous S-boxes 
const static int 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
};

typedef bool   (*PSubKey)[16][48];
static void DES(char chOut[8], char chIn[8], const PSubKey pPSubKey, bool iType);//标准DES加/解密
static void SetSubKey(PSubKey pPSubKey, const char KEY[8]);// 设置子密钥
static void F_func(bool bIn[32], const bool KI[48]);// f 函数
static void S_func(bool bOut[32], const bool bIn[48]);// S 盒代替
static void Transform(bool *bOut, bool *bIn, const int *TABLE, int iLen);// 变换
static void Xor(bool *bInA, const bool *bInB, int iLen);// 异或
static void RotateL(bool *bIn, int iLen, int iLoop);// 循环左移
static void ByteToBit(bool *bOut, const char *chIn, int iBits);// 字节组转换成位组
static void BitToByte( char *chOut, const bool *bIn, int iBits);// 位组转换成字节组
//static bool filerw(const char *fname,const char *KEY,bool iType);
//void SetKey(const char* KEY, int iLen);

//////////////////////////////////////////////////////////////////////////

static bool SubKey[2][16][48];// 16圈子密钥
//static bool Is3DES;// 3次DES标志
static char Tmp[256], deskey[16];
//static bool *psSubKey[16];
static bool psSubKey[16][48];//,rpsSubKey[16][48];


//////////////////////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////////////////////////////////////

void DES( char chOut[8], char chIn[8], const PSubKey pPSubKey, bool iType)
{    
	static bool s_bM[64], s_bTmp[32], *s_bLi=&s_bM[0], *s_bRi=&s_bM[32];
	bool bRTmp[32];
    
    ByteToBit(s_bM, chIn, 64);
   
    Transform(s_bM, s_bM, IP_Table, 64);

    if( iType==true)
	{
		for(int i=0; i<16; ++i) { 
		memcpy(s_bTmp, s_bRi, 32);
		F_func(s_bRi, (*pPSubKey)[i]);
  		Xor(s_bRi, s_bLi, 32);
		memcpy(s_bLi, s_bTmp, 32);
		}
	}
    else{
        for(int i=15; i>=0; --i) {
	memcpy(s_bTmp, s_bRi, 32);
	F_func(s_bRi, (*pPSubKey)[i]);
  	Xor(s_bRi, s_bLi, 32);
	memcpy(s_bLi, s_bTmp, 32);
       }
	}
 	memcpy(bRTmp,s_bM,32);
    memcpy(s_bM,s_bM+32,32);
    memcpy(s_bM+32,bRTmp,32);

    Transform(s_bM, s_bM, IPR_Table, 64);
	memset(chOut,0,8);
    	BitToByte(chOut, s_bM, 64);
}

void SetSubKey(PSubKey pPSubKey, const char KEY[8])
{
    static bool s_bK[64], *s_bKL=&s_bK[0], *s_bKR=&s_bK[28];
    ByteToBit(s_bK, KEY, 64);
    Transform(s_bK, s_bK, PC1_Table, 56);
    for(int i=0; i<16; ++i) {
        RotateL(s_bKL, 28, LOOP_Table[i]);
        RotateL(s_bKR, 28, LOOP_Table[i]);
        Transform((*pPSubKey)[i], s_bK, PC2_Table, 48);
    }
}
void F_func(bool bIn[32], const bool KI[48])
{
    static bool s_bMR[48];
    Transform(s_bMR, bIn, E_Table, 48);
//    printf("\nthis is KI\n");
//    for(int i=0;i<48;i++)
//    {
//	    if(i%8==0&&i!=0)
//		    printf("\n");
  //  		printf("%i",KI[i]);
//    }
    Xor(s_bMR, KI, 48);
    S_func(bIn, s_bMR);
    Transform(bIn, bIn, P_Table, 32);
//	printf("\ntrasposition after p\n");
//	for(i=0;i<32;i++)
//	{
//		if(i%8==0&&i!=0)
//			printf("\n");
//		printf("%i",bIn[i]);
//	}
//	printf("\n");
}
void S_func(bool bOut[32], const bool bIn[48])
{
	FILE *fp;
	int n=0;
//	char stmp[32];

//	memset(stmp,0,32);
		
	
	for(char i=0,j,k; i<8; ++i,bIn+=6) {
        j = (bIn[0]<<1) + bIn[5];
        k = (bIn[1]<<3) + (bIn[2]<<2) + (bIn[3]<<1) + bIn[4];
//	printf("s_box[%i]",i);		
	for(int m=0;m<4;m++)
	{	
	*(bOut++)=(S_Box[i][j][k]>>(3-m))&0x01;
//	printf("%i",*(bOut-1));
	}
//	printf("\n");
    	}
}
void Transform(bool *bOut, bool *bIn, const int *TABLE, int iLen)
{
	  for(int i=0; i<iLen; i++)
        Tmp[i] = bIn[TABLE[i]-1 ];
    memcpy(bOut, Tmp, iLen);
}
void Xor(bool *bInA, const bool *bInB, int iLen)
{
    for(int i=0; i<iLen; ++i)
        bInA[i] ^= bInB[i];
}
void RotateL(bool *bIn, int iLen, int iLoop)
{
    memcpy(Tmp, bIn, iLoop);
    memcpy(bIn, bIn+iLoop, iLen-iLoop);
    memcpy(bIn+iLen-iLoop, Tmp, iLoop);
}
void ByteToBit(bool *bOut, const char *chIn, int iBits)
{
	if(iBits!=4)
	{
    for(int i=0; i<iBits; ++i)
        bOut[i] = (chIn[i>>3]>>(7-(i&7))) & 1;
	}
	else
	{
	for(int i=0; i<iBits; ++i)
		bOut[i]=(chIn[1>>3]>>(3-(i&4))&1);
	}
}
void BitToByte( char *chOut, const bool *bIn, int iBits)
{
    memset(chOut, 0, iBits>>3);
    for(int i=0; i<iBits; ++i)
    {
	chOut[i>>3]|=bIn[i]<<(7-i&7);
    }
}