Base64

最新推荐文章于 2024-06-13 13:32:22 发布
最新推荐文章于 2024-06-13 13:32:22 发布
阅读量499 收藏
点赞数
分类专栏： java 文章标签： byte string null character hibernate input
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/xiaocaichonga/article/details/8076667
版权

Base64是网络上最常见的用于传输8Bit字节代码的编码方式之一，大家可以查看RFC2045～RFC2049，上面有MIME的详细规范。Base64编码可用于在HTTP环境下传递较长的标识信息。例如，在Java Persistence系统Hibernate中，就采用了Base64来将一个较长的唯一标识符（一般为128-bit的UUID）编码为一个字符串，用作HTTP表单和HTTP GET URL中的参数。在其他应用程序中，也常常需要把二进制数据编码为适合放在URL（包括隐藏表单域）中的形式。此时，采用Base64编码不仅比较简短，同时也具有不可读性，即所编码的数据不会被人用肉眼所直接看到。

import java.io.UnsupportedEncodingException;
import java.util.Arrays;
public class Base64 {
 
 private static final char[] CA = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
               .toCharArray();
       private static final int[] IA = new int[256];
       static {
           Arrays.fill(IA, -1);
           for (int i = 0, iS = CA.length; i < iS; i++)
               IA[CA[i]] = i;
           IA['='] = 0;
       }
  
  
      public final static char[] encodeToChar(byte[] sArr, boolean lineSep) {
          // Check special case
          int sLen = sArr != null ? sArr.length : 0;
          if (sLen == 0)
              return new char[0];
  
          int eLen = (sLen / 3) * 3; // Length of even 24-bits.
          int cCnt = ((sLen - 1) / 3 + 1) << 2; // Returned character count
          int dLen = cCnt + (lineSep ? (cCnt - 1) / 76 << 1 : 0); // Length of
                                                                  // returned
                                                                  // array
          char[] dArr = new char[dLen];
  
          // Encode even 24-bits
          for (int s = 0, d = 0, cc = 0; s < eLen;) {
              // Copy next three bytes into lower 24 bits of int, paying attension
              // to sign.
              int i = (sArr[s++] & 0xff) << 16 | (sArr[s++] & 0xff) << 8
                      | (sArr[s++] & 0xff);
  
              // Encode the int into four chars
              dArr[d++] = CA[(i >>> 18) & 0x3f];
              dArr[d++] = CA[(i >>> 12) & 0x3f];
              dArr[d++] = CA[(i >>> 6) & 0x3f];
              dArr[d++] = CA[i & 0x3f];
  
              // Add optional line separator
              if (lineSep && ++cc == 19 && d < dLen - 2) {
                  dArr[d++] = '\r';
                  dArr[d++] = '\n';
                  cc = 0;
              }
          }
  
          // Pad and encode last bits if source isn't even 24 bits.
          int left = sLen - eLen; // 0 - 2.
          if (left > 0) {
              // Prepare the int
              int i = ((sArr[eLen] & 0xff) << 10)
                      | (left == 2 ? ((sArr[sLen - 1] & 0xff) << 2) : 0);
  
              // Set last four chars
              dArr[dLen - 4] = CA[i >> 12];
              dArr[dLen - 3] = CA[(i >>> 6) & 0x3f];
              dArr[dLen - 2] = left == 2 ? CA[i & 0x3f] : '=';
              dArr[dLen - 1] = '=';
          }
          return dArr;
      }
  
 
      public final static byte[] decode(char[] sArr) {
          // Check special case
          int sLen = sArr != null ? sArr.length : 0;
          if (sLen == 0)
              return new byte[0];
  
          // Count illegal characters (including '\r', '\n') to know what size the
          // returned array will be,
          // so we don't have to reallocate & copy it later.
          int sepCnt = 0; // Number of separator characters. (Actually illegal
                          // characters, but that's a bonus)
          for (int i = 0; i < sLen; i++)
              // If input is "pure" (I.e. no line separators or illegal chars)
              // base64 this loop can be commented out.
              if (IA[sArr[i]] < 0)
                  sepCnt++;
  
          // Check so that legal chars (including '=') are evenly divideable by 4
          // as specified in RFC 2045.
          if ((sLen - sepCnt) % 4 != 0)
              return null;
  
          int pad = 0;
          for (int i = sLen; i > 1 && IA[sArr[--i]] <= 0;)
              if (sArr[i] == '=')
                  pad++;
  
          int len = ((sLen - sepCnt) * 6 >> 3) - pad;
  
          byte[] dArr = new byte[len]; // Preallocate byte[] of exact length
  
          for (int s = 0, d = 0; d < len;) {
              // Assemble three bytes into an int from four "valid" characters.
              int i = 0;
              for (int j = 0; j < 4; j++) { // j only increased if a valid char
                                              // was found.
                  int c = IA[sArr[s++]];
                  if (c >= 0)
                      i |= c << (18 - j * 6);
                  else
                      j--;
              }
              // Add the bytes
              dArr[d++] = (byte) (i >> 16);
              if (d < len) {
                  dArr[d++] = (byte) (i >> 8);
                  if (d < len)
                      dArr[d++] = (byte) i;
              }
          }
          return dArr;
      }
  
 
      public final static byte[] decodeFast(char[] sArr) {
          // Check special case
          int sLen = sArr.length;
          if (sLen == 0)
              return new byte[0];
  
          int sIx = 0, eIx = sLen - 1; // Start and end index after trimming.
  
          // Trim illegal chars from start
          while (sIx < eIx && IA[sArr[sIx]] < 0)
              sIx++;
  
          // Trim illegal chars from end
          while (eIx > 0 && IA[sArr[eIx]] < 0)
              eIx--;
  
          // get the padding count (=) (0, 1 or 2)
          int pad = sArr[eIx] == '=' ? (sArr[eIx - 1] == '=' ? 2 : 1) : 0; // Count
                                                                              // '='
                                                                              // at
                                                                              // end.
          int cCnt = eIx - sIx + 1; // Content count including possible
                                      // separators
          int sepCnt = sLen > 76 ? (sArr[76] == '\r' ? cCnt / 78 : 0) << 1 : 0;
  
          int len = ((cCnt - sepCnt) * 6 >> 3) - pad; // The number of decoded
                                                      // bytes
          byte[] dArr = new byte[len]; // Preallocate byte[] of exact length
  
          // Decode all but the last 0 - 2 bytes.
          int d = 0;
          for (int cc = 0, eLen = (len / 3) * 3; d < eLen;) {
              // Assemble three bytes into an int from four "valid" characters.
              int i = IA[sArr[sIx++]] << 18 | IA[sArr[sIx++]] << 12
                      | IA[sArr[sIx++]] << 6 | IA[sArr[sIx++]];
  
              // Add the bytes
              dArr[d++] = (byte) (i >> 16);
              dArr[d++] = (byte) (i >> 8);
              dArr[d++] = (byte) i;
  
              // If line separator, jump over it.
              if (sepCnt > 0 && ++cc == 19) {
                  sIx += 2;
                  cc = 0;
              }
          }
  
          if (d < len) {
              // Decode last 1-3 bytes (incl '=') into 1-3 bytes
              int i = 0;
              for (int j = 0; sIx <= eIx - pad; j++)
                  i |= IA[sArr[sIx++]] << (18 - j * 6);
  
              for (int r = 16; d < len; r -= 8)
                  dArr[d++] = (byte) (i >> r);
          }
  
          return dArr;
      }
  
  
      public final static byte[] encodeToByte(byte[] sArr, boolean lineSep) {
          // Check special case
          int sLen = sArr != null ? sArr.length : 0;
          if (sLen == 0)
              return new byte[0];
  
          int eLen = (sLen / 3) * 3; // Length of even 24-bits.
          int cCnt = ((sLen - 1) / 3 + 1) << 2; // Returned character count
          int dLen = cCnt + (lineSep ? (cCnt - 1) / 76 << 1 : 0); // Length of
                                                                  // returned
                                                                  // array
          byte[] dArr = new byte[dLen];
  
          // Encode even 24-bits
          for (int s = 0, d = 0, cc = 0; s < eLen;) {
              // Copy next three bytes into lower 24 bits of int, paying attension
              // to sign.
              int i = (sArr[s++] & 0xff) << 16 | (sArr[s++] & 0xff) << 8
                      | (sArr[s++] & 0xff);
  
              // Encode the int into four chars
              dArr[d++] = (byte) CA[(i >>> 18) & 0x3f];
              dArr[d++] = (byte) CA[(i >>> 12) & 0x3f];
              dArr[d++] = (byte) CA[(i >>> 6) & 0x3f];
              dArr[d++] = (byte) CA[i & 0x3f];
  
              // Add optional line separator
              if (lineSep && ++cc == 19 && d < dLen - 2) {
                  dArr[d++] = '\r';
                  dArr[d++] = '\n';
                  cc = 0;
              }
          }
  
          // Pad and encode last bits if source isn't an even 24 bits.
          int left = sLen - eLen; // 0 - 2.
          if (left > 0) {
              // Prepare the int
              int i = ((sArr[eLen] & 0xff) << 10)
                      | (left == 2 ? ((sArr[sLen - 1] & 0xff) << 2) : 0);
  
              // Set last four chars
              dArr[dLen - 4] = (byte) CA[i >> 12];
              dArr[dLen - 3] = (byte) CA[(i >>> 6) & 0x3f];
              dArr[dLen - 2] = left == 2 ? (byte) CA[i & 0x3f] : (byte) '=';
              dArr[dLen - 1] = '=';
          }
          return dArr;
      }
  
 
      public final static byte[] decode(byte[] sArr) {
          // Check special case
          int sLen = sArr.length;
  
          // Count illegal characters (including '\r', '\n') to know what size the
          // returned array will be,
          // so we don't have to reallocate & copy it later.
          int sepCnt = 0; // Number of separator characters. (Actually illegal
                          // characters, but that's a bonus)
          for (int i = 0; i < sLen; i++)
              // If input is "pure" (I.e. no line separators or illegal chars)
              // base64 this loop can be commented out.
              if (IA[sArr[i] & 0xff] < 0)
                  sepCnt++;
  
          // Check so that legal chars (including '=') are evenly divideable by 4
          // as specified in RFC 2045.
          if ((sLen - sepCnt) % 4 != 0)
              return null;
  
          int pad = 0;
          for (int i = sLen; i > 1 && IA[sArr[--i] & 0xff] <= 0;)
              if (sArr[i] == '=')
                  pad++;
  
          int len = ((sLen - sepCnt) * 6 >> 3) - pad;
  
          byte[] dArr = new byte[len]; // Preallocate byte[] of exact length
  
          for (int s = 0, d = 0; d < len;) {
              // Assemble three bytes into an int from four "valid" characters.
              int i = 0;
              for (int j = 0; j < 4; j++) { // j only increased if a valid char
                                              // was found.
                  int c = IA[sArr[s++] & 0xff];
                  if (c >= 0)
                      i |= c << (18 - j * 6);
                  else
                      j--;
              }
  
              // Add the bytes
              dArr[d++] = (byte) (i >> 16);
              if (d < len) {
                  dArr[d++] = (byte) (i >> 8);
                  if (d < len)
                      dArr[d++] = (byte) i;
              }
          }
  
          return dArr;
      }
 
      public final static byte[] decodeFast(byte[] sArr) {
          // Check special case
          int sLen = sArr.length;
          if (sLen == 0)
              return new byte[0];
  
          int sIx = 0, eIx = sLen - 1; // Start and end index after trimming.
  
          // Trim illegal chars from start
          while (sIx < eIx && IA[sArr[sIx] & 0xff] < 0)
              sIx++;
  
          // Trim illegal chars from end
          while (eIx > 0 && IA[sArr[eIx] & 0xff] < 0)
              eIx--;
  
          // get the padding count (=) (0, 1 or 2)
          int pad = sArr[eIx] == '=' ? (sArr[eIx - 1] == '=' ? 2 : 1) : 0; // Count
                                                                              // '='
                                                                              // at
                                                                              // end.
          int cCnt = eIx - sIx + 1; // Content count including possible
                                      // separators
          int sepCnt = sLen > 76 ? (sArr[76] == '\r' ? cCnt / 78 : 0) << 1 : 0;
  
          int len = ((cCnt - sepCnt) * 6 >> 3) - pad; // The number of decoded
                                                      // bytes
          byte[] dArr = new byte[len]; // Preallocate byte[] of exact length
  
          // Decode all but the last 0 - 2 bytes.
          int d = 0;
          for (int cc = 0, eLen = (len / 3) * 3; d < eLen;) {
              // Assemble three bytes into an int from four "valid" characters.
              int i = IA[sArr[sIx++]] << 18 | IA[sArr[sIx++]] << 12
                      | IA[sArr[sIx++]] << 6 | IA[sArr[sIx++]];
  
              // Add the bytes
              dArr[d++] = (byte) (i >> 16);
              dArr[d++] = (byte) (i >> 8);
              dArr[d++] = (byte) i;
  
              // If line separator, jump over it.
              if (sepCnt > 0 && ++cc == 19) {
                  sIx += 2;
                  cc = 0;
              }
          }
  
          if (d < len) {
              // Decode last 1-3 bytes (incl '=') into 1-3 bytes
              int i = 0;
              for (int j = 0; sIx <= eIx - pad; j++)
                  i |= IA[sArr[sIx++]] << (18 - j * 6);
  
              for (int r = 16; d < len; r -= 8)
                  dArr[d++] = (byte) (i >> r);
          }
  
          return dArr;
      }
 
      public final static String encodeToString(byte[] sArr, boolean lineSep) {
          // Reuse char[] since we can't create a String incrementally anyway and
          // StringBuffer/Builder would be slower.
          return new String(encodeToChar(sArr, lineSep));
      }
     
      public final static String encode(String s) {
          // Reuse char[] since we can't create a String incrementally anyway and
          // StringBuffer/Builder would be slower.
          try {
              return new String(encodeToChar(s.getBytes("UTF-8"), false));
          } catch (UnsupportedEncodingException e) {
              System.err.println("Base64 encoding error: " + e.getMessage());
              e.printStackTrace();
          }
          return null;
      }
  
      public final static byte[] decode(String str, boolean used) {
          // Check special case
          int sLen = str != null ? str.length() : 0;
          if (sLen == 0)
              return new byte[0];
  
          // Count illegal characters (including '\r', '\n') to know what size the
          // returned array will be,
          // so we don't have to reallocate & copy it later.
          int sepCnt = 0; // Number of separator characters. (Actually illegal
                          // characters, but that's a bonus)
          for (int i = 0; i < sLen; i++)
             // If input is "pure" (I.e. no line separators or illegal chars)
              // base64 this loop can be commented out.
              if (IA[str.charAt(i)] < 0)
                  sepCnt++;
  
          // Check so that legal chars (including '=') are evenly divideable by 4
          // as specified in RFC 2045.
          if ((sLen - sepCnt) % 4 != 0)
              return null;
  
          // Count '=' at end
          int pad = 0;
          for (int i = sLen; i > 1 && IA[str.charAt(--i)] <= 0;)
              if (str.charAt(i) == '=')
                  pad++;
  
          int len = ((sLen - sepCnt) * 6 >> 3) - pad;
  
          byte[] dArr = new byte[len]; // Preallocate byte[] of exact length
  
          for (int s = 0, d = 0; d < len;) {
              // Assemble three bytes into an int from four "valid" characters.
              int i = 0;
              for (int j = 0; j < 4; j++) { // j only increased if a valid char
                                              // was found.
                  int c = IA[str.charAt(s++)];
                  if (c >= 0)
                      i |= c << (18 - j * 6);
                  else
                      j--;
              }
              // Add the bytes
              dArr[d++] = (byte) (i >> 16);
              if (d < len) {
                  dArr[d++] = (byte) (i >> 8);
                  if (d < len)
                      dArr[d++] = (byte) i;
              }
          }
          return dArr;
      }

      public final static byte[] decodeFast(String s) {
          // Check special case
          int sLen = s.length();
          if (sLen == 0)
              return new byte[0];
  
          int sIx = 0, eIx = sLen - 1; // Start and end index after trimming.
  
          // Trim illegal chars from start
          while (sIx < eIx && IA[s.charAt(sIx) & 0xff] < 0)
              sIx++;
  
          // Trim illegal chars from end
          while (eIx > 0 && IA[s.charAt(eIx) & 0xff] < 0)
              eIx--;
  
          // get the padding count (=) (0, 1 or 2)
          int pad = s.charAt(eIx) == '=' ? (s.charAt(eIx - 1) == '=' ? 2 : 1) : 0; // Count
                                                                                      // '='
                                                                                      // at
                                                                                      // end.
          int cCnt = eIx - sIx + 1; // Content count including possible
                                      // separators
          int sepCnt = sLen > 76 ? (s.charAt(76) == '\r' ? cCnt / 78 : 0) << 1
                  : 0;
  
          int len = ((cCnt - sepCnt) * 6 >> 3) - pad; // The number of decoded
                                                      // bytes
          byte[] dArr = new byte[len]; // Preallocate byte[] of exact length
  
          // Decode all but the last 0 - 2 bytes.
          int d = 0;
          for (int cc = 0, eLen = (len / 3) * 3; d < eLen;) {
              // Assemble three bytes into an int from four "valid" characters.
              int i = IA[s.charAt(sIx++)] << 18 | IA[s.charAt(sIx++)] << 12
                      | IA[s.charAt(sIx++)] << 6 | IA[s.charAt(sIx++)];
  
              // Add the bytes
              dArr[d++] = (byte) (i >> 16);
              dArr[d++] = (byte) (i >> 8);
              dArr[d++] = (byte) i;
  
              // If line separator, jump over it.
              if (sepCnt > 0 && ++cc == 19) {
                  sIx += 2;
                  cc = 0;
              }
          }
  
          if (d < len) {
              // Decode last 1-3 bytes (incl '=') into 1-3 bytes
              int i = 0;
              for (int j = 0; sIx <= eIx - pad; j++)
                  i |= IA[s.charAt(sIx++)] << (18 - j * 6);
  
              for (int r = 16; d < len; r -= 8)
                  dArr[d++] = (byte) (i >> r);
          }
  
          return dArr;
      }
      public static String decode(String s) throws UnsupportedEncodingException {
          return new String(Base64.decodeFast(s), "utf-8");
      }
     
      public static void main(String[] args) throws UnsupportedEncodingException {
       String str="测试";
       String encode=encode(str);
       System.out.println(encode);
       String decode=decode(encode);
       System.out.println(decode);
      }
}

运行结果如下：

5rWL6K+V
测试

xiaocaichonga
关注
专栏目录
python中base64库用法详解
IT之一小佬的博客
07-23 4万+
python中base64库用法详解
Base64编码原理
深度
06-26 2905
base 64、base 32、base 16 编码建议标准 https://www.ietf.org/rfc/rfc4648.txtBase64是基于64种字符的编码算法，即将数据使用64种字符表示，编码后的Base64字符串长度 通常为原来的3-4倍。（补充：Base32就是32个字符，Base16就是16个字符，为了能在Http get 参数方式传输，有了变体URLBase64，主要是将符号=和+换成了其他字符，因为这些字符在url有特殊的意义，不能直接，所以做了替换） 即如下表，例如数字0（十进制
base64
热门推荐
p571912102的博客
07-20 5万+
为什么要用base64编码？ base64简单描述： ASCII码一个字符用8位二进制码表示，base64一个字符只需要6位（一个字节为8位所以最高位补两个0），3*8=4*6 = 24 ，由此可见4位base64码的字符可以很好的表示3位ASCII码的字符（也就是说base64 编码后会比原本的字符长），而且base64规定 被转码的字符如果不足3的倍数，在后面补0，补足3的倍数，转码后，0...
Base64加密解密
Jin的随手笔记
03-29 3万+
解决：btoa 不支持 Unicode 字符编码的问题编码时，先用 encodeURIComponent 对字符串进行编码，再进行 btoa 进行 Base64 编码解码时，先用 atob 对 Base64 编码的串进行解码，再用 decodeURIComponent 对字符串进行解码。注意：不适用于带中文解密，即window.btoa 与 window.atob 不支持中文，且 IE9 以下不支持atob、btoa。2、window.atob() 函数用来解码被 base64 编码过的数据。
认识Base64，看这篇足够了
风如也的博客
04-18 1万+
Base64编码要求把3个8位字节（3*8=24）转化为4个6位的字节（4*6=24），之后在6位的前面补两个0，形成8位一个字节的形式。如果剩下的字符不足3个字节，则用0填充。
Base64编码方式的介绍及其编码解码
最新发布
寻码启示
06-13 3322
Base64编码的优点，用途，发明原因，及其编码解码原理介绍。
Base64编码
local_752的专栏
12-16 2万+
Base64是一种用64个字符来表示任意二进制数据的方法。它是一种编码方式，而非加密方式。它通过将二进制数据转变为64个“可打印字符”，完成了数据在HTTP协议上的传输。
Java中的Base64详解
qq_43842093的博客
10-14 3万+
​ Base64编码，是我们程序开发中经常使用到的编码方法。它是一种基于用64个可打印字符来表示二进制数据的表示方法。它通常用作存储、传输一些二进制数据编码方法, 也是MIME（多用途互联网邮件扩展，主要用作电子邮件标准）中一种可打印字符表示二进制数据的常见编码方法。它其实只是定义用可打印字符传输内容一种方法，并不会产生新的字符集。严格来说Base64并不是一种加密/解密算法，而是一种编码方式。
Base64编码原理分析
发现问题，面对问题，分析问题，解决问题，总结问题
04-24 3857
文章目录一、认识（一）认识（二）计算（1）规则（2）示例（3）Base64编码转换表二、网页图片转base64编码分析（一）Data URI（二）图片转Base64分析（1）认识（2）图片使用base64编码优点 一、认识 （一）认识 Base64是网络上最常见的用于传输8Bit字节码的编码方式之一，Base64就是一种基于64个可打印字符来表示二进制数据的方法。Base64编码是从二进制到字符的过程，可用于在HTTP环境下传递较长的标识信息。采用Base64编码具有不可读性，需要解码后才能阅读。 （二）计
二进制与base64的转换
Billy Jue的博客
07-13 4778
#ifndef _BASE64_H_ #define _BASE64_H_ #include <stdlib.h> #include <string.h> char *base64_decode(const char *bdata, int bdlen); char *base64_encode(const char *data, int dlen); int base64_encode_size(int srclen); int base64_decode_size(i.
labview 图片缩放 base64编码base64解码
08-07
在这个特定的场景中，我们关注的是如何在LabVIEW中处理图片，包括图片的缩放、Base64编码和解码。 1. **图片缩放**： 在LabVIEW中，你可以使用图像处理库来实现图片的缩放功能。这个库提供了各种图像操作函数，...
Base64.zip_labview base64
07-13
在“Base64.zip_labview base64”这个压缩包中，包含了一个名为“Base64.vi”的虚拟仪器（VI）。这个VI是用LabVIEW编写的，目的就是提供一个纯LabVIEW环境下的Base64编码解决方案。下面我们将详细探讨如何在LabVIEW...
Base64转二进制文件，Base64 To File
03-11
Base64编码是一种常见的数据编码方式，主要用于在不支持二进制传输的环境中传递二进制数据。它将任意的二进制数据转化为ASCII字符序列，这样就可以在文本格式的邮件、网页源代码等场景中方便地使用。Base64编码会将3...
BASE64图片解码_解码_vba图片base64_base64_VBa_图片_
10-02
在Excel中使用VBA（Visual Basic for Applications）解码BASE64编码的图片是一项常见的编程任务，特别是当你需要处理从网络或数据库中获取的BASE64格式的图像数据时。BASE64是一种用于将二进制数据转换为可打印ASCII...
VB JPG转base64和base64转JPG.rar
03-13
这个“VB JPG转base64和base64转JPG.rar”压缩包文件包含的可能是两个VB程序，分别用于将JPG图片编码为Base64字符串和将Base64字符串解码回JPG图片。 首先，让我们深入了解一下Base64编码的原理。Base64编码将每3个...
java 后台返回json数据给前台
xiaocaichonga的专栏
10-16 4万+
第一步：新建一个JsonBinder.java类,代码如下： import java.io.IOException; import java.text.DateFormat; import java.text.SimpleDateFormat; import java.util.HashMap; import java.util.Map; import org.apache.log4j
如何随机产生唯一的app_key和app_secret
xiaocaichonga的专栏
10-16 1万+
UUID含义是通用唯一识别码 (Universally Unique Identifier)，这 是一个软件建构的标准，也是被开源软件基金会 (Open Software Foundation, OSF) 的组织应用在分布式计算环境 (Distributed Computing Environment, DCE) 领域的一部份。 UUID 的目的，是让分布式系统中的所有元素，都能有唯一的辨识
MD5
xiaocaichonga的专栏
10-16 327
Message Digest Algorithm MD5（中文名为消息摘要算法第五版）为计算机安全领域广泛使用的一种散列函数，用以提供消息的完整性保护。该算法的文件号为RFC 1321（R.Rivest,MIT Laboratory for Computer Science and RSA Data Security Inc. April 1992） 下面是java的MD5实现： impo
Java图片URL转Base64与Base64转图片工具类实现
"图片url和base64位相互转换" 在计算机编程中，有时我们需要将图片数据在内存中进行编码和解码，以便在网络传输或存储时更高效地处理。Base64是一种常用的编码方式，它将二进制数据转换为可打印的ASCII字符串。这个...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值