到底是不是ECB模式+Pkcs7?

因为需要在别的语言中实现(js前端),需要对接后端的加密方式,这是后端的方法

不懂java,在http://tool.chacuo.net/cryptd...,都加不出相同的结果来

看上去应该是和这篇文章的方法类似,但是具体是什么加密呢?

package com.loty.crypto;

/**

* *********************************************

* DES 算法

* 翻译自C语言版本。

* ***********************************************

*/

public class Des {

private String key = "09876543210987654321098765432109";

public String getKey() {

return key;

}

public void setKey(String key) {

this.key = key;

}

/**

* 加密

*

* @param byteArray

* @return

*/

public byte[] encode(byte[] byteArray) {

int iLen = byteArray.length;

int iByteLen = ((int) Math.floor(iLen / 8) + 1) * 8;

byte[] bEncoded = new byte[iByteLen];

int i = ENCRYPT(key.getBytes(), byteArray, bEncoded, iLen);

byte[] result = new byte[i];

System.arraycopy(bEncoded, 0, result, 0, i);

return result;

}

/**

* 解密

*

* @param byteArray

* @return

*/

public byte[] decode(byte[] byteArray) {

int iLen = byteArray.length;

byte[] bDecoded = new byte[iLen];

int i = DECRYPT(key.getBytes(), bDecoded, byteArray, iLen);

int n = 0;

while (n < i) {

if (bDecoded[n] == 0) break;

n++;

}

byte[] result = new byte[n];

System.arraycopy(bDecoded, 0, result, 0, n);

return result;

}

public String digestHexStr;

//28

static final int pc_1_cp[] = {

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};

//28

static final int pc_1_dp[] = {

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};

//48

static final int pc_2p[] = {

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};

//16

static final int ls_countp[] = {1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1};

//64

static final int iip_tab_p[] = {

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};

//64

static final int _iip_tab_p[] = {

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};

//48

static final int e_r_p[] = {

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

static final int local_PP[] = {

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};

//[8][4][16]

static final int ccom_SSS_p[][][] = {

{{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}}, /* err on */

{{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}, /* err on */

{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}}};

byte[][] C = new byte[17][28];

byte[][] D = new byte[17][28];

byte[][] K = new byte[17][48];

public Des() {

return;

}

/*iu2b把int转换成byte

*/

private static byte iu2b(int input) {

byte output1;

output1 = (byte) (input & 0xff);

return output1;

}

/*

b2iu把byte按照不考虑正负号的原则的"升位"成int程序,

因为java没有unsigned运算

*/

private static int b2iu(byte b) {

return b < 0 ? b & 0x7F + 128 : b;

}

/*byteHEX(),用来把一个byte类型的数转换成十六进制的ASCII表示,

因为java中的byte的toString无法实现这一点,我们又没有C语言中的

sprintf(outbuf,"%02X",ib)

*/

public static String byteHEX(byte ib) {

char[] Digit = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'};

char[] ob = new char[2];

ob[0] = Digit[(ib >>> 4) & 0X0F];

ob[1] = Digit[ib & 0X0F];

String s = new String(ob);

return s;

}

/* desMemcpy是一个内部使用的byte数组的块拷贝函数,

从input的inpos开始把len长度的

字节拷贝到output的outpos位置开始

*/

private void desMemcpy(byte[] output, byte[] input, int outpos, int inpos, int len) {

int i;

for (i = 0; i < len; i++)

output[outpos + i] = input[inpos + i];

}

private void Fexpand0(byte[] in, byte[] out) {

int divide;

int i, j;

byte temp1;

for (i = 0; i < 8; i++) {

divide = 7;

for (j = 0; j < 8; j++) {

temp1 = in[i];

out[8 * i + j] = iu2b((b2iu(temp1) >>> divide) & 1);

divide--;

}

}

}

private void FLS(byte[] bits, byte[] buffer, int count) {

int i, j;

for (i = 0; i < 28; i++) {

buffer[i] = bits[(i + count) % 28];

}

}

private void Fson(byte[] cc, byte[] dd, byte[] kk) {

int i, j;

byte[] buffer = new byte[56];

for (i = 0; i < 28; i++)

buffer[i] = cc[i];

for (i = 28; i < 56; i++)

buffer[i] = dd[i - 28];

for (i = 0; i < 48; i++)

kk[i] = buffer[pc_2p[i] - 1];

}

private void Fsetkeystar(byte[] bits) {

int i, j;

for (i = 0; i < 28; i++)

C[0][i] = bits[pc_1_cp[i] - 1];

for (i = 0; i < 28; i++)

D[0][i] = bits[pc_1_dp[i] - 1];

for (j = 0; j < 16; j++) {

FLS(C[j], C[j + 1], ls_countp[j]);

FLS(D[j], D[j + 1], ls_countp[j]);

Fson(C[j + 1], D[j + 1], K[j + 1]);

}

}

private void Fiip(byte[] text, byte[] ll, byte[] rr) {

int i, j;

byte[] buffer = new byte[64];

byte[] tmp = new byte[64];

Fexpand0(text, buffer);

for (i = 0; i < 32; i++)

ll[i] = buffer[iip_tab_p[i] - 1];

for (i = 0; i < 32; i++)

rr[i] = buffer[iip_tab_p[i + 32] - 1];

}

private void Fs_box(byte[] aa, byte[] bb) {

int i, j, k, m;

int y, z;

byte[] ss = new byte[8];

m = 0;

for (i = 0; i < 8; i++) {

j = 6 * i;

y = b2iu(aa[j]) * 2 + b2iu(aa[j + 5]);

z = b2iu(aa[j + 1]) * 8 + b2iu(aa[j + 2]) * 4 + b2iu(aa[j + 3]) * 2 + b2iu(aa[j + 4]);

ss[i] = iu2b(ccom_SSS_p[i][y][z]);

y = 3;

for (k = 0; k < 4; k++) {

bb[m++] = iu2b((b2iu(ss[i]) >>> y) & 1);

y--;

}

}

}

private void FF(int n, byte[] ll, byte[] rr, byte[] LL, byte[] RR) {

int i, j;

byte[] buffer = new byte[64], tmp = new byte[64];

for (i = 0; i < 48; i++)

buffer[i] = rr[e_r_p[i] - 1];

for (i = 0; i < 48; i++)

buffer[i] = iu2b((b2iu(buffer[i]) + b2iu(K[n][i])) & 1);

Fs_box(buffer, tmp);

for (i = 0; i < 32; i++)

buffer[i] = tmp[local_PP[i] - 1];

for (i = 0; i < 32; i++)

RR[i] = iu2b((b2iu(buffer[i]) + b2iu(ll[i])) & 1);

for (i = 0; i < 32; i++)

LL[i] = rr[i];

}

private void _Fiip(byte[] text, byte[] ll, byte[] rr) {

int i, j;

byte[] tmp = new byte[64];

for (i = 0; i < 32; i++)

tmp[i] = ll[i];

for (i = 32; i < 64; i++)

tmp[i] = rr[i - 32];

for (i = 0; i < 64; i++)

text[i] = tmp[_iip_tab_p[i] - 1];

}

private void Fcompress016(byte[] out, byte[] in) {

int times;

int i, j;

for (i = 0; i < 16; i++) {

times = 3;

in[i] = '0';

for (j = 0; j < 4; j++) {

in[i] = iu2b(b2iu(in[i]) + (b2iu(out[i * 16 + j]) << times));

times--;

}

}

}

void Fcompress0(byte[] out, byte[] in) {

int times;

int i, j;

for (i = 0; i < 8; i++) {

times = 7;

in[i] = 0;

for (j = 0; j < 8; j++) {

in[i] = iu2b(b2iu(in[i]) + (b2iu(out[i * 8 + j]) << times));

times--;

}

}

}

private void Fencrypt0(byte[] text, byte[] mtext) {

byte[] ll = new byte[64], rr = new byte[64], LL = new byte[64], RR = new byte[64];

byte[] tmp = new byte[64];

int i, j;

Fiip(text, ll, rr);

for (i = 1; i < 17; i++) {

FF(i, ll, rr, LL, RR);

for (j = 0; j < 32; j++) {

ll[j] = LL[j];

rr[j] = RR[j];

}

}

_Fiip(tmp, rr, ll);

Fcompress0(tmp, mtext);

}

private void FDES(byte[] key, byte[] text, byte[] mtext) {

byte[] tmp = new byte[64];

Fexpand0(key, tmp);

Fsetkeystar(tmp);

Fencrypt0(text, mtext);

}

/*加密*/

public int ENCRYPT(byte[] key, byte[] s, byte[] d, int len) {

int i, j;

byte[] cData = new byte[8];

byte[] cEncryptData = new byte[8];

for (i = 0; i < len; i += 8) {

if ((i + 8) > len) {

desMemcpy(cData, s, 0, i, len - i);

for (j = len - i; j < 8; j++)

cData[j] = 0;

} else

desMemcpy(cData, s, 0, i, 8);

FDES(key, cData, cEncryptData);

desMemcpy(d, cEncryptData, i, 0, 8);

}

return i;

}

private void Fdiscrypt0(byte[] mtext, byte[] text) {

byte[] ll = new byte[64], rr = new byte[64], LL = new byte[64], RR = new byte[64];

byte[] tmp = new byte[64];

int i, j;

Fiip(mtext, ll, rr);

for (i = 16; i > 0; i--) {

FF(i, ll, rr, LL, RR);

for (j = 0; j < 32; j++) {

ll[j] = LL[j];

rr[j] = RR[j];

}

}

_Fiip(tmp, rr, ll);

Fcompress0(tmp, text);

}

/**

* **************************************************************************

* function: DES

* parameter: u_char * key ; key for encrypt

* u_char * mtext ; encipher data

* u_char * text ; plain data

* return: none

* ***************************************************************************

*/

private void _FDES(byte[] key, byte[] mtext, byte[] text) {

byte[] tmp = new byte[64];

Fexpand0(key, tmp);

Fsetkeystar(tmp);

Fdiscrypt0(mtext, text);

}

/*解密*/

public int DECRYPT(byte[] key, byte[] s, byte[] d, int len) {

int i;

byte[] cData = new byte[8];

byte[] cEncryptData = new byte[8];

for (i = 0; i < len; i += 8) {

desMemcpy(cEncryptData, d, 0, i, 8);

_FDES(key, cEncryptData, cData);

desMemcpy(s, cData, i, 0, 8);

}

return i;

}

public static byte[] hexStr2ByteArr(String strIn) {

byte[] arrB = strIn.getBytes();

int iLen = arrB.length;

//两个字符表示一个字节,所以字节数组长度是字符串长度除以2

byte[] arrOut = new byte[iLen / 2];

for (int i = 0; i < iLen; i = i + 2) {

String strTmp = new String(arrB, i, 2);

arrOut[i / 2] = (byte) Integer.parseInt(strTmp, 16);

}

return arrOut;

}

public String byteArr2HexStr(byte[] arrB, int iLen) throws Exception {

// 每个byte用两个字符才能表示,所以字符串的长度是数组长度的两倍

StringBuffer sb = new StringBuffer(iLen * 2);

for (int i = 0; i < iLen; i++) {

int intTmp = arrB[i];

while (intTmp < 0) {

intTmp = intTmp + 256;

}

if (intTmp < 16) {

sb.append("0");

}

sb.append(Integer.toString(intTmp, 16));

}

String result = sb.toString();

return result;

}

}

des java c_这个des加密,到底是用的哪种类型?相关推荐

  1. Java设计模式分为创建模式, 结构模式, 行为模式 3种类型

    Java设计模式之创建模式包括: Factory,    工厂模式 Singleton,   单例模式 Builder,    建造模式 Prototype,    原型模式 Java设计模式之结构模 ...

  2. Java中Long型数据类型对应MySQL数据库中哪种类型?

    Long型id数据对应MySQL数据库中 bigint 数据类型: System.out.println(1==1L); //tureSystem.out.println(1L); //1System ...

  3. java练习题 有50枚硬币,可能包括4种类型:1元,5角,1角,5分。已知总价值为20元。求各种硬币的数量。

    问题 有50枚硬币,可能包括4种类型:1元,5角,1角,5分.已知总价值为20元.求各种硬币的数量. 解决思路 对付这一类的问题,最简单的方式莫过于暴力穷举,就是用四个循环,一个一个试,结果满足要求输 ...

  4. [转]JAVA与.NET DES加密解密

    [转]原文地址:http://www.cnblogs.com/prince3245/archive/2010/03/23/1692630.html JAVA与.NET DES加密解密 前几天做了个项目 ...

  5. 3、【java数据安全】对称加密的5种(DES/3DES、AES、IDEA、PBE)常见算法的使用示例

    java数据安全 系列文章 1.[java数据安全]数据安全之加密解密(base64.MD.SHA.DES.AES.IDEA.PBE.DH.RSA.EIGamal).数字签名(DSA.ECDSA)和数 ...

  6. Java简单实现DES加密解密算法

    Java简单实现DES加密解密算法 文章目录 Java简单实现DES加密解密算法 DES算法介绍 实现相关java类 代码实现 DES算法介绍 DEC加密算法属于对称加密,即利用指定的密钥,按照密码的 ...

  7. Java代码实现DES算法加密解密功能

    一.概述 DES加密算法是一种对称加密,所谓对称加密就是加密和解密都是用同一把密钥. 二.详细代码 import javax.crypto.BadPaddingException; import ja ...

  8. Java工具类——DES加密和解密工具 I

    可以指定不同的密钥对同一字符串进行不同的加密操作,增强加密性能. package com.app; import java.security.Key; import java.security.Sec ...

  9. java中的DES,AES,BASE64,MD5和Cipher类\MessageDigest类

    Cipher类位于javax.crypto包下,声明为 public class Cipher extends Object 此类为加密和解密提供密码功能.它构成了 Java Cryptographi ...

最新文章

  1. 在C#代码中获取Silverlight的初始化initparams参数
  2. Go报错package github.com/astaxie/beego: exit status 128
  3. MyBatis 缓存详解-cache 缓存
  4. instsrv.exe——来自Windows 2000 Resource Kits的一个小工具
  5. HTML5 API详解(8):worker多线程教你如何避免页面卡死
  6. pythonloop是什么意思_python loop 英文问题
  7. ubuntu下django的项目相关软件安装测试
  8. 不是所有的程序员都来自匿名区!
  9. ISO27001标准的起源和发展
  10. 鲁大师2014绿色版 v3.75.14.1058 免费版
  11. AMOS分析技术:测量模型分析;聊聊验证性因子分析(CFA)与探索性因子分析(EFA)的异同点
  12. 永洪科技怎么样_「永洪科技」北京永洪商智科技有限公司怎么样? - 职友集
  13. 女性内分泌失调要小心
  14. Centos7 ,使用grep,cut 、awk 提取IP地址
  15. 淘宝网店应该怎么样去做好宝贝SEO优化?
  16. (转载)Javanbsp;Collectionamp;nbs…
  17. 详解created和mounted区别与使用场景
  18. Symantec Backup Exec 2010 Agent For Linux安装
  19. php slug,php 中的var
  20. 新世纪福音战士剧场版破

热门文章

  1. 学习Spring Boot:(二十四)多数据源配置与使用
  2. 计算机专业论文docx,计算机系毕业论文范文-20210606000812.docx-原创力文档
  3. 建筑学跨专业计算机考研方向,不适合女生报考的考研专业你知道几个?
  4. MySQL如何创建沙箱,沙箱环境搭建 - osc_y8w65yuq的个人空间 - OSCHINA - 中文开源技术交流社区...
  5. 二年级计算机认识键盘教案,关于《认识键盘》的教学反思
  6. python处理txt文件_python处理txt文件
  7. 计算机知识探索怎么写,计算机基础知识及探索.doc
  8. php文件上传漏洞防御,第十二课 php文件上传漏洞和代码防御
  9. java中unicode显示乱码_Java 已知Java系统编码是GBK,jtextarea从一编码为Unicode的文本中读取数据,出现乱码,怎么正常显示?...
  10. java 对象视图框架_Stripes视图框架Java对象属性验证和prototype.js Ajax的测试