zoukankan      html  css  js  c++  java
  • java AES

    import javax.crypto.Cipher;
    import javax.crypto.spec.SecretKeySpec;


    public class AES {
    public static byte[] encode(byte[] paramArrayOfByte1, byte[] paramArrayOfByte2)
    {
    //paramArrayOfByte1 是key paramArrayOfByte2 是明文
    if ((paramArrayOfByte1 == null) || (paramArrayOfByte1.length != 32))
    return null;
    try
    {
    SecretKeySpec localSecretKeySpec = new SecretKeySpec(paramArrayOfByte1, "AES");
    Cipher localCipher = Cipher.getInstance("AES/ECB/PKCS7Padding", "BC");
    localCipher.init(1, localSecretKeySpec);
    byte[] arrayOfByte = localCipher.doFinal(paramArrayOfByte2);
    return arrayOfByte;
    }
    catch (Exception localException)
    {
    localException.printStackTrace();
    }
    return null;
    }
    public static String decode(byte[] paramArrayOfByte1, byte[] paramArrayOfByte2)
    {
    if ((paramArrayOfByte1 == null) || (paramArrayOfByte1.length != 32))
    return null;
    try
    {
    SecretKeySpec localSecretKeySpec = new SecretKeySpec(paramArrayOfByte1, "AES");
    Cipher localCipher = Cipher.getInstance("AES/ECB/PKCS7Padding", "BC");
    localCipher.init(2, localSecretKeySpec);
    String str = new String(localCipher.doFinal(paramArrayOfByte2));
    return str;
    }
    catch (Exception localException)
    {
    localException.printStackTrace();
    }
    return null;
    }

    }

  • 相关阅读:
    BZOJ4036 HAOI2015按位或(概率期望+容斥原理)
    洛谷p2661信息传递题解
    洛谷P1434滑雪题解及记忆化搜索的基本步骤
    二分图最大匹配
    线段树

    图论基本算法
    并查集
    RMQ--ST表
    矩阵快速幂和矩阵乘法
  • 原文地址:https://www.cnblogs.com/tester-huang/p/5531955.html
Copyright © 2011-2022 走看看