C#中的MD5

Posted By zero
Categorized Under: 开发相关
Comments (0)

代码下载

都是编码惹的祸
笔者在使用c#(System.Web.Security.FormsAuthentication.HashPasswordForStoringInConfigFile
对字符串加密时,发现如果字符串中如果包含中文字符时,加密的结果与原来用DELPHI实现的加密算法不一样。笔者第一感觉就是编码的问题,因为笔者曾经在用delphi和C#实现同一算法时,吃尽了中文字符编码差异的苦头。
开始解决问题
上网Google C#和MD5,发现了一个别人用c#实现的MD5算法,
//源文件:md5.cs
// MD5 Alogrithm
// by rufi 2004.6.20 http://rufi.yculblog.com/
using System;
using System.Collections;
using System.IO;
namespace mymd5
{
     public class MD5
     {
         //static state variables
         private static UInt32 A;
         private static UInt32 B;
         private static UInt32 C;
         private static UInt32 D;
 
         //number of bits to rotate in tranforming
         private const int S11 = 7;
         private const int S12 = 12;
         private const int S13 = 17;
         private const int S14 = 22;
         private const int S21 = 5;
         private const int S22 = 9;
         private const int S23 = 14;
         private const int S24 = 20;
         private const int S31 = 4;
         private const int S32 = 11;
         private const int S33 = 16;
         private const int S34 = 23;
         private const int S41 = 6;
         private const int S42 = 10;
         private const int S43 = 15;
         private const int S44 = 21;
 
 
         /* F, G, H and I are basic MD5 functions.
          * 四个非线性函数:
          *
          * F(X,Y,Z) =(X&Y)|((~X)&Z)
          * G(X,Y,Z) =(X&Z)|(Y&(~Z))
          * H(X,Y,Z) =X^Y^Z
          * I(X,Y,Z)=Y^(X|(~Z))
          *
          * (&与,|或,~非,^异或)
          */
         private static UInt32 F(UInt32 x,UInt32 y,UInt32 z)
         {
              return (x&y)|((~x)&z);
         }
         private static UInt32 G(UInt32 x,UInt32 y,UInt32 z)
         {
              return (x&z)|(y&(~z));
         }
         private static UInt32 H(UInt32 x,UInt32 y,UInt32 z)
         {
              return x^y^z;
         }
         private static UInt32 I(UInt32 x,UInt32 y,UInt32 z)
         {
              return y^(x|(~z));
         }
 
         /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
          * Rotation is separate from addition to prevent recomputation.
          */
         private static void FF(ref UInt32 a,UInt32 b,UInt32 c,UInt32 d,UInt32 mj,int s,UInt32 ti)
         {
              a = a + F(b,c,d) + mj + ti;
              a = a << s | a >> (32-s);
              a += b;
         }
         private static void GG(ref UInt32 a,UInt32 b,UInt32 c,UInt32 d,UInt32 mj,int s,UInt32 ti)
         {
              a = a + G(b,c,d) + mj + ti;
              a = a << s | a >> (32-s);
              a += b;
         }
         private static void HH(ref UInt32 a,UInt32 b,UInt32 c,UInt32 d,UInt32 mj,int s,UInt32 ti)
         {
              a = a + H(b,c,d) + mj + ti;
              a = a << s | a >> (32-s);
              a += b;
         }
         private static void II(ref UInt32 a,UInt32 b,UInt32 c,UInt32 d,UInt32 mj,int s,UInt32 ti)
         {
              a = a + I(b,c,d) + mj + ti;
              a = a << s | a >> (32-s);
              a += b;
         }
 
         private static void MD5_Init()
         {
              A=0×67452301//in memory, this is 0×01234567
              B=0xefcdab89//in memory, this is 0×89abcdef
              C=0×98badcfe//in memory, this is 0xfedcba98
              D=0×10325476//in memory, this is 0×76543210
         }
 
         private static UInt32[] MD5_Append(byte[] input)
         {
              int zeros=0;
              int ones =1;
              int size=0;
              int n = input.Length;
              int m = n%64;
              if( m < 56 )
              {
                   zeros = 55-m;
                   size=n-m+64;
              }
              else if (m==56)
              {
                   zeros = 0;
                   ones = 0;
                   size=n+8;
              }
              else
              {
                   zeros = 63-m+56;
                   size=n+64-m+64;
              }
 
              ArrayList bs = new ArrayList(input);
              if(ones==1)
              {
                   bs.Add( (byte)0×80 ); // 0×80 = $10000000
              }
              for(int i=0;i<zeros;i++)
              {
                   bs.Add( (byte)0 );
              }
 
              UInt64 N = (UInt64) n * 8;
              byte h1=(byte)(N&0xFF);
              byte h2=(byte)((N>>8)&0xFF);
              byte h3=(byte)((N>>16)&0xFF);
              byte h4=(byte)((N>>24)&0xFF);
              byte h5=(byte)((N>>32)&0xFF);
              byte h6=(byte)((N>>40)&0xFF);
              byte h7=(byte)((N>>48)&0xFF);
              byte h8=(byte)(N>>56);
              bs.Add(h1);
              bs.Add(h2);
              bs.Add(h3);
              bs.Add(h4);
              bs.Add(h5);
              bs.Add(h6);
              bs.Add(h7);
              bs.Add(h8);
              byte[] ts=(byte[])bs.ToArray(typeof(byte));
 
              /* Decodes input (byte[]) into output (UInt32[]). Assumes len is
               * a multiple of 4.
               */
              UInt32[] output = new UInt32[size/4];
              for(Int64 i=0,j=0;i<size;j++,i+=4)
              {
                   output[j]=(UInt32)(ts[i] | ts[i+1]<<8 | ts[i+2]<<16 | ts[i+3]<<24);
              }
              return output;
         }
         private static UInt32[] MD5_Trasform(UInt32[] x)
         {
 
              UInt32 a,b,c,d;
 
              for(int k=0;k<x.Length;k+=16)
              {
                   a=A;
                   b=B;
                   c=C;
                   d=D;
   
                   /* Round 1 */
                   FF (ref a, b, c, d, x[k+ 0], S11, 0xd76aa478); /* 1 */
                   FF (ref d, a, b, c, x[k+ 1], S12, 0xe8c7b756); /* 2 */
                   FF (ref c, d, a, b, x[k+ 2], S13, 0×242070db); /* 3 */
                   FF (ref b, c, d, a, x[k+ 3], S14, 0xc1bdceee); /* 4 */
                   FF (ref a, b, c, d, x[k+ 4], S11, 0xf57c0faf); /* 5 */
                   FF (ref d, a, b, c, x[k+ 5], S12, 0×4787c62a); /* 6 */
                   FF (ref c, d, a, b, x[k+ 6], S13, 0xa8304613); /* 7 */
                   FF (ref b, c, d, a, x[k+ 7], S14, 0xfd469501); /* 8 */
                   FF (ref a, b, c, d, x[k+ 8], S11, 0×698098d8); /* 9 */
                   FF (ref d, a, b, c, x[k+ 9], S12, 0×8b44f7af); /* 10 */
                   FF (ref c, d, a, b, x[k+10], S13, 0xffff5bb1); /* 11 */
                   FF (ref b, c, d, a, x[k+11], S14, 0×895cd7be); /* 12 */
                   FF (ref a, b, c, d, x[k+12], S11, 0×6b901122); /* 13 */
                   FF (ref d, a, b, c, x[k+13], S12, 0xfd987193); /* 14 */
                   FF (ref c, d, a, b, x[k+14], S13, 0xa679438e); /* 15 */
                   FF (ref b, c, d, a, x[k+15], S14, 0×49b40821); /* 16 */
 
                   /* Round 2 */
                   GG (ref a, b, c, d, x[k+ 1], S21, 0xf61e2562); /* 17 */
                   GG (ref d, a, b, c, x[k+ 6], S22, 0xc040b340); /* 18 */
                   GG (ref c, d, a, b, x[k+11], S23, 0×265e5a51); /* 19 */
                   GG (ref b, c, d, a, x[k+ 0], S24, 0xe9b6c7aa); /* 20 */
                   GG (ref a, b, c, d, x[k+ 5], S21, 0xd62f105d); /* 21 */
                   GG (ref d, a, b, c, x[k+10], S22, 0×2441453); /* 22 */
                   GG (ref c, d, a, b, x[k+15], S23, 0xd8a1e681); /* 23 */
                   GG (ref b, c, d, a, x[k+ 4], S24, 0xe7d3fbc8); /* 24 */
                   GG (ref a, b, c, d, x[k+ 9], S21, 0×21e1cde6); /* 25 */
                   GG (ref d, a, b, c, x[k+14], S22, 0xc33707d6); /* 26 */
                   GG (ref c, d, a, b, x[k+ 3], S23, 0xf4d50d87); /* 27 */
                   GG (ref b, c, d, a, x[k+ 8], S24, 0×455a14ed); /* 28 */
                   GG (ref a, b, c, d, x[k+13], S21, 0xa9e3e905); /* 29 */
                   GG (ref d, a, b, c, x[k+ 2], S22, 0xfcefa3f8); /* 30 */
                   GG (ref c, d, a, b, x[k+ 7], S23, 0×676f02d9); /* 31 */
                   GG (ref b, c, d, a, x[k+12], S24, 0×8d2a4c8a); /* 32 */
 
                   /* Round 3 */
                   HH (ref a, b, c, d, x[k+ 5], S31, 0xfffa3942); /* 33 */
                   HH (ref d, a, b, c, x[k+ 8], S32, 0×8771f681); /* 34 */
                   HH (ref c, d, a, b, x[k+11], S33, 0×6d9d6122); /* 35 */
                   HH (ref b, c, d, a, x[k+14], S34, 0xfde5380c); /* 36 */
                   HH (ref a, b, c, d, x[k+ 1], S31, 0xa4beea44); /* 37 */
                   HH (ref d, a, b, c, x[k+ 4], S32, 0×4bdecfa9); /* 38 */
                   HH (ref c, d, a, b, x[k+ 7], S33, 0xf6bb4b60); /* 39 */
                   HH (ref b, c, d, a, x[k+10], S34, 0xbebfbc70); /* 40 */
                   HH (ref a, b, c, d, x[k+13], S31, 0×289b7ec6); /* 41 */
                   HH (ref d, a, b, c, x[k+ 0], S32, 0xeaa127fa); /* 42 */
                   HH (ref c, d, a, b, x[k+ 3], S33, 0xd4ef3085); /* 43 */
                   HH (ref b, c, d, a, x[k+ 6], S34, 0×4881d05); /* 44 */
                   HH (ref a, b, c, d, x[k+ 9], S31, 0xd9d4d039); /* 45 */
                   HH (ref d, a, b, c, x[k+12], S32, 0xe6db99e5); /* 46 */
                   HH (ref c, d, a, b, x[k+15], S33, 0×1fa27cf8); /* 47 */
                   HH (ref b, c, d, a, x[k+ 2], S34, 0xc4ac5665); /* 48 */
 
                   /* Round 4 */
                   II (ref a, b, c, d, x[k+ 0], S41, 0xf4292244); /* 49 */
                   II (ref d, a, b, c, x[k+ 7], S42, 0×432aff97); /* 50 */
                   II (ref c, d, a, b, x[k+14], S43, 0xab9423a7); /* 51 */
                   II (ref b, c, d, a, x[k+ 5], S44, 0xfc93a039); /* 52 */
                   II (ref a, b, c, d, x[k+12], S41, 0×655b59c3); /* 53 */
                   II (ref d, a, b, c, x[k+ 3], S42, 0×8f0ccc92); /* 54 */
                   II (ref c, d, a, b, x[k+10], S43, 0xffeff47d); /* 55 */
                   II (ref b, c, d, a, x[k+ 1], S44, 0×85845dd1); /* 56 */
                   II (ref a, b, c, d, x[k+ 8], S41, 0×6fa87e4f); /* 57 */
                   II (ref d, a, b, c, x[k+15], S42, 0xfe2ce6e0); /* 58 */
                   II (ref c, d, a, b, x[k+ 6], S43, 0xa3014314); /* 59 */
                   II (ref b, c, d, a, x[k+13], S44, 0×4e0811a1); /* 60 */
                   II (ref a, b, c, d, x[k+ 4], S41, 0xf7537e82); /* 61 */
                   II (ref d, a, b, c, x[k+11], S42, 0xbd3af235); /* 62 */
                   II (ref c, d, a, b, x[k+ 2], S43, 0×2ad7d2bb); /* 63 */
                   II (ref b, c, d, a, x[k+ 9], S44, 0xeb86d391); /* 64 */
 
                   A+=a;
                   B+=b;
                   C+=c;
                   D+=d;
              }
              return new UInt32[]{A,B,C,D};
         }
         public static byte[] MD5Array(byte[] input)
         {
              MD5_Init();
              UInt32[] block = MD5_Append(input);
              UInt32[] bits = MD5_Trasform(block);
 
              /* Encodes bits (UInt32[]) into output (byte[]). Assumes len is
               * a multiple of 4.
                    */
              byte[] output=new byte[bits.Length*4];
              for(int i=0,j=0;i<bits.Length;i++,j+=4)
              {
                   output[j] = (byte)(bits[i] & 0xff);
                   output[j+1] = (byte)((bits[i] >> 8) & 0xff);
                   output[j+2] = (byte)((bits[i] >> 16) & 0xff);
                   output[j+3] = (byte)((bits[i] >> 24) & 0xff);
              }
              return output;
         }
 
         public static string ArrayToHexString(byte[] array,bool uppercase)
         {
              string hexString="";
              string format="x2";
              if(uppercase)
              {
                   format="X2";
              }
              foreach(byte b in array)
              {
                   hexString += b.ToString(format);
              }
              return hexString;
         }
 
         public static string MDString(string message)
         {
              char[] c = message.ToCharArray();
              byte[] b = new byte[c.Length];
              for(int i=0;i<c.Length;i++)
              {
                   b[i]=(byte)c[i];
              }
              byte[] digest = MD5Array(b);
              return ArrayToHexString(digest,false);
         }
         public static string MDFile(string fileName)
         {
              FileStream fs=File.Open(fileName,FileMode.Open,FileAccess.Read);
              byte[] array=new byte[fs.Length];
              fs.Read(array,0,(int)fs.Length);
              byte[] digest = MD5Array(array);
              fs.Close();
              return ArrayToHexString(digest,false);
         }
 
         //public static string Test(string message)
         //{
         //   return "rnMD5 (""+message+"") = " + MD5.MDString(message);
         //}
         //public static string TestSuite()
         //{   
         //   string s = "";
         //   s+=Test("");
         //   s+=Test("a");
         //   s+=Test("abc");
         //   s+=Test("message digest");
         //   s+=Test("abcdefghijklmnopqrstuvwxyz");
         //   s+=Test("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789");
         //   s+=Test("12345678901234567890123456789012345678901234567890123456789012345678901234567890");
         //   return s;   
         //}
     }
}
 
迫不及待的试验之,发现仍然是对中文字符加密时,结果不正确,分析上面的代码发现问题所在,是写上边这段代码的同仁有一点小小的疏忽 : )
public static string MDString(string message)
{
     char[] c = message.ToCharArray();
     byte[] b = new byte[c.Length];
     for(int i=0;i<c.Length;i++)
     {b[i]=(byte)c[i];}
     byte[] digest = MD5Array(b);
     return ArrayToHexString(digest,false);
         }
问题就出现在这里,
因为一个汉字要占用两个2个byte的空间,一个char在C#中也是占用2个byte的空间。
for(int i=0;i<c.Length;i++)
{
b[i]=(byte)c[i];
}
看上边的代码,char转换为byte时候,只取了char的低字节,对于数字和英文字母低字节正好是
ANSI编码数值,因为数字和字母只占用1个byte。而对于汉字,将char转换为byte时候就丢失了一个byte,因此加密结果会出错。
于是笔者对上边的代码进行了修改,
public static string MDString(string message)
{
              Byte[] b=System.Text.Encoding.Default.GetBytes(message);
//ANSI编码
              byte[] digest = MD5Array(b);
              return ArrayToHexString(digest,false);
}
经这样一改,在网上搜到的那个C#实现的md5算法和原来用delphi实现的md5算法一样了,这是因为什么呢,因为widows操作系统默认的字符编码是ANSI。
那么System.Web.Security.FormsAuthentication.HashPasswordForStoringInConfigFile 函数的md5结果应该怎样解释呢?
于是笔者又写了下面的函数,
public static string MDStringEx(string message,System.Text.Encoding ed)
{
              Byte[] b=ed.GetBytes(message);
              byte[] digest = MD5Array(b);
              return ArrayToHexString(digest,false);
}
该函数指定了在进行md5加密时候对字符的编码方式。经过笔者试验,发现System.Web.Security.FormsAuthentication.HashPasswordForStoringInConfigFile对字符串进行md5加密时,对字符进行了UTF8编码。英文字母和数字的ANSI编码和UTF8编码是一样的,因此,对英文和数字进行md5加密的结果都一样。而对于有汉字的字符串
String s =汉字;
MDStringEx(s,System.Text.Encoding.Unicode);
System.Web.Security.FormsAuthentication.HashPasswordForStoringInConfigFile(s,MD5”);
结果是一样的。
这下子,一切都明白了:)
另外的收获
问题是解决了,但是笔者在想,难道.NET就没有提供比较通用的md5加密算法吗?呵呵,查找一番,笔者发现了
System.Security.Cryptography.MD5CryptoServiceProvider类,可以byte[]进行md5加密,只是对字符串加密时候使用起来不太方便,我们可以简单的写个函数方便使用。
public static string sysmd5(string input ,System.Text.Encoding ed)
{
              System.Security.Cryptography.MD5CryptoServiceProvider sysmd5 = new System.Security.Cryptography.MD5CryptoServiceProvider();
              byte[] bytes = ed.GetBytes(input);
              bytes = sysmd5.ComputeHash( bytes );
              sysmd5.Clear();
              string ret = "";
              for(int i=0 ; i<bytes.Length ; i++)
              {
                   ret += bytes[i].ToString("X2");
              }
              return ret;
}
下面是经笔者整理的md5算法单元代码如下
/*
 * zero 整理
 * 2007.2.18 旧历新年:)
 * http://blog.csdn.net/sxf_zero
 *
 */
 
 
using System;
using System.Collections;
using System.IO;
namespace mymd5
{
     public class MD5_OK
     {
         //static state variables
         private static UInt32 A;
         private static UInt32 B;
         private static UInt32 C;
         private static UInt32 D;
 
         //number of bits to rotate in tranforming
         private const int S11 = 7;
         private const int S12 = 12;
         private const int S13 = 17;
         private const int S14 = 22;
         private const int S21 = 5;
         private const int S22 = 9;
         private const int S23 = 14;
         private const int S24 = 20;
         private const int S31 = 4;
         private const int S32 = 11;
         private const int S33 = 16;
         private const int S34 = 23;
         private const int S41 = 6;
         private const int S42 = 10;
         private const int S43 = 15;
         private const int S44 = 21;
 
 
         /* F, G, H and I are basic MD5 functions.
          * 四个非线性函数:
          *
          * F(X,Y,Z) =(X&Y)|((~X)&Z)
          * G(X,Y,Z) =(X&Z)|(Y&(~Z))
          * H(X,Y,Z) =X^Y^Z
          * I(X,Y,Z)=Y^(X|(~Z))
          *
          * (&与,|或,~非,^异或)
          */
         private static UInt32 F(UInt32 x,UInt32 y,UInt32 z)
         {
              return (x&y)|((~x)&z);
         }
         private static UInt32 G(UInt32 x,UInt32 y,UInt32 z)
         {
              return (x&z)|(y&(~z));
         }
         private static UInt32 H(UInt32 x,UInt32 y,UInt32 z)
         {
              return x^y^z;
         }
         private static UInt32 I(UInt32 x,UInt32 y,UInt32 z)
         {
              return y^(x|(~z));
         }
 
         /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
          * Rotation is separate from addition to prevent recomputation.
          */
         private static void FF(ref UInt32 a,UInt32 b,UInt32 c,UInt32 d,UInt32 mj,int s,UInt32 ti)
         {
              a = a + F(b,c,d) + mj + ti;
              a = a << s | a >> (32-s);
              a += b;
         }
         private static void GG(ref UInt32 a,UInt32 b,UInt32 c,UInt32 d,UInt32 mj,int s,UInt32 ti)
         {
              a = a + G(b,c,d) + mj + ti;
              a = a << s | a >> (32-s);
              a += b;
         }
         private static void HH(ref UInt32 a,UInt32 b,UInt32 c,UInt32 d,UInt32 mj,int s,UInt32 ti)
         {
              a = a + H(b,c,d) + mj + ti;
              a = a << s | a >> (32-s);
              a += b;
         }
         private static void II(ref UInt32 a,UInt32 b,UInt32 c,UInt32 d,UInt32 mj,int s,UInt32 ti)
         {
              a = a + I(b,c,d) + mj + ti;
              a = a << s | a >> (32-s);
              a += b;
         }
 
         private static void MD5_Init()
         {
              A=0×67452301//in memory, this is 0×01234567
              B=0xefcdab89//in memory, this is 0×89abcdef
              C=0×98badcfe//in memory, this is 0xfedcba98
              D=0×10325476//in memory, this is 0×76543210
         }
 
         private static UInt32[] MD5_Append(byte[] input)
         {
              int zeros=0;
              int ones =1;
              int size=0;
              int n = input.Length;
              int m = n%64;
              if( m < 56 )
              {
                   zeros = 55-m;
                   size=n-m+64;
              }
              else if (m==56)
              {
                   zeros = 0;
                   ones = 0;
                   size=n+8;
              }
              else
              {
                   zeros = 63-m+56;
                   size=n+64-m+64;
              }
 
              ArrayList bs = new ArrayList(input);
              if(ones==1)
              {
                   bs.Add( (byte)0×80 ); // 0×80 = $10000000
              }
              for(int i=0;i<zeros;i++)
              {
                   bs.Add( (byte)0 );
              }
 
              UInt64 N = (UInt64) n * 8;
              byte h1=(byte)(N&0xFF);
              byte h2=(byte)((N>>8)&0xFF);
              byte h3=(byte)((N>>16)&0xFF);
              byte h4=(byte)((N>>24)&0xFF);
              byte h5=(byte)((N>>32)&0xFF);
              byte h6=(byte)((N>>40)&0xFF);
              byte h7=(byte)((N>>48)&0xFF);
              byte h8=(byte)(N>>56);
              bs.Add(h1);
              bs.Add(h2);
              bs.Add(h3);
              bs.Add(h4);
              bs.Add(h5);
              bs.Add(h6);
              bs.Add(h7);
              bs.Add(h8);
              byte[] ts=(byte[])bs.ToArray(typeof(byte));
 
              /* Decodes input (byte[]) into output (UInt32[]). Assumes len is
               * a multiple of 4.
               */
              UInt32[] output = new UInt32[size/4];
              for(Int64 i=0,j=0;i<size;j++,i+=4)
              {
                   output[j]=(UInt32)(ts[i] | ts[i+1]<<8 | ts[i+2]<<16 | ts[i+3]<<24);
              }
              return output;
         }
         private static UInt32[] MD5_Trasform(UInt32[] x)
         {
 
              UInt32 a,b,c,d;
 
              for(int k=0;k<x.Length;k+=16)
              {
                   a=A;
                   b=B;
                   c=C;
                   d=D;
   
                   /* Round 1 */
                   FF (ref a, b, c, d, x[k+ 0], S11, 0xd76aa478); /* 1 */
                   FF (ref d, a, b, c, x[k+ 1], S12, 0xe8c7b756); /* 2 */
                   FF (ref c, d, a, b, x[k+ 2], S13, 0×242070db); /* 3 */
                   FF (ref b, c, d, a, x[k+ 3], S14, 0xc1bdceee); /* 4 */
                   FF (ref a, b, c, d, x[k+ 4], S11, 0xf57c0faf); /* 5 */
                   FF (ref d, a, b, c, x[k+ 5], S12, 0×4787c62a); /* 6 */
                   FF (ref c, d, a, b, x[k+ 6], S13, 0xa8304613); /* 7 */
                   FF (ref b, c, d, a, x[k+ 7], S14, 0xfd469501); /* 8 */
                   FF (ref a, b, c, d, x[k+ 8], S11, 0×698098d8); /* 9 */
                   FF (ref d, a, b, c, x[k+ 9], S12, 0×8b44f7af); /* 10 */
                   FF (ref c, d, a, b, x[k+10], S13, 0xffff5bb1); /* 11 */
                   FF (ref b, c, d, a, x[k+11], S14, 0×895cd7be); /* 12 */
                   FF (ref a, b, c, d, x[k+12], S11, 0×6b901122); /* 13 */
                   FF (ref d, a, b, c, x[k+13], S12, 0xfd987193); /* 14 */
                   FF (ref c, d, a, b, x[k+14], S13, 0xa679438e); /* 15 */
                   FF (ref b, c, d, a, x[k+15], S14, 0×49b40821); /* 16 */
 
                   /* Round 2 */
                   GG (ref a, b, c, d, x[k+ 1], S21, 0xf61e2562); /* 17 */
                   GG (ref d, a, b, c, x[k+ 6], S22, 0xc040b340); /* 18 */
                   GG (ref c, d, a, b, x[k+11], S23, 0×265e5a51); /* 19 */
                   GG (ref b, c, d, a, x[k+ 0], S24, 0xe9b6c7aa); /* 20 */
                   GG (ref a, b, c, d, x[k+ 5], S21, 0xd62f105d); /* 21 */
                   GG (ref d, a, b, c, x[k+10], S22, 0×2441453); /* 22 */
                   GG (ref c, d, a, b, x[k+15], S23, 0xd8a1e681); /* 23 */
                   GG (ref b, c, d, a, x[k+ 4], S24, 0xe7d3fbc8); /* 24 */
                   GG (ref a, b, c, d, x[k+ 9], S21, 0×21e1cde6); /* 25 */
                   GG (ref d, a, b, c, x[k+14], S22, 0xc33707d6); /* 26 */
                   GG (ref c, d, a, b, x[k+ 3], S23, 0xf4d50d87); /* 27 */
                   GG (ref b, c, d, a, x[k+ 8], S24, 0×455a14ed); /* 28 */
                   GG (ref a, b, c, d, x[k+13], S21, 0xa9e3e905); /* 29 */
                   GG (ref d, a, b, c, x[k+ 2], S22, 0xfcefa3f8); /* 30 */
                   GG (ref c, d, a, b, x[k+ 7], S23, 0×676f02d9); /* 31 */
                   GG (ref b, c, d, a, x[k+12], S24, 0×8d2a4c8a); /* 32 */
 
                   /* Round 3 */
                   HH (ref a, b, c, d, x[k+ 5], S31, 0xfffa3942); /* 33 */
                   HH (ref d, a, b, c, x[k+ 8], S32, 0×8771f681); /* 34 */
                   HH (ref c, d, a, b, x[k+11], S33, 0×6d9d6122); /* 35 */
                   HH (ref b, c, d, a, x[k+14], S34, 0xfde5380c); /* 36 */
                   HH (ref a, b, c, d, x[k+ 1], S31, 0xa4beea44); /* 37 */
                   HH (ref d, a, b, c, x[k+ 4], S32, 0×4bdecfa9); /* 38 */
                   HH (ref c, d, a, b, x[k+ 7], S33, 0xf6bb4b60); /* 39 */
                   HH (ref b, c, d, a, x[k+10], S34, 0xbebfbc70); /* 40 */
                   HH (ref a, b, c, d, x[k+13], S31, 0×289b7ec6); /* 41 */
                   HH (ref d, a, b, c, x[k+ 0], S32, 0xeaa127fa); /* 42 */
                   HH (ref c, d, a, b, x[k+ 3], S33, 0xd4ef3085); /* 43 */
                   HH (ref b, c, d, a, x[k+ 6], S34, 0×4881d05); /* 44 */
                   HH (ref a, b, c, d, x[k+ 9], S31, 0xd9d4d039); /* 45 */
                   HH (ref d, a, b, c, x[k+12], S32, 0xe6db99e5); /* 46 */
                   HH (ref c, d, a, b, x[k+15], S33, 0×1fa27cf8); /* 47 */
                   HH (ref b, c, d, a, x[k+ 2], S34, 0xc4ac5665); /* 48 */
 
                   /* Round 4 */
                   II (ref a, b, c, d, x[k+ 0], S41, 0xf4292244); /* 49 */
                   II (ref d, a, b, c, x[k+ 7], S42, 0×432aff97); /* 50 */
                   II (ref c, d, a, b, x[k+14], S43, 0xab9423a7); /* 51 */
                   II (ref b, c, d, a, x[k+ 5], S44, 0xfc93a039); /* 52 */
                   II (ref a, b, c, d, x[k+12], S41, 0×655b59c3); /* 53 */
                   II (ref d, a, b, c, x[k+ 3], S42, 0×8f0ccc92); /* 54 */
                   II (ref c, d, a, b, x[k+10], S43, 0xffeff47d); /* 55 */
                   II (ref b, c, d, a, x[k+ 1], S44, 0×85845dd1); /* 56 */
                   II (ref a, b, c, d, x[k+ 8], S41, 0×6fa87e4f); /* 57 */
                   II (ref d, a, b, c, x[k+15], S42, 0xfe2ce6e0); /* 58 */
                   II (ref c, d, a, b, x[k+ 6], S43, 0xa3014314); /* 59 */
                   II (ref b, c, d, a, x[k+13], S44, 0×4e0811a1); /* 60 */
                   II (ref a, b, c, d, x[k+ 4], S41, 0xf7537e82); /* 61 */
                   II (ref d, a, b, c, x[k+11], S42, 0xbd3af235); /* 62 */
                   II (ref c, d, a, b, x[k+ 2], S43, 0×2ad7d2bb); /* 63 */
                   II (ref b, c, d, a, x[k+ 9], S44, 0xeb86d391); /* 64 */
 
                   A+=a;
                   B+=b;
                   C+=c;
                   D+=d;
              }
              return new UInt32[]{A,B,C,D};
         }
         public static byte[] MD5Array(byte[] input)
         {
              MD5_Init();
              UInt32[] block = MD5_Append(input);
              UInt32[] bits = MD5_Trasform(block);
 
              /* Encodes bits (UInt32[]) into output (byte[]). Assumes len is
               * a multiple of 4.
                    */
              byte[] output=new byte[bits.Length*4];
              for(int i=0,j=0;i<bits.Length;i++,j+=4)
              {
                   output[j] = (byte)(bits[i] & 0xff);
                   output[j+1] = (byte)((bits[i] >> 8) & 0xff);
                   output[j+2] = (byte)((bits[i] >> 16) & 0xff);
                   output[j+3] = (byte)((bits[i] >> 24) & 0xff);
              }
              return output;
         }
 
         public static string ArrayToHexString(byte[] array,bool uppercase)
         {
              string hexString="";
              string format="x2";
              if(uppercase)
              {
                   format="X2";
              }
              foreach(byte b in array)
              {
                   hexString += b.ToString(format);
              }
              return hexString;
         }
         /*BY ZERO QQ:30675682 EMAIL:sxf_zero@yahoo.com.cn*/
         public static string MDString(string message)
         {
    
              Byte[] b=System.Text.Encoding.Default.GetBytes(message);
              byte[] digest = MD5Array(b);
              return ArrayToHexString(digest,false);
         }
         /*BY ZERO QQ:30675682 EMAIL:sxf_zero@yahoo.com.cn*/
         public static string MDStringEx(string message,System.Text.Encoding ed)
         {
        
        
              Byte[] b=ed.GetBytes(message);
              byte[] digest = MD5Array(b);
              return ArrayToHexString(digest,false);
         }
 
         /*BY ZERO QQ:30675682 EMAIL:sxf_zero@yahoo.com.cn*/
         public static string sysmd5(string input ,System.Text.Encoding ed)
         {
              System.Security.Cryptography.MD5CryptoServiceProvider sysmd5 = new System.Security.Cryptography.MD5CryptoServiceProvider();
              byte[] bytes = ed.GetBytes(input);
              bytes = sysmd5.ComputeHash( bytes );
              sysmd5.Clear();
              string ret = "";
              for(int i=0 ; i<bytes.Length ; i++)
              {
                   ret += bytes[i].ToString("X2");
              }
              return ret;
         }
 
 
         //
 
         public static string MDFile(string fileName)
         {
              FileStream fs=File.Open(fileName,FileMode.Open,FileAccess.Read);
              byte[] array=new byte[fs.Length];
              fs.Read(array,0,(int)fs.Length);
              byte[] digest = MD5Array(array);
              fs.Close();
              return ArrayToHexString(digest,false);
         }
 
        
     }
}
 

md5算法

Posted By zero
Categorized Under: 记事本
Comments (0)

综述

  MD5的全称是message-digest algorithm 5(信息-摘要算法),在90年代初由mit laboratory for computer science和rsa data security inc的ronald l. rivest开发出来,经md2、md3和md4发展而来。它的作用是让大容量信息在用数字签名软件签署私人密匙前被”压缩”成一种保密的格式(就是把一个任意长度的字节串变换成一定长的大整数)。不管是md2、md4还是md5,它们都需要获得一个随机长度的信息并产生一个128位的信息摘要。虽然这些算法的结构或多或少有些相似,但md2的设计与md4和md5完全不同,那是因为md2是为8位机器做过设计优化的,而md4和md5却是面向32位的电脑。这三个算法的描述和c语言源代码在internet rfcs 1321中有详细的描述(http://www.ietf.org/rfc/rfc1321.txt),这是一份最权威的文档,由ronald l. rivest在1992年8月向ieft提交。

  rivest在1989年开发出md2算法。在这个算法中,首先对信息进行数据补位,使信息的字节长度是16的倍数。然后,以一个16位的检验和追加到信息末尾。并且根据这个新产生的信息计算出散列值。后来,rogier和chauvaud发现如果忽略了检验和将产生md2冲突。md2算法的加密后结果是唯一的–既没有重复。

  为了加强算法的安全性,rivest在1990年又开发出md4算法。md4算法同样需要填补信息以确保信息的字节长度加上448后能被512整除(信息字节长度mod 512 = 448)。然后,一个以64位二进制表示的信息的最初长度被添加进来。信息被处理成512位damg?rd/merkle迭代结构的区块,而且每个区块要通过三个不同步骤的处理。den boer和bosselaers以及其他人很快的发现了攻击md4版本中第一步和第三步的漏洞。dobbertin向大家演示了如何利用一部普通的个人电脑在几分钟内找到md4完整版本中的冲突(这个冲突实际上是一种漏洞,它将导致对不同的内容进行加密却可能得到相同的加密后结果)。毫无疑问,md4就此被淘汰掉了。

  尽管md4算法在安全上有个这么大的漏洞,但它对在其后才被开发出来的好几种信息安全加密算法的出现却有着不可忽视的引导作用。除了md5以外,其中比较有名的还有sha-1、ripe-md以及haval等。

  一年以后,即1991年,rivest开发出技术上更为趋近成熟的md5算法。它在md4的基础上增加了”安全-带子”(safety-belts)的概念。虽然md5比md4稍微慢一些,但却更为安全。这个算法很明显的由四个和md4设计有少许不同的步骤组成。在md5算法中,信息-摘要的大小和填充的必要条件与md4完全相同。den boer和bosselaers曾发现md5算法中的假冲突(pseudo-collisions),但除此之外就没有其他被发现的加密后结果了。

  van oorschot和wiener曾经考虑过一个在散列中暴力搜寻冲突的函数(brute-force hash function),而且他们猜测一个被设计专门用来搜索md5冲突的机器(这台机器在1994年的制造成本大约是一百万美元)可以平均每24天就找到一个冲突。但单从1991年到2001年这10年间,竟没有出现替代md5算法的md6或被叫做其他什么名字的新算法这一点,我们就可以看出这个瑕疵并没有太多的影响md5的安全性。上面所有这些都不足以成为md5的在实际应用中的问题。并且,由于md5算法的使用不需要支付任何版权费用的,所以在一般的情况下(非绝密应用领域。但即便是应用在绝密领域内,md5也不失为一种非常优秀的中间技术),md5怎么都应该算得上是非常安全的了。

  算法的应用

  md5的典型应用是对一段信息(message)产生信息摘要(message-digest),以防止被篡改。比如,在unix下有很多软件在下载的时候都有一个文件名相同,文件扩展名为.md5的文件,在这个文件中通常只有一行文本,大致结构如:

   md5 (tanajiya.tar.gz) = 0ca175b9c0f726a831d895e269332461

  这就是tanajiya.tar.gz文件的数字签名。md5将整个文件当作一个大文本信息,通过其不可逆的字符串变换算法,产生了这个唯一的md5信息摘要。如果在以后传播这个文件的过程中,无论文件的内容发生了任何形式的改变(包括人为修改或者下载过程中线路不稳定引起的传输错误等),只要你对这个文件重新计算md5时就会发现信息摘要不相同,由此可以确定你得到的只是一个不正确的文件。如果再有一个第三方的认证机构,用md5还可以防止文件作者的”抵赖”,这就是所谓的数字签名应用。

  md5还广泛用于加密和解密技术上。比如在unix系统中用户的密码就是以md5(或其它类似的算法)经加密后存储在文件系统中。当用户登录的时候,系统把用户输入的密码计算成md5值,然后再去和保存在文件系统中的md5值进行比较,进而确定输入的密码是否正确。通过这样的步骤,系统在并不知道用户密码的明码的情况下就可以确定用户登录系统的合法性。这不但可以避免用户的密码被具有系统管理员权限的用户知道,而且还在一定程度上增加了密码被破解的难度。

  正是因为这个原因,现在被黑客使用最多的一种破译密码的方法就是一种被称为”跑字典”的方法。有两种方法得到字典,一种是日常搜集的用做密码的字符串表,另一种是用排列组合方法生成的,先用md5程序计算出这些字典项的md5值,然后再用目标的md5值在这个字典中检索。我们假设密码的最大长度为8位字节(8 bytes),同时密码只能是字母和数字,共26+26+10=62个字符,排列组合出的字典的项数则是p(62,1)+p(62,2)….+p(62,8),那也已经是一个很天文的数字了,存储这个字典就需要tb级的磁盘阵列,而且这种方法还有一个前提,就是能获得目标账户的密码md5值的情况下才可以。这种加密技术被广泛的应用于unix系统中,这也是为什么unix系统比一般操作系统更为坚固一个重要原因。

  算法描述

  对md5算法简要的叙述可以为:md5以512位分组来处理输入的信息,且每一分组又被划分为16个32位子分组,经过了一系列的处理后,算法的输出由四个32位分组组成,将这四个32位分组级联后将生成一个128位散列值。

  在md5算法中,首先需要对信息进行填充,使其字节长度对512求余的结果等于448。因此,信息的字节长度(bits length)将被扩展至n*512+448,即n*64+56个字节(bytes),n为一个正整数。填充的方法如下,在信息的后面填充一个1和无数个0,直到满足上面的条件时才停止用0对信息的填充。然后,在在这个结果后面附加一个以64位二进制表示的填充前信息长度。经过这两步的处理,现在的信息字节长度=n*512+448+64=(n+1)*512,即长度恰好是512的整数倍。这样做的原因是为满足后面处理中对信息长度的要求。

  md5中有四个32位被称作链接变量(chaining variable)的整数参数,他们分别为:a=0×01234567,b=0×89abcdef,c=0xfedcba98,d=0×76543210。

  当设置好这四个链接变量后,就开始进入算法的四轮循环运算。循环的次数是信息中512位信息分组的数目。

  将上面四个链接变量复制到另外四个变量中:a到a,b到b,c到c,d到d。

  主循环有四轮(md4只有三轮),每轮循环都很相似。第一轮进行16次操作。每次操作对a、b、c和d中的其中三个作一次非线性函数运算,然后将所得结果加上第四个变量,文本的一个子分组和一个常数。再将所得结果向右环移一个不定的数,并加上a、b、c或d中之一。最后用该结果取代a、b、c或d中之一。
以一下是每次操作中用到的四个非线性函数(每轮一个)。

   f(x,y,z) =(x&y)|((~x)&z)
   g(x,y,z) =(x&z)|(y&(~z))
   h(x,y,z) =x^y^z
   i(x,y,z)=y^(x|(~z))
   (&是与,|是或,~是非,^是异或)

  这四个函数的说明:如果x、y和z的对应位是独立和均匀的,那么结果的每一位也应是独立和均匀的。
f是一个逐位运算的函数。即,如果x,那么y,否则z。函数h是逐位奇偶操作符。

  假设mj表示消息的第j个子分组(从0到15),
  << ff(a,b,c,d,mj,s,ti) 表示 a=b+((a+(f(b,c,d)+mj+ti)
  << gg(a,b,c,d,mj,s,ti) 表示 a=b+((a+(g(b,c,d)+mj+ti)
  << hh(a,b,c,d,mj,s,ti) 表示 a=b+((a+(h(b,c,d)+mj+ti)
  << ii(a,b,c,d,mj,s,ti) 表示 a=b+((a+(i(b,c,d)+mj+ti)
  << 这四轮(64步)是:

  第一轮

   ff(a,b,c,d,m0,7,0xd76aa478)
   ff(d,a,b,c,m1,12,0xe8c7b756)
   ff(c,d,a,b,m2,17,0×242070db)
   ff(b,c,d,a,m3,22,0xc1bdceee)
   ff(a,b,c,d,m4,7,0xf57c0faf)
   ff(d,a,b,c,m5,12,0×4787c62a)
   ff(c,d,a,b,m6,17,0xa8304613)
   ff(b,c,d,a,m7,22,0xfd469501)
   ff(a,b,c,d,m8,7,0×698098d8)
   ff(d,a,b,c,m9,12,0×8b44f7af)
   ff(c,d,a,b,m10,17,0xffff5bb1)
   ff(b,c,d,a,m11,22,0×895cd7be)
   ff(a,b,c,d,m12,7,0×6b901122)
   ff(d,a,b,c,m13,12,0xfd987193)
   ff(c,d,a,b,m14,17,0xa679438e)
   ff(b,c,d,a,m15,22,0×49b40821)

  第二轮

   gg(a,b,c,d,m1,5,0xf61e2562)
   gg(d,a,b,c,m6,9,0xc040b340)
   gg(c,d,a,b,m11,14,0×265e5a51)
   gg(b,c,d,a,m0,20,0xe9b6c7aa)
   gg(a,b,c,d,m5,5,0xd62f105d)
   gg(d,a,b,c,m10,9,0×02441453)
   gg(c,d,a,b,m15,14,0xd8a1e681)
   gg(b,c,d,a,m4,20,0xe7d3fbc8)
   gg(a,b,c,d,m9,5,0×21e1cde6)
   gg(d,a,b,c,m14,9,0xc33707d6)
   gg(c,d,a,b,m3,14,0xf4d50d87)
   gg(b,c,d,a,m8,20,0×455a14ed)
   gg(a,b,c,d,m13,5,0xa9e3e905)
   gg(d,a,b,c,m2,9,0xfcefa3f8)
   gg(c,d,a,b,m7,14,0×676f02d9)
   gg(b,c,d,a,m12,20,0×8d2a4c8a)

  第三轮

   hh(a,b,c,d,m5,4,0xfffa3942)
   hh(d,a,b,c,m8,11,0×8771f681)
   hh(c,d,a,b,m11,16,0×6d9d6122)
   hh(b,c,d,a,m14,23,0xfde5380c)
   hh(a,b,c,d,m1,4,0xa4beea44)
   hh(d,a,b,c,m4,11,0×4bdecfa9)
   hh(c,d,a,b,m7,16,0xf6bb4b60)
   hh(b,c,d,a,m10,23,0xbebfbc70)
   hh(a,b,c,d,m13,4,0×289b7ec6)
   hh(d,a,b,c,m0,11,0xeaa127fa)
   hh(c,d,a,b,m3,16,0xd4ef3085)
   hh(b,c,d,a,m6,23,0×04881d05)
   hh(a,b,c,d,m9,4,0xd9d4d039)
   hh(d,a,b,c,m12,11,0xe6db99e5)
   hh(c,d,a,b,m15,16,0×1fa27cf8)
   hh(b,c,d,a,m2,23,0xc4ac5665)

  第四轮

   ii(a,b,c,d,m0,6,0xf4292244)
   ii(d,a,b,c,m7,10,0×432aff97)
   ii(c,d,a,b,m14,15,0xab9423a7)
   ii(b,c,d,a,m5,21,0xfc93a039)
   ii(a,b,c,d,m12,6,0×655b59c3)
   ii(d,a,b,c,m3,10,0×8f0ccc92)
   ii(c,d,a,b,m10,15,0xffeff47d)
   ii(b,c,d,a,m1,21,0×85845dd1)
   ii(a,b,c,d,m8,6,0×6fa87e4f)
   ii(d,a,b,c,m15,10,0xfe2ce6e0)
   ii(c,d,a,b,m6,15,0xa3014314)
   ii(b,c,d,a,m13,21,0×4e0811a1)
   ii(a,b,c,d,m4,6,0xf7537e82)
   ii(d,a,b,c,m11,10,0xbd3af235)
   ii(c,d,a,b,m2,15,0×2ad7d2bb)
   ii(b,c,d,a,m9,21,0xeb86d391)

  常数ti可以如下选择:

  在第i步中,ti是4294967296*abs(sin(i))的整数部分,i的单位是弧度。(4294967296等于2的32次方)
所有这些完成之后,将a、b、c、d分别加上a、b、c、d。然后用下一分组数据继续运行算法,最后的输出是a、b、c和d的级联。

  当你按照我上面所说的方法实现md5算法以后,你可以用以下几个信息对你做出来的程序作一个简单的测试,看看程序有没有错误。

   md5 (“”) = d41d8cd98f00b204e9800998ecf8427e
   md5 (“a”) = 0cc175b9c0f1b6a831c399e269772661
   md5 (“abc”) = 900150983cd24fb0d6963f7d28e17f72
   md5 (“message digest”) = f96b697d7cb7938d525a2f31aaf161d0
   md5 (“abcdefghijklmnopqrstuvwxyz”) = c3fcd3d76192e4007dfb496cca67e13b
   md5 (“abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz0123456789″) = d174ab98d277d9f5a5611c2c9f419d9f
   md5 (“12345678901234567890123456789012345678901234567890123456789012345678901234567890″) = 57edf4a22be3c955ac49da2e2107b67a

  如果你用上面的信息分别对你做的md5算法实例做测试,最后得出的结论和标准答案完全一样,那我就要在这里象你道一声祝贺了。要知道,我的程序在第一次编译成功的时候是没有得出和上面相同的结果的。


  MD5的安全性

  md5相对md4所作的改进:

   1. 增加了第四轮;

   2. 每一步均有唯一的加法常数;

   3. 为减弱第二轮中函数g的对称性从(x&y)|(x&z)|(y&z)变为(x&z)|(y&(~z));

   4. 第一步加上了上一步的结果,这将引起更快的雪崩效应;

   5. 改变了第二轮和第三轮中访问消息子分组的次序,使其更不相似;

   6. 近似优化了每一轮中的循环左移位移量以实现更快的雪崩效应。各轮的位移量互不相同。

当最后一个网段也ping通了

Posted By zero
Categorized Under: 心情记事
Comments (0)

当防火墙配置完毕,当路由维护完毕,当所有三层交换机配置完毕,当所有的vlan都通了以后.
成就感油然而生.
初次接触防火墙交换机路由路由的配置,没有经验,没有人指点,独自一人看着过于简单的操作手册,上网不断
baidu,google着自己也不知道正确与否的参考资料,一次次的尝试,一次次的失败,几日的辗转反侧,在梦中都在ping着某个地址.
today,终于通了…..