写一个java加密程序

写一个java加密程序,第1张

/

SHA-1加密函数

/

public class SsytemSha1 {

private final int[] abcde = {

0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0

};

// 摘要数据存储数组

private int[] digestInt = new int[5];

// 计算过程中的临时数据存储数组

private int[] tmpData = new int[80];

// 计算sha-1摘要

private int process_input_bytes(byte[] bytedata) {

// 初试化常量

Systemarraycopy(abcde, 0, digestInt, 0, abcdelength);

// 格式化输入字节数组,补10及长度数据

byte[] newbyte = byteArrayFormatData(bytedata);

// 获取数据摘要计算的数据单元个数

int MCount = newbytelength / 64;

// 循环对每个数据单元进行摘要计算

for (int pos = 0; pos < MCount; pos++) {

// 将每个单元的数据转换成16个整型数据,并保存到tmpData的前16个数组元素中

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

tmpData[j] = byteArrayToInt(newbyte, (pos 64) + (j 4));

}

// 摘要计算函数

encrypt();

}

return 20;

}

// 格式化输入字节数组格式

private byte[] byteArrayFormatData(byte[] bytedata) {

// 补0数量

int zeros = 0;

// 补位后总位数

int size = 0;

// 原始数据长度

int n = bytedatalength;

// 模64后的剩余位数

int m = n % 64;

// 计算添加0的个数以及添加10后的总长度

if (m < 56) {

zeros = 55 - m;

size = n - m + 64;

} else if (m == 56) {

zeros = 63;

size = n + 8 + 64;

} else {

zeros = 63 - m + 56;

size = (n + 64) - m + 64;

}

// 补位后生成的新数组内容

byte[] newbyte = new byte[size];

// 复制数组的前面部分

Systemarraycopy(bytedata, 0, newbyte, 0, n);

// 获得数组Append数据元素的位置

int l = n;

// 补1 *** 作

newbyte[l++] = (byte) 0x80;

// 补0 *** 作

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

newbyte[l++] = (byte) 0x00;

}

// 计算数据长度,补数据长度位共8字节,长整型

long N = (long) n 8;

byte h8 = (byte) (N & 0xFF);

byte h7 = (byte) ((N >> 8) & 0xFF);

byte h6 = (byte) ((N >> 16) & 0xFF);

byte h5 = (byte) ((N >> 24) & 0xFF);

byte h4 = (byte) ((N >> 32) & 0xFF);

byte h3 = (byte) ((N >> 40) & 0xFF);

byte h2 = (byte) ((N >> 48) & 0xFF);

byte h1 = (byte) (N >> 56);

newbyte[l++] = h1;

newbyte[l++] = h2;

newbyte[l++] = h3;

newbyte[l++] = h4;

newbyte[l++] = h5;

newbyte[l++] = h6;

newbyte[l++] = h7;

newbyte[l++] = h8;

return newbyte;

}

private int f1(int x, int y, int z) {

return (x & y) | (~x & z);

}

private int f2(int x, int y, int z) {

return x ^ y ^ z;

}

private int f3(int x, int y, int z) {

return (x & y) | (x & z) | (y & z);

}

private int f4(int x, int y) {

return (x << y) | x >>> (32 - y);

}

// 单元摘要计算函数

private void encrypt() {

for (int i = 16; i <= 79; i++) {

tmpData[i] = f4(tmpData[i - 3] ^ tmpData[i - 8] ^ tmpData[i - 14] ^

tmpData[i - 16], 1);

}

int[] tmpabcde = new int[5];

for (int i1 = 0; i1 < tmpabcdelength; i1++) {

tmpabcde[i1] = digestInt[i1];

}

for (int j = 0; j <= 19; j++) {

int tmp = f4(tmpabcde[0], 5) +

f1(tmpabcde[1], tmpabcde[2], tmpabcde[3]) + tmpabcde[4] +

tmpData[j] + 0x5a827999;

tmpabcde[4] = tmpabcde[3];

tmpabcde[3] = tmpabcde[2];

tmpabcde[2] = f4(tmpabcde[1], 30);

tmpabcde[1] = tmpabcde[0];

tmpabcde[0] = tmp;

}

for (int k = 20; k <= 39; k++) {

int tmp = f4(tmpabcde[0], 5) +

f2(tmpabcde[1], tmpabcde[2], tmpabcde[3]) + tmpabcde[4] +

tmpData[k] + 0x6ed9eba1;

tmpabcde[4] = tmpabcde[3];

tmpabcde[3] = tmpabcde[2];

tmpabcde[2] = f4(tmpabcde[1], 30);

tmpabcde[1] = tmpabcde[0];

tmpabcde[0] = tmp;

}

for (int l = 40; l <= 59; l++) {

int tmp = f4(tmpabcde[0], 5) +

f3(tmpabcde[1], tmpabcde[2], tmpabcde[3]) + tmpabcde[4] +

tmpData[l] + 0x8f1bbcdc;

tmpabcde[4] = tmpabcde[3];

tmpabcde[3] = tmpabcde[2];

tmpabcde[2] = f4(tmpabcde[1], 30);

tmpabcde[1] = tmpabcde[0];

tmpabcde[0] = tmp;

}

for (int m = 60; m <= 79; m++) {

int tmp = f4(tmpabcde[0], 5) +

f2(tmpabcde[1], tmpabcde[2], tmpabcde[3]) + tmpabcde[4] +

tmpData[m] + 0xca62c1d6;

tmpabcde[4] = tmpabcde[3];

tmpabcde[3] = tmpabcde[2];

tmpabcde[2] = f4(tmpabcde[1], 30);

tmpabcde[1] = tmpabcde[0];

tmpabcde[0] = tmp;

}

for (int i2 = 0; i2 < tmpabcdelength; i2++) {

digestInt[i2] = digestInt[i2] + tmpabcde[i2];

}

for (int n = 0; n < tmpDatalength; n++) {

tmpData[n] = 0;

}

}

// 4字节数组转换为整数

private int byteArrayToInt(byte[] bytedata, int i) {

return ((bytedata[i] & 0xff) << 24) | ((bytedata[i + 1] & 0xff) << 16) |

((bytedata[i + 2] & 0xff) << 8) | (bytedata[i + 3] & 0xff);

}

// 整数转换为4字节数组

private void intToByteArray(int intValue, byte[] byteData, int i) {

byteData[i] = (byte) (intValue >>> 24);

byteData[i + 1] = (byte) (intValue >>> 16);

byteData[i + 2] = (byte) (intValue >>> 8);

byteData[i + 3] = (byte) intValue;

}

// 将字节转换为十六进制字符串

private static String byteToHexString(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;

}

// 将字节数组转换为十六进制字符串

private static String byteArrayToHexString(byte[] bytearray) {

String strDigest = "";

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

strDigest += byteToHexString(bytearray[i]);

}

return strDigest;

}

// 计算sha-1摘要,返回相应的字节数组

public byte[] getDigestOfBytes(byte[] byteData) {

process_input_bytes(byteData);

byte[] digest = new byte[20];

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

intToByteArray(digestInt[i], digest, i 4);

}

return digest;

}

// 计算sha-1摘要,返回相应的十六进制字符串

public String getDigestOfString(byte[] byteData) {

return byteArrayToHexString(getDigestOfBytes(byteData));

}

public static void main(String[] args) { //测试通过

String data = "123";

String digest = new SsytemSha1()getDigestOfString(datagetBytes());

}

}

import javautilHashMap;

import javautilMap;

public class NewJFrame extends javaxswingJFrame {

public static Map<Character,Integer> charmap = new HashMap<Character,Integer>();

public static char stringmap[] = new char[]{'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o',

'p','q' ,'r','s','t','u','v','w','x','y','z'

};

static{

charmapput('a', 1);

charmapput('b', 2);

charmapput('c', 3);

charmapput('d', 4);

charmapput('e', 5);

charmapput('f', 6);

charmapput('g', 7);

charmapput('h', 8);

charmapput('i', 9);

charmapput('j', 10);

charmapput('k', 11);

charmapput('l', 12);

charmapput('m', 13);

charmapput('n', 14);

charmapput('o', 15);

charmapput('p', 16);

charmapput('q', 17);

charmapput('r', 18);

charmapput('s', 19);

charmapput('t', 20);

charmapput('u', 21);

charmapput('v', 22);

charmapput('w', 23);

charmapput('x', 24);

charmapput('y', 25);

charmapput('z', 26);

charmapput('A', 1);

charmapput('B', 2);

charmapput('C', 3);

charmapput('D', 4);

charmapput('E', 5);

charmapput('F', 6);

charmapput('G', 7);

charmapput('H', 8);

charmapput('I', 9);

charmapput('J', 10);

charmapput('K', 11);

charmapput('L', 12);

charmapput('M', 13);

charmapput('N', 14);

charmapput('O', 15);

charmapput('P', 16);

charmapput('Q', 17);

charmapput('R', 18);

charmapput('S', 19);

charmapput('T', 20);

charmapput('U', 21);

charmapput('V', 22);

charmapput('W', 23);

charmapput('X', 24);

charmapput('Y', 25);

charmapput('Z', 26);

}

public NewJFrame() {

initComponents();

}

private char change(char c) {

int i = charmapget(c);

int k = 2;

int j;

j=(i+k) % 26 ;

return stringmap[--j];

}

// <editor-fold defaultstate="collapsed" desc="Generated Code">

private void initComponents() {

jPanel1 = new javaxswingJPanel();

ba = new javaxswingJButton();

ta = new javaxswingJTextField();

tb = new javaxswingJTextField();

setDefaultCloseOperation(javaxswingWindowConstantsEXIT_ON_CLOSE);

basetText("转换");

baaddActionListener(new javaawteventActionListener() {

public void actionPerformed(javaawteventActionEvent evt) {

baActionPerformed(evt);

}

});

tbsetEnabled(false);

javaxswingGroupLayout jPanel1Layout = new javaxswingGroupLayout(jPanel1);

jPanel1setLayout(jPanel1Layout);

jPanel1LayoutsetHorizontalGroup(

jPanel1LayoutcreateParallelGroup(javaxswingGroupLayoutAlignmentLEADING)

addGroup(jPanel1LayoutcreateSequentialGroup()

addGroup(jPanel1LayoutcreateParallelGroup(javaxswingGroupLayoutAlignmentLEADING)

addGroup(jPanel1LayoutcreateSequentialGroup()

addGap(66, 66, 66)

addGroup(jPanel1LayoutcreateParallelGroup(javaxswingGroupLayoutAlignmentLEADING, false)

addComponent(tb)

addComponent(ta, javaxswingGroupLayoutDEFAULT_SIZE, 316, ShortMAX_VALUE)))

addGroup(jPanel1LayoutcreateSequentialGroup()

addGap(147, 147, 147)

addComponent(ba, javaxswingGroupLayoutPREFERRED_SIZE, 79, javaxswingGroupLayoutPREFERRED_SIZE)))

addContainerGap(59, ShortMAX_VALUE))

);

jPanel1LayoutsetVerticalGroup(

jPanel1LayoutcreateParallelGroup(javaxswingGroupLayoutAlignmentLEADING)

addGroup(javaxswingGroupLayoutAlignmentTRAILING, jPanel1LayoutcreateSequentialGroup()

addContainerGap()

addComponent(ta, javaxswingGroupLayoutPREFERRED_SIZE, 38, javaxswingGroupLayoutPREFERRED_SIZE)

addPreferredGap(javaxswingLayoutStyleComponentPlacementUNRELATED)

addComponent(tb, javaxswingGroupLayoutDEFAULT_SIZE, 38, ShortMAX_VALUE)

addGap(18, 18, 18)

addComponent(ba)

addContainerGap())

);

javaxswingGroupLayout layout = new javaxswingGroupLayout(getContentPane());

getContentPane()setLayout(layout);

layoutsetHorizontalGroup(

layoutcreateParallelGroup(javaxswingGroupLayoutAlignmentLEADING)

addComponent(jPanel1, javaxswingGroupLayoutDEFAULT_SIZE, javaxswingGroupLayoutDEFAULT_SIZE, ShortMAX_VALUE)

);

layoutsetVerticalGroup(

layoutcreateParallelGroup(javaxswingGroupLayoutAlignmentLEADING)

addComponent(jPanel1, javaxswingGroupLayoutDEFAULT_SIZE, javaxswingGroupLayoutDEFAULT_SIZE, ShortMAX_VALUE)

);

pack();

}// </editor-fold>

private void baActionPerformed(javaawteventActionEvent evt) {

String aa = tagetText();

char bb[] = aatoCharArray();

char cc[] = new char[bblength];

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

cc[i] = change(bb[i]);

}

tbsetText(StringvalueOf(cc));

}

public static void main(String args[]) {

javaawtEventQueueinvokeLater(new Runnable() {

public void run() {

new NewJFrame()setVisible(true);

}

});

}

// Variables declaration - do not modify

private javaxswingJButton ba;

private javaxswingJPanel jPanel1;

private javaxswingJTextField ta;

private javaxswingJTextField tb;

// End of variables declaration

}

private void initComponents() 这个方法不用太在意,只是个生成界面的方法而已

看不懂这个方法也没关系

一般只有加密码过程,没有解密。

用户登陆时,把他输入的密码经过加密

再拿去与数据库里面的密码比较就可以了。

修改密码也是一样的原理,输入的原密码加密后与数据库密码比较,符合的话再将新密码加密后存入数据库覆盖原密码

现在流行的MD5加密算法 网上有很多JAVA的MD5算法

以上就是关于写一个java加密程序全部的内容,包括:写一个java加密程序、用java编写一个数据加密的程序、java语言实现密码加密等相关内容解答,如果想了解更多相关内容,可以关注我们,你们的支持是我们更新的动力!

欢迎分享,转载请注明来源:内存溢出

原文地址:https://54852.com/zz/10100732.html

(0)
打赏 微信扫一扫微信扫一扫 支付宝扫一扫支付宝扫一扫
上一篇 2023-05-05
下一篇2023-05-05

发表评论

登录后才能评论

评论列表(0条)

    保存