java实现数据AES加密

1.AES加密

AES是美国国家标准技术研究所NIST旨在取代DES的21世纪的加密标准。 AES是基于数据块的加密方式，也就是说，每次处理的数据是一块（16字节），当数据不是16字节的倍数时填充，这就是所谓的分组密码（区别于基于比特位的流密码），16字节是分组长度。AES共有ECB、CBC等多种模式。

DES是16轮Feistel型迭代密码。分组长度64bit，用56bit密钥加密64bit长度。
AES的分组长度是128bit，三种可选密钥长度128bit，192bit和256bit，轮数分别为10、12和14。
ECB（ElectronicCodebook，电子密码本）：优点：简单、可并行计算、误差不传递。缺点：不能隐藏明文模式（比如图像加密轮廓仍在）、主动攻击（改明文，后续内容不影响，只要误差不传递该缺点就存在）
CBC（Cipher Block Chaining，密码分组链接）：优点：不容易主动攻击（误差传递）、适合长报文，是SSL、IPSec标准。缺点：无法并行、误差传递。用途：长报文传输，SSL和IPSec
CFB（CipherFeedback，密码反馈）：优点：不容易主动攻击（误差传递），分组转变为流模式，可加密小于分组数据。缺点：无法并行、误差传递。
OFB（OutputFeedback，输出反馈）：优点：分组转为流模式、可加密小于分组数据。缺点：主动攻击（改明文，后续内容不影响，只要误差不传递该缺点就存在）。用途：通信信道质量不高时使用，比如卫星通信。

2.下面开始上代码

1.这里是核心代码

package cn.crypto.ase;
import cn.crypto.util.Base64Ext;
import cn.crypto.util.Decode;
import cn.crypto.util.Opslab;
import javax.crypto.*;
import javax.crypto.spec.SecretKeySpec;
import java.io.IOException;
import java.io.UnsupportedEncodingException;
import java.security.InvalidKeyException;
import java.security.NoSuchAlgorithmException;
import java.security.SecureRandom;
/*** @author zpq* @Title: ASEUtil* @ProjectName common-crypto* @Description: ASE加密* @date 2020/11/1814:53*/
public class ASEUtil {/** 加密*   1.构造密钥生成器*  2.根据ecnodeRules规则初始化密钥生成器*  3.产生密钥*     4.创建和初始化密码器*    5.内容加密*     6.返回字符串*/public static String AESEncode(String encodeRules, String content) {try {// 1.构造密钥生成器，指定为AES算法,不区分大小写KeyGenerator keygen = KeyGenerator.getInstance("AES");// 2.根据ecnodeRules规则初始化密钥生成器// 生成一个128位的随机源,根据传入的字节数组SecureRandom random = SecureRandom.getInstance("SHA1PRNG");random.setSeed(encodeRules.getBytes());keygen.init(128, random);// 3.产生原始对称密钥SecretKey original_key = keygen.generateKey();// 4.获得原始对称密钥的字节数组byte[] raw = original_key.getEncoded();// 5.根据字节数组生成AES密钥SecretKey key = new SecretKeySpec(raw, "AES");// 6.根据指定算法AES自成密码器Cipher cipher = Cipher.getInstance("AES");// 7.初始化密码器，第一个参数为加密(Encrypt_mode)或者解密解密(Decrypt_mode)操作，第二个参数为使用的KEYcipher.init(Cipher.ENCRYPT_MODE, key);// 8.获取加密内容的字节数组(这里要设置为utf-8)不然内容中如果有中文和英文混合中文就会解密为乱码byte[] byte_encode = content.getBytes(Opslab.UTF_8);// 9.根据密码器的初始化方式--加密：将数据加密byte[] byte_AES = cipher.doFinal(byte_encode);// 10.将加密后的数据转换为字符串// 这里用Base64Encoder中会找不到包// 解决办法：// 在项目的Build path中先移除JRE System Library，再添加库JRE System// Library，重新编译后就一切正常了。//11.将字符串返回return new String(Base64Ext.encode(byte_AES, Base64Ext.NO_WRAP));} catch (NoSuchAlgorithmException e) {e.printStackTrace();} catch (NoSuchPaddingException e) {e.printStackTrace();} catch (InvalidKeyException e) {e.printStackTrace();} catch (IllegalBlockSizeException e) {e.printStackTrace();} catch (BadPaddingException e) {e.printStackTrace();} catch (UnsupportedEncodingException e) {e.printStackTrace();}// 如果有错就返加nulllreturn null;}/** 解密 解密过程：*   1.同加密1-4步*  2.将加密后的字符串反纺成byte[]数组*  3.将加密内容解密*/public static String AESDncode(final String encodeRules, String content) {try {// 1.构造密钥生成器，指定为AES算法,不区分大小写KeyGenerator keygen = KeyGenerator.getInstance("AES");// 2.根据ecnodeRules规则初始化密钥生成器// 生成一个128位的随机源,根据传入的字节数组SecureRandom random = SecureRandom.getInstance("SHA1PRNG");random.setSeed(encodeRules.getBytes());keygen.init(128, random);// 3.产生原始对称密钥SecretKey original_key = keygen.generateKey();// 4.获得原始对称密钥的字节数组byte[] raw = original_key.getEncoded();// 5.根据字节数组生成AES密钥SecretKey key = new SecretKeySpec(raw, "AES");// 6.根据指定算法AES自成密码器Cipher cipher = Cipher.getInstance("AES");// 7.初始化密码器，第一个参数为加密(Encrypt_mode)或者解密(Decrypt_mode)操作，第二个参数为使用的KEYcipher.init(Cipher.DECRYPT_MODE, key);// 8.将加密并编码后的内容解码成字节数组byte[] byte_content = Base64Ext.decode(content.getBytes(), Base64Ext.NO_WRAP);/** 解密*/byte[] byte_decode = cipher.doFinal(byte_content);return new String(byte_decode, Opslab.UTF_8);} catch (NoSuchAlgorithmException e) {e.printStackTrace();} catch (NoSuchPaddingException e) {e.printStackTrace();} catch (InvalidKeyException e) {e.printStackTrace();} catch (IOException e) {e.printStackTrace();} catch (IllegalBlockSizeException e) {e.printStackTrace();} catch (BadPaddingException e) {e.printStackTrace();}// 如果有错就返加nulllreturn null;}/*** 加密字符串** @param secretKey* @param Str* @return*/public static String encrypt(String secretKey, String Str) {return Decode.str2HexStr(AESEncode(secretKey, Str));}/*** 解密字符串** @param secretKey* @param str* @return*/public static String decode(String secretKey, String str) {return AESDncode(secretKey, Decode.hexStr2Str(str));}
}

2.下面是封装的一些工具类

2.1工具类 Base64Ext

 ** Unless required by applicable law or agreed to in writing, software* distributed under the License is distributed on an "AS IS" BASIS,* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.* See the License for the specific language governing permissions and* limitations under the License.*/import java.io.UnsupportedEncodingException;/*** #nodoc- Utilities for encoding and decoding the Base64 representation of* binary data.  See RFCs <a* href="http://www.ietf.org/rfc/rfc2045.txt">2045</a> and <a* href="http://www.ietf.org/rfc/rfc3548.txt">3548</a>.*/
public class Base64Ext {/*** Default values for encoder/decoder flags.*/public static final int DEFAULT = 0;/*** Encoder flag bit to omit the padding '=' characters at the end* of the output (if any).*/public static final int NO_PADDING = 1;/*** Encoder flag bit to omit all line terminators (i.e., the output* will be on one long line).*/public static final int NO_WRAP = 2;/*** Encoder flag bit to indicate lines should be terminated with a* CRLF pair instead of just an LF.  Has no effect if {@code* NO_WRAP} is specified as well.*/public static final int CRLF = 4;/*** Encoder/decoder flag bit to indicate using the "URL and* filename safe" variant of Base64 (see RFC 3548 section 4) where* {@code -} and {@code _} are used in place of {@code +} and* {@code /}.*/public static final int URL_SAFE = 8;/*** Flag to pass to  to indicate that it* should not close the output stream it is wrapping when it* itself is closed.*/public static final int NO_CLOSE = 16;//  --------------------------------------------------------//  shared code//  --------------------------------------------------------/* package */ static abstract class Coder {public byte[] output;public int op;/*** Encode/decode another block of input data.  this.output is* provided by the caller, and must be big enough to hold all* the coded data.  On exit, this.opwill be set to the length* of the coded data.** @param finish true if this is the final call to process for*               this object.  Will finalize the coder state and*               include any final bytes in the output.* @return true if the input so far is good; false if some* error has been detected in the input stream..*/public abstract boolean process(byte[] input, int offset, int len, boolean finish);/*** @return the maximum number of bytes a call to process()* could produce for the given number of input bytes.  This may* be an overestimate.*/public abstract int maxOutputSize(int len);}//  --------------------------------------------------------//  decoding//  --------------------------------------------------------/*** Decode the Base64-encoded data in input and return the data in* a new byte array.* <p>* <p>The padding '=' characters at the end are considered optional, but* if any are present, there must be the correct number of them.** @param str   the input String to decode, which is converted to*              bytes using the default charset* @param flags controls certain features of the decoded output.*              Pass {@code DEFAULT} to decode standard Base64.* @throws IllegalArgumentException if the input contains*                                  incorrect padding*/public static byte[] decode(String str, int flags) {return decode(str.getBytes(), flags);}/*** Decode the Base64-encoded data in input and return the data in* a new byte array.* <p>* <p>The padding '=' characters at the end are considered optional, but* if any are present, there must be the correct number of them.** @param input the input array to decode* @param flags controls certain features of the decoded output.*              Pass {@code DEFAULT} to decode standard Base64.* @throws IllegalArgumentException if the input contains*                                  incorrect padding*/public static byte[] decode(byte[] input, int flags) {return decode(input, 0, input.length, flags);}/*** Decode the Base64-encoded data in input and return the data in* a new byte array.* <p>* <p>The padding '=' characters at the end are considered optional, but* if any are present, there must be the correct number of them.** @param input  the data to decode* @param offset the position within the input array at which to start* @param len    the number of bytes of input to decode* @param flags  controls certain features of the decoded output.*               Pass {@code DEFAULT} to decode standard Base64.* @throws IllegalArgumentException if the input contains*                                  incorrect padding*/public static byte[] decode(byte[] input, int offset, int len, int flags) {// Allocate space for the most data the input could represent.// (It could contain less if it contains whitespace, etc.)Decoder decoder = new Decoder(flags, new byte[len * 3 / 4]);if (!decoder.process(input, offset, len, true)) {throw new IllegalArgumentException("bad base-64");}// Maybe we got lucky and allocated exactly enough output space.if (decoder.op == decoder.output.length) {return decoder.output;}// Need to shorten the array, so allocate a new one of the// right size and copy.byte[] temp = new byte[decoder.op];System.arraycopy(decoder.output, 0, temp, 0, decoder.op);return temp;}/* package */ static class Decoder extends Coder {/*** Lookup table for turning bytes into their position in the* Base64 alphabet.*/private static final int DECODE[] = {-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63,52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -2, -1, -1,-1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,-1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,};/*** Decode lookup table for the "web safe" variant (RFC 3548* sec. 4) where - and _ replace + and /.*/private static final int DECODE_WEBSAFE[] = {-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1,52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -2, -1, -1,-1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, 63,-1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,};/*** Non-data values in the DECODE arrays.*/private static final int SKIP = -1;private static final int EQUALS = -2;/*** States 0-3 are reading through the next input tuple.* State 4 is having read one '=' and expecting exactly* one more.* State 5 is expecting no more data or padding characters* in the input.* State 6 is the error state; an error has been detected* in the input and no future input can "fix" it.*/private int state;   // state number (0 to 6)private int value;final private int[] alphabet;public Decoder(int flags, byte[] output) {this.output = output;alphabet = ((flags & URL_SAFE) == 0) ? DECODE : DECODE_WEBSAFE;state = 0;value = 0;}/*** @return an overestimate for the number of bytes {@code* len} bytes could decode to.*/public int maxOutputSize(int len) {return len * 3 / 4 + 10;}/*** Decode another block of input data.** @return true if the state machine is still healthy.  false if* bad base-64 data has been detected in the input stream.*/public boolean process(byte[] input, int offset, int len, boolean finish) {if (this.state == 6) return false;int p = offset;len += offset;// Using local variables makes the decoder about 12%// faster than if we manipulate the member variables in// the loop.  (Even alphabet makes a measurable// difference, which is somewhat surprising to me since// the member variable is final.)int state = this.state;int value = this.value;int op = 0;final byte[] output = this.output;final int[] alphabet = this.alphabet;while (p < len) {// Try the fast path:  we're starting a new tuple and the// next four bytes of the input stream are all data// bytes.  This corresponds to going through states// 0-1-2-3-0.  We expect to use this method for most of// the data.//// If any of the next four bytes of input are non-data// (whitespace, etc.), value will end up negative.  (All// the non-data values in decode are small negative// numbers, so shifting any of them up and or'ing them// together will result in a value with its top bit set.)//// You can remove this whole block and the output should// be the same, just slower.if (state == 0) {while (p + 4 <= len &&(value = ((alphabet[input[p] & 0xff] << 18) |(alphabet[input[p + 1] & 0xff] << 12) |(alphabet[input[p + 2] & 0xff] << 6) |(alphabet[input[p + 3] & 0xff]))) >= 0) {output[op + 2] = (byte) value;output[op + 1] = (byte) (value >> 8);output[op] = (byte) (value >> 16);op += 3;p += 4;}if (p >= len) break;}// The fast path isn't available -- either we've read a// partial tuple, or the next four input bytes aren't all// data, or whatever.  Fall back to the slower state// machine implementation.int d = alphabet[input[p++] & 0xff];switch (state) {case 0:if (d >= 0) {value = d;++state;} else if (d != SKIP) {this.state = 6;return false;}break;case 1:if (d >= 0) {value = (value << 6) | d;++state;} else if (d != SKIP) {this.state = 6;return false;}break;case 2:if (d >= 0) {value = (value << 6) | d;++state;} else if (d == EQUALS) {// Emit the last (partial) output tuple;// expect exactly one more padding character.output[op++] = (byte) (value >> 4);state = 4;} else if (d != SKIP) {this.state = 6;return false;}break;case 3:if (d >= 0) {// Emit the output triple and return to state 0.value = (value << 6) | d;output[op + 2] = (byte) value;output[op + 1] = (byte) (value >> 8);output[op] = (byte) (value >> 16);op += 3;state = 0;} else if (d == EQUALS) {// Emit the last (partial) output tuple;// expect no further data or padding characters.output[op + 1] = (byte) (value >> 2);output[op] = (byte) (value >> 10);op += 2;state = 5;} else if (d != SKIP) {this.state = 6;return false;}break;case 4:if (d == EQUALS) {++state;} else if (d != SKIP) {this.state = 6;return false;}break;case 5:if (d != SKIP) {this.state = 6;return false;}break;}}if (!finish) {// We're out of input, but a future call could provide// more.this.state = state;this.value = value;this.op = op;return true;}// Done reading input.  Now figure out where we are left in// the state machine and finish up.switch (state) {case 0:// Output length is a multiple of three.  Fine.break;case 1:// Read one extra input byte, which isn't enough to// make another output byte.  Illegal.this.state = 6;return false;case 2:// Read two extra input bytes, enough to emit 1 more// output byte.  Fine.output[op++] = (byte) (value >> 4);break;case 3:// Read three extra input bytes, enough to emit 2 more// output bytes.  Fine.output[op++] = (byte) (value >> 10);output[op++] = (byte) (value >> 2);break;case 4:// Read one padding '=' when we expected 2.  Illegal.this.state = 6;return false;case 5:// Read all the padding '='s we expected and no more.// Fine.break;}this.state = state;this.op = op;return true;}}//  --------------------------------------------------------//  encoding//  --------------------------------------------------------/*** Base64-encode the given data and return a newly allocated* String with the result.** @param input the data to encode* @param flags controls certain features of the encoded output.*              Passing {@code DEFAULT} results in output that*              adheres to RFC 2045.*/public static String encodeToString(byte[] input, int flags) {try {return new String(encode(input, flags), "US-ASCII");} catch (UnsupportedEncodingException e) {// US-ASCII is guaranteed to be available.throw new AssertionError(e);}}/*** Base64-encode the given data and return a newly allocated* String with the result.** @param input  the data to encode* @param offset the position within the input array at which to*               start* @param len    the number of bytes of input to encode* @param flags  controls certain features of the encoded output.*               Passing {@code DEFAULT} results in output that*               adheres to RFC 2045.*/public static String encodeToString(byte[] input, int offset, int len, int flags) {try {return new String(encode(input, offset, len, flags), "US-ASCII");} catch (UnsupportedEncodingException e) {// US-ASCII is guaranteed to be available.throw new AssertionError(e);}}/*** Base64-encode the given data and return a newly allocated* byte[] with the result.** @param input the data to encode* @param flags controls certain features of the encoded output.*              Passing {@code DEFAULT} results in output that*              adheres to RFC 2045.*/public static byte[] encode(byte[] input, int flags) {return encode(input, 0, input.length, flags);}/*** Base64-encode the given data and return a newly allocated* byte[] with the result.** @param input  the data to encode* @param offset the position within the input array at which to*               start* @param len    the number of bytes of input to encode* @param flags  controls certain features of the encoded output.*               Passing {@code DEFAULT} results in output that*               adheres to RFC 2045.*/public static byte[] encode(byte[] input, int offset, int len, int flags) {Encoder encoder = new Encoder(flags, null);// Compute the exact length of the array we will produce.int output_len = len / 3 * 4;// Account for the tail of the data and the padding bytes, if any.if (encoder.do_padding) {if (len % 3 > 0) {output_len += 4;}} else {switch (len % 3) {case 0:break;case 1:output_len += 2;break;case 2:output_len += 3;break;}}// Account for the newlines, if any.if (encoder.do_newline && len > 0) {output_len += (((len - 1) / (3 * Encoder.LINE_GROUPS)) + 1) *(encoder.do_cr ? 2 : 1);}encoder.output = new byte[output_len];encoder.process(input, offset, len, true);assert encoder.op == output_len;return encoder.output;}/* package */ static class Encoder extends Coder {/*** Emit a new line every this many output tuples.  Corresponds to* a 76-character line length (the maximum allowable according to* <a href="http://www.ietf.org/rfc/rfc2045.txt">RFC 2045</a>).*/public static final int LINE_GROUPS = 19;/*** Lookup table for turning Base64 alphabet positions (6 bits)* into output bytes.*/private static final byte ENCODE[] = {'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', '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', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '+', '/',};/*** Lookup table for turning Base64 alphabet positions (6 bits)* into output bytes.*/private static final byte ENCODE_WEBSAFE[] = {'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', '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', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-', '_',};final private byte[] tail;/* package */ int tailLen;private int count;final public boolean do_padding;final public boolean do_newline;final public boolean do_cr;final private byte[] alphabet;public Encoder(int flags, byte[] output) {this.output = output;do_padding = (flags & NO_PADDING) == 0;do_newline = (flags & NO_WRAP) == 0;do_cr = (flags & CRLF) != 0;alphabet = ((flags & URL_SAFE) == 0) ? ENCODE : ENCODE_WEBSAFE;tail = new byte[2];tailLen = 0;count = do_newline ? LINE_GROUPS : -1;}/*** @return an overestimate for the number of bytes {@code* len} bytes could encode to.*/public int maxOutputSize(int len) {return len * 8 / 5 + 10;}public boolean process(byte[] input, int offset, int len, boolean finish) {// Using local variables makes the encoder about 9% faster.final byte[] alphabet = this.alphabet;final byte[] output = this.output;int op = 0;int count = this.count;int p = offset;len += offset;int v = -1;// First we need to concatenate the tail of the previous call// with any input bytes available now and see if we can empty// the tail.switch (tailLen) {case 0:// There was no tail.break;case 1:if (p + 2 <= len) {// A 1-byte tail with at least 2 bytes of// input available now.v = ((tail[0] & 0xff) << 16) |((input[p++] & 0xff) << 8) |(input[p++] & 0xff);tailLen = 0;};break;case 2:if (p + 1 <= len) {// A 2-byte tail with at least 1 byte of input.v = ((tail[0] & 0xff) << 16) |((tail[1] & 0xff) << 8) |(input[p++] & 0xff);tailLen = 0;}break;}if (v != -1) {output[op++] = alphabet[(v >> 18) & 0x3f];output[op++] = alphabet[(v >> 12) & 0x3f];output[op++] = alphabet[(v >> 6) & 0x3f];output[op++] = alphabet[v & 0x3f];if (--count == 0) {if (do_cr) output[op++] = '\r';output[op++] = '\n';count = LINE_GROUPS;}}// At this point either there is no tail, or there are fewer// than 3 bytes of input available.// The main loop, turning 3 input bytes into 4 output bytes on// each iteration.while (p + 3 <= len) {v = ((input[p] & 0xff) << 16) |((input[p + 1] & 0xff) << 8) |(input[p + 2] & 0xff);output[op] = alphabet[(v >> 18) & 0x3f];output[op + 1] = alphabet[(v >> 12) & 0x3f];output[op + 2] = alphabet[(v >> 6) & 0x3f];output[op + 3] = alphabet[v & 0x3f];p += 3;op += 4;if (--count == 0) {if (do_cr) output[op++] = '\r';output[op++] = '\n';count = LINE_GROUPS;}}if (finish) {// Finish up the tail of the input.  Note that we need to// consume any bytes in tail before any bytes// remaining in input; there should be at most two bytes// total.if (p - tailLen == len - 1) {int t = 0;v = ((tailLen > 0 ? tail[t++] : input[p++]) & 0xff) << 4;tailLen -= t;output[op++] = alphabet[(v >> 6) & 0x3f];output[op++] = alphabet[v & 0x3f];if (do_padding) {output[op++] = '=';output[op++] = '=';}if (do_newline) {if (do_cr) output[op++] = '\r';output[op++] = '\n';}} else if (p - tailLen == len - 2) {int t = 0;v = (((tailLen > 1 ? tail[t++] : input[p++]) & 0xff) << 10) |(((tailLen > 0 ? tail[t++] : input[p++]) & 0xff) << 2);tailLen -= t;output[op++] = alphabet[(v >> 12) & 0x3f];output[op++] = alphabet[(v >> 6) & 0x3f];output[op++] = alphabet[v & 0x3f];if (do_padding) {output[op++] = '=';}if (do_newline) {if (do_cr) output[op++] = '\r';output[op++] = '\n';}} else if (do_newline && op > 0 && count != LINE_GROUPS) {if (do_cr) output[op++] = '\r';output[op++] = '\n';}assert tailLen == 0;assert p == len;} else {// Save the leftovers in tail to be consumed on the next// call to encodeInternal.if (p == len - 1) {tail[tailLen++] = input[p];} else if (p == len - 2) {tail[tailLen++] = input[p];tail[tailLen++] = input[p + 1];}}this.op = op;this.count = count;return true;}}private Base64Ext() {}   // don't instantiate
}

2.2些工具类 Decode

package cn.crypto.util;/*** @author zpq* @Title: Decode* @ProjectName common-crypto* @Description: Blowfish加密算法Java实现* @date 2020/11/1814:58*/
public class Decode {/*** 比较安全的字符串转换** @param str* @return*/public static String str2HexStr(String str) {char[] chars = "0123456789ABCDEF".toCharArray();StringBuilder sb = new StringBuilder("");byte[] bs = str.getBytes();int bit;for (int i = 0; i < bs.length; i++) {bit = (bs[i] & 0x0f0) >> 4;sb.append(chars[bit]);bit = bs[i] & 0x0f;sb.append(chars[bit]);// sb.append(' ');}return sb.toString().trim();}/*** 比较安全的字符串转换** @param hexStr* @return*/public static String hexStr2Str(String hexStr) {String str = "0123456789ABCDEF";char[] hexs = hexStr.toCharArray();byte[] bytes = new byte[hexStr.length() / 2];int n;for (int i = 0; i < bytes.length; i++) {n = str.indexOf(hexs[2 * i]) * 16;n += str.indexOf(hexs[2 * i + 1]);bytes[i] = (byte) (n & 0xff);}return new String(bytes);}
}

2.3些工具类 Opslab

package cn.ucmed.zjcommon.crypto.util;/*** @author zpq* @Title: Opslab* @ProjectName common-crypto* @Description: 一些常用的常量* @date 2020/11/1814:55*/
public class Opslab {/*** 日期时间类型格式*/public static final String DATETIME_FORMAT = "yyyy-MM-dd HH:mm:ss";/*** 日期类型格式*/public static final String DATE_FORMAT = "yyyy-MM-dd";/*** 时间类型的格式*/public static final String TIME_FORMAT = "HH:mm:ss";/*** 7位ASCII字符，也叫作ISO646-US、Unicode字符集的基本拉丁块*/public static final String US_ASCII = "US-ASCII";/*** ISO 拉丁字母表 No.1，也叫作 ISO-LATIN-1*/public static final String ISO_8859_1 = "ISO-8859-1";/*** 8 位 UCS 转换格式*/public static final String UTF_8 = "UTF-8";/*** 16 位 UCS 转换格式，Big Endian（最低地址存放高位字节）字节顺序*/public static final String UTF_16BE = "UTF-16BE";/*** 16 位 UCS 转换格式，Little-endian（最高地址存放低位字节）字节顺序*/public static final String UTF_16LE = "UTF-16LE";/*** 16 位 UCS 转换格式，字节顺序由可选的字节顺序标记来标识*/public static final String UTF_16 = "UTF-16";/*** 中文超大字符集*/public static final String GBK = "GBK";/*** 最常见的中文字符集*/public static final String GB2312 = "GB2312";/*** 空字符串*/public static final String STR_EMPTY = "";/*** 未登陆*/public final static String SYS_NOLOGIN = "Nologin";/*** 成功*/public final static String SYS_SUCCESS = "Success";/*** 失败*/public final static String SYS_ERROR = "Error";/*** 异常*/public final static String SYS_EXCEPTION = "Exception";/*** 无记录*/public final static String SYS_NORECORD = "NoRecord";/*** 业务访问*/public final static String BUSINESS_ACCESS = "ACCESS";/*** 业务插入*/public final static String BUSINESS_INSERT = "INSERT";/*** 业务更新*/public final static String BUSINESS_UPDATE = "UPDATE";/*** 业务删除*/public final static String BUSINESS_DELETE = "DELETE";/*** 业务文件上传*/public final static String BUSINESS_UPLOAD = "UPLOAD";/*** JVM的版本*/public static final String JVM_VERSION = "java.version";/*** JVM的编码*/public static final String JVM_ENCODING = "file.encoding";/*** JVM默认的临时目录*/public static final String JVM_TEMPDIR = "java.io.tmpdir";/*** http代理主机标识*/public static final String HTTP_PROXY_HOST = "http.proxyHost";/*** http代理主机端口*/public static final String HTTP_PROXY_PORT = "http.proxyPort";/*** http代理用户标识*/public static final String HTTP_PROXY_USER = "http.proxyUser";/*** http代理用户密码标识*/public static final String HTTP_PROXY_PASSWORD = "http.proxyPassword";/*** 主机架构*/public static final String SYS_OS_ARCH = "os.arch";/*** 主机类型*/public static final String SYS_OS_NAME = "os.name";/*** 主机类型版本*/public static final String SYS_OS_VERSION = "os.version";/*** 操作系统类型*/public static final String SYS_SUN_DESKTOP = "sun.desktop";/*** 系统文件分隔符key*/public static final String SYS_FILE_SEPARATOR = "file.separator";/*** 系统路径分隔符key*/public static final String SYS_PATH_SEPARATOR = "path.separator";/*** 系统换行符key*/public static final String SYS_LINE_SEPARATOR = "line.separator";/*** 十六进制字符串*/public static final String HEX_CHAR_STR = "0123456789ABCDEF";/*** 常用的符号*/public static final String[] SYMBOL_FH = new String[]{"░", "▒", "▣", "▤", "▥", "▦", "▧", "▨", "▩","▪", "▫", "▬", "◆", "◇", "◈", "◎", "●", "◐", "◑", "☉", "☎", "☏", "☜", "☞", "☺", "☻", "☼","♠", "♡", "♢", "♣", "♤", "♥", "♦", "♧", "♨", "♩", "♪", "♫", "♬", "♭", ".", "。", "，", "、", ";", "：", "？", "!","ˉ", "ˇ", "¨", "`", "~", "々", "～", "‖", "∶", "'", "`", "|", "·", "…", "—", "～", "-","〃", "‘", "’", "“", "”", "〝", "〞", "〔", "〕", "〈", "〉", "《", "》", "「", "」", "『", "』", "〖", "〗", "【", "】", "(", ")", "[","]", "{", "｝", "︻", "︼", "﹄", "﹃",};/*** 常用的数学符号*/public static final String[] SYMBOL_MATH = new String[]{"+", "-", "×", "÷", "﹢", "﹣", "±", "/", "=", "∥", "∠", "≌", "∽","≦", "≧", "≒", "﹤", "﹥", "≈", "≡", "≠", "=", "≤", "≥", "<", ">", "≮", "≯", "∷", "∶", "∫", "∮","∝", "∞", "∧", "∨", "∑", "∏", "∪", "∩", "∈", "∵", "∴", "⊥", "∥", "∠", "⌒", "⊙", "√", "∟", "⊿", "㏒", "㏑", "%", "‰"};/*** 计量符号*/public static final String[] SYMBOL_UNIT = new String[]{"㎎", "㎏", "㎜", "㎝", "㎞", "㎡", "㏄", "㏎", "㏑","㏒", "㏕", "℡", "%", "‰", "℃", "℉", "°", "′", "″", "$", "￡", "￥", "￠", "♂", "♀", "℅"};/*** 常用的数学符号*/public static final String[] SYMBOL_NUMBER = new String[]{"①", "②", "③", "④", "⑤", "⑥", "⑦", "⑧", "⑨", "⑩","㈠", "㈡", "㈢", "㈣", "㈤", "㈥", "㈦", "㈧", "㈨", "㈩","⑴", "⑵", "⑶", "⑷", "⑸", "⑹", "⑺", "⑻", "⑼", "⑽","⑾", "⑿", "⒀", "⒁", "⒂", "⒃", "⒄", "⒅", "⒆", "⒇","Ⅰ", "Ⅱ", "Ⅲ", "Ⅳ", "Ⅴ", "Ⅵ", "Ⅶ", "Ⅷ", "Ⅸ", "Ⅹ","Ⅺ", "Ⅻ", "ⅰ", "ⅱ", "ⅲ", "ⅳ", "ⅴ", "ⅵ", "ⅶ", "ⅷ", "ⅸ", "ⅹ"};}

3.见证奇迹的时候到了。

//----------ASE加密--加密解密----------@Testpublic void testAse(){String key = "admin";String str ="君自故乡来，应知故乡事。来日绮窗前，寒梅著花未。";String after = ASEUtil.encrypt(key,str);System.out.println("----------------加密---------"+after);String befor = ASEUtil.decode(key,after);System.out.println("----------------解密---------"+befor);}

java实现数据AES加密相关推荐

Java中的AES加密和解密（CBC模式）
通过有线方式传输诸如纯文本密码之类的机密数据总是容易受到安全性的影响,始终建议对此类信息进行加密并使用SSL传输这些机密数据.Java为此提供了多种加密算法.在本文中,我们将讨论Java中具有CBC模 ...
java如何实现aes加密_Java 如何实现AES加密
做360广告的对接需要对密码进行AES加密,下面是点睛平台文档的描述: (AES模式为CBC,加密算法MCRYPT_RIJNDAEL_128)对MD5加密后的密码实现对称加密.秘钥是apiSecret ...
java linux aes_java AES 加密和linux解密
java AES 加密:package app; import static java.nio.charset.StandardCharsets.US_ASCII; import static jav ...
[JAVA实战篇] AES加密的JAVA实现及AES算法讲解
AES加密算法原理 1. S-P结构加密 AES加密算法是2001年由美国提出的互联网加密算法,从密码学的角度来讲,AES是典型的S-P结构加密.什么是S-P结构加密呢,手残博主画了一张图帮助大家理解 ...
JS前端加密和Java后端的AES加密和解密
先上前端代码 import cryptoJs from 'crypto-js' let keyOne = 'ZHyXgjF7BejeJySh5vX4O6qE'export default {//加密e ...
数据AES加密安全传输之前端JS加密解密
AES(Advanced Encryption Standard)是一种对称加密方式,旨在取代DES成为广泛使用的标准.我在前端实现关键数据报文加密时采用了该加密方式. 我使用的AES加密架包是cry ...
java 登录数据前端加密+后台验证RSA
前端加密使用RSA+MD5+自写算法使用到了 md5.js+jsencrypt.min.js+1.js+RSAUtils.java(自写算法) 下载链接:https://gitee.com/gy29 ...
cocos2d-js 手游解密jsc和WebSocket数据aes加密解密分析②
前面的http授权成功后,用的是WebSocket进行登录 Fiddler 抓包显示双击进入插件详情,发现是加密的,那就进入js源码看看 js源码看看搜索bufferToData后,得到关键代码 ...
javascript 解密_Javascript中的AES加密和Java中的解密
javascript 解密 AES代表高级加密系统,它是一种对称加密算法,很多时候我们需要在客户端加密一些纯文本,例如密码,然后将其发送到服务器,然后由服务器解密以进行进一步处理.AES加密和解密更加 ...

java实现数据AES加密

1.AES加密

2.下面开始上代码

1.这里是核心代码

2.下面是封装的一些工具类

2.1工具类 Base64Ext

2.2些工具类 Decode

2.3些工具类 Opslab

3.见证奇迹的时候到了。

java实现数据AES加密相关推荐

最新文章

热门文章