zoukankan      html  css  js  c++  java
  • AES加密解密

     public class AESDE
        {
            public AESDE() { }

            #region AES-BAIDU
            
            /// <summary>
            /// AES加密
            /// </summary>
            /// <param name="encryptStr">明文</param>
            /// <param name="key">密钥</param>
            /// <returns></returns>

            public static string Encrypt( string encryptStr, string key )
            {

                byte[] keyArray = UTF8Encoding.UTF8.GetBytes( key );

                byte[] toEncryptArray = UTF8Encoding.UTF8.GetBytes( encryptStr );

                RijndaelManaged rDel = new RijndaelManaged();

                rDel.Key = keyArray;

                rDel.Mode = CipherMode.ECB;

                rDel.Padding = PaddingMode.PKCS7;

                ICryptoTransform cTransform = rDel.CreateEncryptor();

                byte[] resultArray = cTransform.TransformFinalBlock( toEncryptArray, 0, toEncryptArray.Length );

                return Convert.ToBase64String( resultArray, 0, resultArray.Length );

            }


            /// <summary>
            /// AES解密
            /// </summary>
            /// <param name="decryptStr">密文</param>
            /// <param name="key">密钥</param>
            /// <returns></returns>

            public static string Decrypt( string decryptStr, string key )
            {

                byte[] keyArray = UTF8Encoding.UTF8.GetBytes( key );

                byte[] toEncryptArray = Convert.FromBase64String( decryptStr );

                RijndaelManaged rDel = new RijndaelManaged();

                rDel.Key = keyArray;

                rDel.Mode = CipherMode.ECB;

                rDel.Padding = PaddingMode.PKCS7;

                ICryptoTransform cTransform = rDel.CreateDecryptor();

                byte[] resultArray = cTransform.TransformFinalBlock( toEncryptArray, 0, toEncryptArray.Length );

                return UTF8Encoding.UTF8.GetString( resultArray );

            }

            #endregion
        }

  • 相关阅读:
    剑指offer:复杂链表的复制
    剑值offer:最小的k个数
    剑指offer:第一个只出现一次的字符
    剑指offer:树的子结构
    leetcode 240搜索二维矩阵
    leetcode 22括号生成
    leetcode 79 单词搜索
    leetcode 17电话号码的字母组合
    leetcode 78子集
    leetcode 105从前序与中序遍历序列构造二叉树
  • 原文地址:https://www.cnblogs.com/tonglei/p/4422854.html
Copyright © 2011-2022 走看看