加入简书有点时间了，最近在学产品，每周都有作业就是写简书，发现自己的写作水准跟同学们比，简直不堪入目，既然文章写的不好那就直接写点自己研究的技术干货吧
公司erp 产品是用delphi开发实现的，想了解我们公司的可以点击这个链接温州索易软件开发有限公司，后期随着产品线的深入，公司很多业务也转用java 来开发，其中des的加密算法在两个语言中是不对称的，在网上找了很多别人的代码，要么就是只支持英文，要么就是太长就不行，既然找不到轮子，无奈之下只有自己造了，直接上代码希望给有此困扰的人 代码帮助
delphi des 加密代码
unit SoeDesUnt;
interface
uses
SysUtils, Vcl.Dialogs;
type
TKeyByte = array[0..5] of Byte;
TDesMode = (dmEncry, dmDecry);
TPowerDes = class
private
procedure PermutationChoose1(inData: array of Byte;
var outData: array of Byte);
procedure PermutationChoose2(inData: array of Byte;
var outData: array of Byte);
procedure CycleMove(var inData: array of Byte; bitMove: Byte);
procedure MakeKey(inKey: array of Byte; var outKey: array of TKeyByte);
procedure Encry(inData, subKey: array of Byte;
var outData: array of Byte);
procedure DesData(desMode: TDesMode;
inData: array of Byte; var outData: array of Byte);
protected
public
procedure ConversePermutation(var inData: array of Byte);
procedure InitPermutation(var inData: array of Byte);
function EncryStr(AStr, AKey: AnsiString): ansiString;
function DecryStr(AStr, AKey: AnsiString): ansiString;
//EncryStrHex
function PowerEncry(AStr, AKey: AnsiString): ansiString;
//DecryStrHex
function PowerDecry(AStrHex, AKey: AnsiString): ansiString;
procedure Expand(inData: array of Byte; var outData: array of Byte);
procedure Permutation(var inData: array of Byte);
function Si(s,inByte: Byte): Byte;
published
end;
const
BitIP: array[0..63] of Byte =
(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,
56, 48, 40, 32, 24, 16, 8, 0,
58, 50, 42, 34, 26, 18, 10, 2,
60, 52, 44, 36, 28, 20, 12, 4,
62, 54, 46, 38, 30, 22, 14, 6 );
BitCP: array[0..63] of Byte =
( 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,
32, 0, 40, 8, 48, 16, 56, 24 );
BitExp: array[0..47] of Integer =
( 31, 0, 1, 2, 3, 4, 3, 4, 5, 6, 7, 8, 7, 8, 9,10,
11,12,11,12,13,14,15,16,15,16,17,18,19,20,19,20,
21,22,23,24,23,24,25,26,27,28,27,28,29,30,31,0 );
BitPM: array[0..31] of Byte =
( 15, 6,19,20,28,11,27,16, 0,14,22,25, 4,17,30, 9,
1, 7,23,13,31,26, 2, 8,18,12,29, 5,21,10, 3,24 );
sBox: array[0..7] of array[0..63] of Byte =
( ( 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 ) );
BitPMC1: array[0..55] of Byte =
( 56, 48, 40, 32, 24, 16, 8,
0, 57, 49, 41, 33, 25, 17,
9, 1, 58, 50, 42, 34, 26,
18, 10, 2, 59, 51, 43, 35,
62, 54, 46, 38, 30, 22, 14,
6, 61, 53, 45, 37, 29, 21,
13, 5, 60, 52, 44, 36, 28,
20, 12, 4, 27, 19, 11, 3 );
BitPMC2: array[0..47] of Byte =
( 13, 16, 10, 23, 0, 4,
2, 27, 14, 5, 20, 9,
22, 18, 11, 3, 25, 7,
15, 6, 26, 19, 12, 1,
40, 51, 30, 36, 46, 54,
29, 39, 50, 44, 32, 47,
43, 48, 38, 55, 33, 52,
45, 41, 49, 35, 28, 31 );
implementation
var
subKey: array[0..15] of TKeyByte;
procedure TPowerDes.InitPermutation(var inData: array of Byte);
var
newData: array[0..7] of Byte;
i: Integer;
begin
FillChar(newData, 8, 0);
for i := 0 to 63 do
if (inData[BitIP[i] shr 3] and (1 shl (7- (BitIP[i] and $07)))) <> 0 then
newData[i shr 3] := newData[i shr 3] or (1 shl (7-(i and $07)));
for i := 0 to 7 do
begin
inData[i] := newData[i];
end;
end;
procedure TPowerDes.ConversePermutation(var inData: array of Byte);
var
newData: array[0..7] of Byte;
i: Integer;
begin
FillChar(newData, 8, 0);
for i := 0 to 63 do
if (inData[BitCP[i] shr 3] and (1 shl (7-(BitCP[i] and $07)))) <> 0 then
newData[i shr 3] := newData[i shr 3] or (1 shl (7-(i and $07)));
for i := 0 to 7 do inData[i] := newData[i];
end;
procedure TPowerDes.Expand(inData: array of Byte; var outData: array of Byte);
var
i: Integer;
begin
FillChar(outData, 6, 0);
for i := 0 to 47 do
if (inData[BitExp[i] shr 3] and (1 shl (7-(BitExp[i] and $07)))) <> 0 then
outData[i shr 3] := outData[i shr 3] or (1 shl (7-(i and $07)));
end;
procedure TPowerDes.Permutation(var inData: array of Byte);
var
newData: array[0..3] of Byte;
i: Integer;
begin
FillChar(newData, 4, 0);
for i := 0 to 31 do
if (inData[BitPM[i] shr 3] and (1 shl (7-(BitPM[i] and $07)))) <> 0 then
newData[i shr 3] := newData[i shr 3] or (1 shl (7-(i and $07)));
for i := 0 to 3 do inData[i] := newData[i];
end;
function TPowerDes.Si(s,inByte: Byte): Byte;
var
c: Byte;
begin
c := (inByte and $20) or ((inByte and $1e) shr 1) or
((inByte and $01) shl 4);
Result := (sBox[s][c] and $0f);
end;
procedure TPowerDes.PermutationChoose1(inData: array of Byte;
var outData: array of Byte);
var
i: Integer;
begin
FillChar(outData, 7, 0);
for i := 0 to 55 do
if (inData[BitPMC1[i] shr 3] and (1 shl (7-(BitPMC1[i] and $07)))) <> 0 then
outData[i shr 3] := outData[i shr 3] or (1 shl (7-(i and $07)));
end;
procedure TPowerDes.PermutationChoose2(inData: array of Byte;
var outData: array of Byte);
var
i: Integer;
begin
FillChar(outData, 6, 0);
for i := 0 to 47 do
if (inData[BitPMC2[i] shr 3] and (1 shl (7-(BitPMC2[i] and $07)))) <> 0 then
outData[i shr 3] := outData[i shr 3] or (1 shl (7-(i and $07)));
end;
procedure TPowerDes.CycleMove(var inData: array of Byte; bitMove: Byte);
var
i: Integer;
begin
for i := 0 to bitMove - 1 do
begin
inData[0] := (inData[0] shl 1) or (inData[1] shr 7);
inData[1] := (inData[1] shl 1) or (inData[2] shr 7);
inData[2] := (inData[2] shl 1) or (inData[3] shr 7);
inData[3] := (inData[3] shl 1) or ((inData[0] and $10) shr 4);
inData[0] := (inData[0] and $0f);
end;
end;
procedure TPowerDes.MakeKey(inKey: array of Byte; var outKey: array of TKeyByte);
const
bitDisplace: array[0..15] of Byte =
( 1,1,2,2, 2,2,2,2, 1,2,2,2, 2,2,2,1 );
var
outData56: array[0..6] of Byte;
key28l: array[0..3] of Byte;
key28r: array[0..3] of Byte;
key56o: array[0..6] of Byte;
i: Integer;
begin
permutationChoose1(inKey, outData56);
key28l[0] := outData56[0] shr 4;
key28l[1] := (outData56[0] shl 4) or (outData56[1] shr 4);
key28l[2] := (outData56[1] shl 4) or (outData56[2] shr 4);
key28l[3] := (outData56[2] shl 4) or (outData56[3] shr 4);
key28r[0] := outData56[3] and $0f;
key28r[1] := outData56[4];
key28r[2] := outData56[5];
key28r[3] := outData56[6];
for i := 0 to 15 do
begin
cycleMove(key28l, bitDisplace[i]);
cycleMove(key28r, bitDisplace[i]);
key56o[0] := (key28l[0] shl 4) or (key28l[1] shr 4);
key56o[1] := (key28l[1] shl 4) or (key28l[2] shr 4);
key56o[2] := (key28l[2] shl 4) or (key28l[3] shr 4);
key56o[3] := (key28l[3] shl 4) or (key28r[0]);
key56o[4] := key28r[1];
key56o[5] := key28r[2];
key56o[6] := key28r[3];
permutationChoose2(key56o, outKey[i]);
end;
end;
procedure TPowerDes.Encry(inData, subKey: array of Byte;
var outData: array of Byte);
var
outBuf: array[0..5] of Byte;
buf: array[0..7] of Byte;
i: Integer;
begin
expand(inData, outBuf);
for i := 0 to 5 do outBuf[i] := outBuf[i] xor subKey[i];
// outBuf xxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxx xxxxxxxx
buf[0] := outBuf[0] shr 2; //xxxxxx -> 2
buf[1] := ((outBuf[0] and $03) shl 4) or (outBuf[1] shr 4); // 4 <- xx xxxx -> 4
buf[2] := ((outBuf[1] and $0f) shl 2) or (outBuf[2] shr 6); // 2 <- xxxx xx -> 6
buf[3] := outBuf[2] and $3f; // xxxxxx
buf[4] := outBuf[3] shr 2; // xxxxxx
buf[5] := ((outBuf[3] and $03) shl 4) or (outBuf[4] shr 4); // xx xxxx
buf[6] := ((outBuf[4] and $0f) shl 2) or (outBuf[5] shr 6); // xxxx xx
buf[7] := outBuf[5] and $3f; // xxxxxx
for i := 0 to 7 do buf[i] := si(i, buf[i]);
for i := 0 to 3 do outBuf[i] := (buf[i*2] shl 4) or buf[i*2+1];
permutation(outBuf);
for i := 0 to 3 do outData[i] := outBuf[i];
end;
procedure TPowerDes.DesData(desMode: TDesMode;
inData: array of Byte; var outData: array of Byte);
// inData, outData 都为8Bytes，否则出错
var
i, j: Integer;
temp, buf: array[0..3] of Byte;
begin
for i := 0 to 7 do outData[i] := inData[i];
initPermutation(outData);
if desMode = dmEncry then
begin
for i := 0 to 15 do
begin
for j := 0 to 3 do temp[j] := outData[j]; //temp = Ln
for j := 0 to 3 do outData[j] := outData[j + 4]; //Ln+1 = Rn
encry(outData, subKey[i], buf); //Rn ==Kn==> buf
for j := 0 to 3 do outData[j + 4] := temp[j] xor buf[j]; //Rn+1 = Ln^buf
end;
for j := 0 to 3 do temp[j] := outData[j + 4];
for j := 0 to 3 do outData[j + 4] := outData[j];
for j := 0 to 3 do outData[j] := temp[j];
end
else if desMode = dmDecry then
begin
for i := 15 downto 0 do
begin
for j := 0 to 3 do temp[j] := outData[j];
for j := 0 to 3 do outData[j] := outData[j + 4];
encry(outData, subKey[i], buf);
for j := 0 to 3 do outData[j + 4] := temp[j] xor buf[j];
end;
for j := 0 to 3 do temp[j] := outData[j + 4];
for j := 0 to 3 do outData[j + 4] := outData[j];
for j := 0 to 3 do outData[j] := temp[j];
end;
conversePermutation(outData);
end;
//////////////////////////////////////////////////////////////
function TPowerDes.EncryStr(AStr, AKey: AnsiString): AnsiString;
var
StrByte, OutByte, KeyByte: array[0..7] of Byte;
StrResult: AnsiString;
I, J: Integer;
begin
if (Length(AStr) > 0) and (Ord(AStr[Length(AStr)]) = 0) then
raise Exception.Create('错误：最后一个字符为空！');
if Length(AKey) < 8 then
while Length(AKey) < 8 do AKey := AKey + Chr(0);
while Length(AStr) mod 8 <> 0 do AStr := AStr + Chr(0);
for J := 0 to 7 do KeyByte[J] := Ord(AKey[J + 1]);
makeKey(keyByte, subKey);
StrResult := '';
for I := 0 to Length(AStr) div 8 - 1 do
begin
for J := 0 to 7 do
StrByte[J] := Ord(AStr[I * 8 + J + 1]);
desData(dmEncry, StrByte, OutByte);
for J := 0 to 7 do
StrResult := StrResult + AnsiChar(OutByte[J]); //D2009 chr-->ansiChar power 09-07-09
end;
Result := StrResult;
end;
function TPowerDes.DecryStr(AStr, AKey: AnsiString): ansiString;
var
StrByte, OutByte, KeyByte: array[0..7] of Byte;
StrResult: AnsiString;
I, J: Integer;
begin
if Length(AKey) < 8 then
while Length(AKey) < 8 do AKey := AKey + Chr(0);
for J := 0 to 7 do KeyByte[J] := Ord(AKey[J + 1]);
makeKey(keyByte, subKey);
StrResult := '';
for I := 0 to Length(AStr) div 8 - 1 do
begin
for J := 0 to 7 do StrByte[J] := Ord(AStr[I * 8 + J + 1]);
desData(dmDecry, StrByte, OutByte);
for J := 0 to 7 do
StrResult := StrResult + AnsiChar(OutByte[J]); //D2009 chr-->ansiChar power 09-07-09
end;
while (Length(StrResult) > 0) and
(Ord(StrResult[Length(StrResult)]) = 0) do
Delete(StrResult, Length(StrResult), 1);
Result := StrResult;
end;
///////////////////////////////////////////////////////////
function TPowerDes.PowerEncry(AStr, AKey: AnsiString): ansiString;
var
StrResult, TempResult, Temp: AnsiString;
I: Integer;
begin
TempResult := EncryStr(AStr, AKey);
StrResult := '';
for I := 0 to Length(TempResult) - 1 do
begin
Temp := Format('%x', [Ord(TempResult[I + 1])]);
if Length(Temp) = 1 then Temp := '0' + Temp;
StrResult := StrResult + Temp;
end;
Result := StrResult;
end;
function TPowerDes.PowerDecry(AStrHex, AKey: AnsiString): ansiString;
function HexToInt(AHex: AnsiString): Integer;
var
I, Res: Integer;
ch: AnsiChar;
begin
Res := 0;
for I := 0 to Length(AHex) - 1 do
begin
ch := AHex[I + 1];
if (ch >= '0') and (ch <= '9') then
Res := Res * 16 + Ord(ch) - Ord('0')
else if (ch >= 'A') and (ch <= 'F') then
Res := Res * 16 + Ord(ch) - Ord('A') + 10
else if (ch >= 'a') and (ch <= 'f') then
Res := Res * 16 + Ord(ch) - Ord('a') + 10
else raise Exception.Create('错误：不是十六进制的字符串！');
end;
Result := Res;
end;
var
tmpStr, Temp: AnsiString;
I: Integer;
begin
tmpStr := '';
for I := 0 to Length(AStrHex) div 2 - 1 do
begin
Temp := Copy(AStrHex, I * 2 + 1, 2);
tmpStr := tmpStr + AnsiChar(HexToInt(Temp)); //D2009 chr-->ansiChar power 09-07-09
end;
Result := DecryStr(tmpStr, AKey);
end;
end.
接下来 是 java des 加密算法
packagecn.soesoft.user.utils;
importio.jsonwebtoken.lang.Assert;
import staticcn.soesoft.user.utils.PowerDES.TDesMode.dmDecry;
import staticcn.soesoft.user.utils.PowerDES.TDesMode.dmEncry;
/**
* Created with IntelliJ IDEA.
* User: luc
* Date: 17-3-29
* Time:上午8:48
*功能描述:
*解决足浴系统 加密 不兼容问题
*/
public classPowerDES {
enumTDesMode {
dmEncry,dmDecry
}
//0-63
private static byte[]bitIP= {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,
56,48,40,32,24,16,8,0,
58,50,42,34,26,18,10,2,
60,52,44,36,28,20,12,4,
62,54,46,38,30,22,14,6};
//0-63
private static byte[]bitCP= {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,
32,0,40,8,48,16,56,24};
//0-47
private static int[]bitExp= {31,0,1,2,3,4,3,4,5,6,7,8,7,8,9,10,
11,12,11,12,13,14,15,16,15,16,17,18,19,20,19,20,
21,22,23,24,23,24,25,26,27,28,27,28,29,30,31,0};
//0-31
private static byte[]bitPm= {15,6,19,20,28,11,27,16,0,14,22,25,4,17,30,9,
1,7,23,13,31,26,2,8,18,12,29,5,21,10,3,24};
//0-7 0-63
private static byte[][]sBox= {
{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}
};
private static byte[][]subKey=new byte[16][6];
//0-55
private static byte[]bitPMC1= {56,48,40,32,24,16,8,
0,57,49,41,33,25,17,
9,1,58,50,42,34,26,
18,10,2,59,51,43,35,
62,54,46,38,30,22,14,
6,61,53,45,37,29,21,
13,5,60,52,44,36,28,
20,12,4,27,19,11,3};
//0-47
private static byte[]bitPMC2= {13,16,10,23,0,4,
2,27,14,5,20,9,
22,18,11,3,25,7,
15,6,26,19,12,1,
40,51,30,36,46,54,
29,39,50,44,32,47,
43,48,38,55,33,52,
45,41,49,35,28,31};
//初始化 排列
private static voidinitPermutation(byte[] inData) {
byte[] newData =new byte[8];
for(inti =0; i <=63; i++) {
if((inData[bitIP[i] >>>3] & (1<< (7- (bitIP[i] &0x07)))) !=0) {
newData[i >>>3] = (byte) ((newData[i >>>3] | (1<< (7- (i &0x07)))) &0xFF);
}
}
for(inti =0; i <=7; i++) {
inData[i] = newData[i];
}
}
private static voidconversePermutation(byte[] inData) {
byte[] newData =new byte[8];
for(inti =0; i <=63; i++) {
if((inData[bitCP[i] >>>3] & (1<< (7- (bitCP[i] &0x07)))) !=0) {
newData[i >>>3] = (byte) ((newData[i >>>3] | (1<< (7- (i &0x07)))) &0xFF);
}
}
for(inti =0; i <=7; i++) {
inData[i] = newData[i];
}
}
private static voidexpand(byte[] inData,byte[] outData) {
for(inti =0; i <=47; i++) {
if((inData[bitExp[i] >>3] & (1<< (7- (bitExp[i] &0x07)))) !=0) {
outData[i >>3] = (byte) (outData[i >>3] | (1<< (7- (i &0x07))) &0xFF);
}
}
}
private static voidpermutation(byte[] inData) {
byte[] newData =new byte[4];
for(inti =0; i <=31; i++) {
if((inData[bitPm[i] >>3] & (1<< (7- (bitPm[i] &0x07)))) !=0) {
newData[i >>3] = (byte) (newData[i >>3] | (1<< (7- (i &0x07))) &0xFF);
}
}
for(inti =0; i <=3; i++) {
inData[i] = newData[i];
}
}
private static bytesi(bytes,byteinByte) {
bytec = (byte) ((inByte &0x20) | ((inByte &0x1e) >>1) |
((inByte &0x01) <<4) &0xFF);
return(byte) (sBox[s][c] &0x0f&0xFF);
}
private static voidpermutationChoose1(byte[] inData,byte[] outData) {
for(inti =0; i <=55; i++) {
if((inData[bitPMC1[i] >>>3] & (1<< (7- (bitPMC1[i] &0x07)))) !=0) {
outData[i >>>3] = (byte) (outData[i >>>3] | (1<< (7- (i &0x07))) &0xFF);
}
}
}
public static voidpermutationChoose2(byte[] inData,byte[] outData) {
for(inti =0; i <=47; i++) {
if((inData[bitPMC2[i] >>3] & (1<< (7- (bitPMC2[i] &0x07)))) !=0) {
outData[i >>3] = (byte) (outData[i >>3] | (1<< (7- (i &0x07))));
}
}
}
private static byteshr(bytevalue,intbit) {
if(value <0) {
return(byte) ((value &0xFF) >>> bit);//| 0X01
}else{
return(byte) (value >> bit);
}
}
private static voidcycleMove(byte[] inData,bytebitMove) {
for(inti =0; i <= bitMove -1; i++) {
inData[0] = (byte) ((inData[0] <<1) |shr(inData[1],7));
// byte x = (byte) (inData[1] << 1);
// byte y = (byte) ((inData[2] & 0xFF) >>> 7 | 0X01);//(((inData[0] & 0x10) & 0xFF) >>> 4 | 0X01)
inData[1] = (byte) ((inData[1] <<1) |shr(inData[2],7));
inData[2] = (byte) ((inData[2] <<1) |shr(inData[3],7));
inData[3] = (byte) ((inData[3] <<1) |shr((byte) ((inData[0] &0x10)),4));
inData[0] = (byte) ((inData[0] &0x0f));
}
}
//out key size必须等于5
private static voidmakeKey(byte[] inKey,byte[][] outKey) {
// Assert.isTrue(outKey.length == 15, "outKey size != 15");
byte[] bitDisplace = {1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};
byte[] outData56 =new byte[7];
byte[] key28l =new byte[4];
byte[] key28r =new byte[4];
byte[] key56o =new byte[7];
permutationChoose1(inKey, outData56);
key28l[0] =shr(outData56[0],4);
key28l[1] = (byte) ((outData56[0] <<4) |shr(outData56[1],4));
key28l[2] = (byte) ((outData56[1] <<4) |shr(outData56[2],4));
key28l[3] = (byte) ((outData56[2] <<4) |shr(outData56[3],4));
key28r[0] = (byte) (outData56[3] &0x0f&0xFF);
key28r[1] = outData56[4];
key28r[2] = outData56[5];
key28r[3] = outData56[6];
for(inti =0; i <=15; i++) {
cycleMove(key28l, bitDisplace[i]);
cycleMove(key28r, bitDisplace[i]);
key56o[0] = (byte) ((key28l[0] <<4) |shr(key28l[1],4));
key56o[1] = (byte) ((key28l[1] <<4) |shr(key28l[2],4));
key56o[2] = (byte) ((key28l[2] <<4) |shr(key28l[3],4));
key56o[3] = (byte) ((key28l[3] <<4) | (key28r[0]));
key56o[4] = key28r[1];
key56o[5] = key28r[2];
key56o[6] = key28r[3];
permutationChoose2(key56o, outKey[i]);
}
}
private static voidencry(byte[] inData,byte[] subKey,byte[] outData) {
byte[] outBuf =new byte[6];
byte[] buf =new byte[8];
expand(inData, outBuf);
for(inti =0; i <=5; i++) {
outBuf[i] = (byte) ((outBuf[i] &0xFF) ^ (subKey[i] &0xFF));
}
buf[0] = (byte) (shr(outBuf[0],2) &0xFF);//xxxxxx -> 2
buf[1] = (byte) (((outBuf[0] &0x03) <<4) |shr(outBuf[1],4));// 4 <- xx xxxx -> 4
buf[2] = (byte) (((outBuf[1] &0x0f) <<2) |shr(outBuf[2],6));// 2 <- xxxx xx -> 6
buf[3] = (byte) (outBuf[2] &0x3f);// xxxxxx
buf[4] =shr(outBuf[3],2);// xxxxxx
buf[5] = (byte) (((outBuf[3] &0x03) <<4) |shr(outBuf[4],4));// xx xxxx
buf[6] = (byte) (((outBuf[4] &0x0f) <<2) |shr(outBuf[5],6));// xxxx xx
buf[7] = (byte) (outBuf[5] &0x3f);
for(bytei =0; i <=7; i++) {
buf[i] =si(i, buf[i]);
}
for(inti =0; i <=3; i++) {
outBuf[i] = (byte) ((buf[i *2] <<4) | buf[i *2+1]);
}
permutation(outBuf);
for(inti =0; i <=3; i++) {
outData[i] = outBuf[i];
}
}
private static voiddesData(TDesMode desMode,byte[] inData,byte[] outData) {
byte[] buf =new byte[4];
byte[] temp =new byte[4];
for(inti =0; i <=7; i++) {
outData[i] = inData[i];
}
initPermutation(outData);
if(desMode.equals(dmEncry)) {
for(inti =0; i <=15; i++) {
for(intj =0; j <=3; j++) {
temp[j] = outData[j];
}
for(intj =0; j <=3; j++) {
outData[j] = outData[j +4];
}
encry(outData,subKey[i], buf);
for(intj =0; j <=3; j++) {
outData[j +4] = (byte) (temp[j] ^ buf[j] &0xFF);
}
}
for(intj =0; j <=3; j++) {
temp[j] = outData[j +4];
}
for(intj =0; j <=3; j++) {
outData[j +4] = outData[j];
}
for(intj =0; j <=3; j++) {
outData[j] = temp[j];
}
}else if(desMode.equals(dmDecry)) {
for(inti =15; i >=0; i--) {
for(intj =0; j <=3; j++) {
temp[j] = outData[j];
}
for(intj =0; j <=3; j++) {
outData[j] = outData[j +4];
}
encry(outData,subKey[i], buf);
for(intj =0; j <=3; j++) {
outData[j +4] = (byte) (temp[j] ^ buf[j] &0xFF);
}
}
for(intj =0; j <=3; j++) {
temp[j] = outData[j +4];
}
for(intj =0; j <=3; j++) {
outData[j +4] = outData[j];
}
for(intj =0; j <=3; j++) {
outData[j] = temp[j];
}
}
conversePermutation(outData);
}
public staticString encryStr(String str, String key)throwsException {
// gb2312是为什么 兼容delphi ansichar
byte[] bytes = str.getBytes("gb2312");
Assert.isTrue(bytes.length>0,"encry text is empty");
byte[] keys = key.getBytes("gb2312");
//跟足浴系统 统一key长度 最长8位
byte[] keyByte =new byte[8];
for(inti =0; i < keys.length; i++) {
if(i >7) {
break;
}
keyByte[i] = keys[i];
}
//初始化key
makeKey(keyByte,subKey);
//开始加密 文本 每次8个字节
byte[] strByte =new byte[8];
byte[] outByte =new byte[8];
StringBuffer sbu =newStringBuffer();
intj =0;
for(inti =0; i < bytes.length; i++) {
strByte[j] = bytes[i];
j++;
if((i +1) %8==0) {
j =0;
desData(dmEncry, strByte, outByte);
sbu.append(StrUtils.bytesToHexString(outByte).toUpperCase());
}
}
//处理多出部分
if(j >0&& j <8) {
while(j <8) {
strByte[j] =0;
j++;
}
if(j ==8) {
desData(dmEncry, strByte, outByte);
sbu.append(StrUtils.bytesToHexString(outByte).toUpperCase());
}
}
returnsbu.toString();
}
/**
*解密
*
*@paramstr
*@paramkey
*@return
*/
public staticString decryStr(String str, String key)throwsException {
//处理key兼容delphi编码(ansi)
byte[] keys = key.getBytes("gb2312");
//跟足浴系统 统一key长度 最长8位
byte[] keyByte =new byte[8];
for(inti =0; i < keys.length; i++) {
if(i >7) {
break;
}
keyByte[i] = keys[i];
}
//处理 解密串
byte[] dStr = StrUtils.hexString2Bytes(str);
Assert.notNull(dStr,"加密串错误!");
//初始化key
makeKey(keyByte,subKey);
byte[] strByte =new byte[8];
byte[] outByte =new byte[8];
byte[] merger =new byte[0];
intj =0;
for(inti =0; i < dStr.length; i++) {
strByte[j] = dStr[i];
j++;
if((i +1) %8==0) {
j =0;
desData(dmDecry, strByte, outByte);
//兼容delphi的编码gb2312(ansi)
merger =byteMerger(merger,outByte);
}
}
// return sbu.toString().trim();
returnStrUtils.bytes2String(merger,"gb2312").trim();
}
private static byte[] byteMerger(byte[] b1,byte[] b2) {
byte[] bytes =new byte[b1.length+ b2.length];
System.arraycopy(b1,0, bytes,0, b1.length);
System.arraycopy(b2,0, bytes, b1.length, b2.length);
returnbytes;
}
//加密测试
public static voidmain(String[] args)throwsException {
String key ="power";
String enstr =encryStr("11111111111现金", key);
System.out.println(enstr);
System.out.println(decryStr(enstr, key));
}
}
以上两台加密算法完美支持中英文 如需交流 加微信：soefqy
网友评论