一段js MD5。加密转换C#语法过程

A 帮忙把这段js脚本转换 c#语言.

JS:

 function md5 (bit,sMessage) {debugger
    //var sMessage = this;
    function RotateLeft(lValue, iShiftBits) { return (lValue << iShiftBits) | (lValue >>> (32 - iShiftBits)); }
    function AddUnsigned(lX, lY) {
        var lX4, lY4, lX8, lY8, lResult;
        lX8 = (lX & 0x80000000);
        lY8 = (lY & 0x80000000);
        lX4 = (lX & 0x40000000);
        lY4 = (lY & 0x40000000);
        lResult = (lX & 0x3FFFFFFF) + (lY & 0x3FFFFFFF);
        if (lX4 & lY4) return (lResult ^ 0x80000000 ^ lX8 ^ lY8);
        if (lX4 | lY4) {
            if (lResult & 0x40000000) return (lResult ^ 0xC0000000 ^ lX8 ^ lY8);
            else return (lResult ^ 0x40000000 ^ lX8 ^ lY8);
        } else return (lResult ^ lX8 ^ lY8);
    }
    function F(x, y, z) { return (x & y) | ((~x) & z); }
    function G(x, y, z) { return (x & z) | (y & (~z)); }
    function H(x, y, z) { return (x ^ y ^ z); }
    function I(x, y, z) { return (y ^ (x | (~z))); }
    function FF(a, b, c, d, x, s, ac) {
        a = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac));
        return AddUnsigned(RotateLeft(a, s), b);
    }
    function GG(a, b, c, d, x, s, ac) {
        a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d), x), ac));
        return AddUnsigned(RotateLeft(a, s), b);
    }
    function HH(a, b, c, d, x, s, ac) {
        a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac));
        return AddUnsigned(RotateLeft(a, s), b);
    }
    function II(a, b, c, d, x, s, ac) {
        a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac));
        return AddUnsigned(RotateLeft(a, s), b);
    }
    function ConvertToWordArray(sMessage) {
        var lWordCount;
        var lMessageLength = sMessage.length;
        var lNumberOfWords_temp1 = lMessageLength + 8;
        var lNumberOfWords_temp2 = (lNumberOfWords_temp1 - (lNumberOfWords_temp1 % 64)) / 64;
        var lNumberOfWords = (lNumberOfWords_temp2 + 1) * 16;
        var lWordArray = Array(lNumberOfWords - 1);
        var lBytePosition = 0;
        var lByteCount = 0;
        while (lByteCount < lMessageLength) {
            lWordCount = (lByteCount - (lByteCount % 4)) / 4;
            lBytePosition = (lByteCount % 4) * 8;
            lWordArray[lWordCount] = (  lWordArray[lWordCount] | (sMessage.charCodeAt(lByteCount) << lBytePosition));
            lByteCount++;
        }
        lWordCount = (lByteCount - (lByteCount % 4)) / 4;
        lBytePosition = (lByteCount % 4) * 8;
        lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80 << lBytePosition);
        lWordArray[lNumberOfWords - 2] = lMessageLength << 3;
        lWordArray[lNumberOfWords - 1] = lMessageLength >>> 29;
        return lWordArray;
    }
    function WordToHex(lValue) {
        var WordToHexValue = "", WordToHexValue_temp = "", lByte, lCount;
        for (lCount = 0; lCount <= 3; lCount++) {
            lByte = (lValue >>> (lCount * 8)) & 255;
            WordToHexValue_temp = "0" + lByte.toString(16);
            WordToHexValue = WordToHexValue + WordToHexValue_temp.substr(WordToHexValue_temp.length - 2, 2);
        }
        return WordToHexValue;
    }
    debugger
    var x = Array();
    var k, AA, BB, CC, DD, a, b, c, d
    var S11 = 7, S12 = 12, S13 = 17, S14 = 22;
    var S21 = 5, S22 = 9, S23 = 14, S24 = 20;
    var S31 = 4, S32 = 11, S33 = 16, S34 = 23;
    var S41 = 6, S42 = 10, S43 = 15, S44 = 21;
    // Steps 1 and 2. Append padding bits and length and convert to words
    x = ConvertToWordArray(sMessage);
    // Step 3. Initialise
    a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476;
    // Step 4. Process the message in 16-word blocks
    for (k = 0; k < x.length; k += 16) {
        AA = a; BB = b; CC = c; DD = d;
        a = FF(a, b, c, d, x[k + 0], S11, 0xD76AA478);
        d = FF(d, a, b, c, x[k + 1], S12, 0xE8C7B756);
        c = FF(c, d, a, b, x[k + 2], S13, 0x242070DB);
        b = FF(b, c, d, a, x[k + 3], S14, 0xC1BDCEEE);
        a = FF(a, b, c, d, x[k + 4], S11, 0xF57C0FAF);
        d = FF(d, a, b, c, x[k + 5], S12, 0x4787C62A);
        c = FF(c, d, a, b, x[k + 6], S13, 0xA8304613);
        b = FF(b, c, d, a, x[k + 7], S14, 0xFD469501);
        a = FF(a, b, c, d, x[k + 8], S11, 0x698098D8);
        d = FF(d, a, b, c, x[k + 9], S12, 0x8B44F7AF);
        c = FF(c, d, a, b, x[k + 10], S13, 0xFFFF5BB1);
        b = FF(b, c, d, a, x[k + 11], S14, 0x895CD7BE);
        a = FF(a, b, c, d, x[k + 12], S11, 0x6B901122);
        d = FF(d, a, b, c, x[k + 13], S12, 0xFD987193);
        c = FF(c, d, a, b, x[k + 14], S13, 0xA679438E);
        b = FF(b, c, d, a, x[k + 15], S14, 0x49B40821);
        a = GG(a, b, c, d, x[k + 1], S21, 0xF61E2562);
        d = GG(d, a, b, c, x[k + 6], S22, 0xC040B340);
        c = GG(c, d, a, b, x[k + 11], S23, 0x265E5A51);
        b = GG(b, c, d, a, x[k + 0], S24, 0xE9B6C7AA);
        a = GG(a, b, c, d, x[k + 5], S21, 0xD62F105D);
        d = GG(d, a, b, c, x[k + 10], S22, 0x2441453);
        c = GG(c, d, a, b, x[k + 15], S23, 0xD8A1E681);
        b = GG(b, c, d, a, x[k + 4], S24, 0xE7D3FBC8);
        a = GG(a, b, c, d, x[k + 9], S21, 0x21E1CDE6);
        d = GG(d, a, b, c, x[k + 14], S22, 0xC33707D6);
        c = GG(c, d, a, b, x[k + 3], S23, 0xF4D50D87);
        b = GG(b, c, d, a, x[k + 8], S24, 0x455A14ED);
        a = GG(a, b, c, d, x[k + 13], S21, 0xA9E3E905);
        d = GG(d, a, b, c, x[k + 2], S22, 0xFCEFA3F8);
        c = GG(c, d, a, b, x[k + 7], S23, 0x676F02D9);
        b = GG(b, c, d, a, x[k + 12], S24, 0x8D2A4C8A);
        a = HH(a, b, c, d, x[k + 5], S31, 0xFFFA3942);
        d = HH(d, a, b, c, x[k + 8], S32, 0x8771F681);
        c = HH(c, d, a, b, x[k + 11], S33, 0x6D9D6122);
        b = HH(b, c, d, a, x[k + 14], S34, 0xFDE5380C);
        a = HH(a, b, c, d, x[k + 1], S31, 0xA4BEEA44);
        d = HH(d, a, b, c, x[k + 4], S32, 0x4BDECFA9);
        c = HH(c, d, a, b, x[k + 7], S33, 0xF6BB4B60);
        b = HH(b, c, d, a, x[k + 10], S34, 0xBEBFBC70);
        a = HH(a, b, c, d, x[k + 13], S31, 0x289B7EC6);
        d = HH(d, a, b, c, x[k + 0], S32, 0xEAA127FA);
        c = HH(c, d, a, b, x[k + 3], S33, 0xD4EF3085);
        b = HH(b, c, d, a, x[k + 6], S34, 0x4881D05);
        a = HH(a, b, c, d, x[k + 9], S31, 0xD9D4D039);
        d = HH(d, a, b, c, x[k + 12], S32, 0xE6DB99E5);
        c = HH(c, d, a, b, x[k + 15], S33, 0x1FA27CF8);
        b = HH(b, c, d, a, x[k + 2], S34, 0xC4AC5665);
        a = II(a, b, c, d, x[k + 0], S41, 0xF4292244);
        d = II(d, a, b, c, x[k + 7], S42, 0x432AFF97);
        c = II(c, d, a, b, x[k + 14], S43, 0xAB9423A7);
        b = II(b, c, d, a, x[k + 5], S44, 0xFC93A039);
        a = II(a, b, c, d, x[k + 12], S41, 0x655B59C3);
        d = II(d, a, b, c, x[k + 3], S42, 0x8F0CCC92);
        c = II(c, d, a, b, x[k + 10], S43, 0xFFEFF47D);
        b = II(b, c, d, a, x[k + 1], S44, 0x85845DD1);
        a = II(a, b, c, d, x[k + 8], S41, 0x6FA87E4F);
        d = II(d, a, b, c, x[k + 15], S42, 0xFE2CE6E0);
        c = II(c, d, a, b, x[k + 6], S43, 0xA3014314);
        b = II(b, c, d, a, x[k + 13], S44, 0x4E0811A1);
        a = II(a, b, c, d, x[k + 4], S41, 0xF7537E82);
        d = II(d, a, b, c, x[k + 11], S42, 0xBD3AF235);
        c = II(c, d, a, b, x[k + 2], S43, 0x2AD7D2BB);
        b = II(b, c, d, a, x[k + 9], S44, 0xEB86D391);
        a = AddUnsigned(a, AA); b = AddUnsigned(b, BB); c = AddUnsigned(c, CC); d = AddUnsigned(d, DD);
    }
    if (bit == 32) {
        return WordToHex(a) + WordToHex(b) + WordToHex(c) + WordToHex(d);
    }
    else {
        return WordToHex(b) + WordToHex(c);
    }
}

开始一看都是 &，^，>> 16进制头晕。中间想过 c# 执行js http://www.voidcn.com/article/p-aydnjind-be.html 后面老大说方案不通过。只能翻译了。

过程：

第一步：内心思考有没有JavaScript转换c#的在线工具一搜发现http://www.m2h.nl/files/js_to_c.php

第二步：工具也不能完全修正有些语法 JavaScript存在 c#不存在的，只能人工修改错误了。

第3步：js参数在c#是需要类型的统一 dynamic 动态编译运行。参数问题解决。

第4步：c#不存在>>>无符号运行符号

对应的c#代码：

            /// <summary>
            /// 无符号右移，与JS中的>>>等价
            /// </summary>
            /// <param name="x">要移位的数</param>
            /// <param name="y">移位数</param>
            /// <returns></returns>
            private static dynamic UIntMoveRight(dynamic x, dynamic y)
            {
                dynamic mask = 0x7fffffff; //Integer.MAX_VALUE
                for (dynamic i = ; i < y; i++)
                {
                    x >>= ;
                    x &= mask;
                }
                return x;
            }

第5步：c#不存在 CharCodeAt https://stackoverflow.com/questions/22550825/what-is-the-charcodeat-equivalent-in-c

            /// <summary>
            /// js charCodeAt=>c#
            /// </summary>
            /// <param name="inpString"> </param>
            /// <param name="index"></param>
            /// <returns></returns>
            private static string CharCodeAt(string inpString,int index)
            {
                string outString = "";
                for (var i = ; i < inpString.Length; i++)
                {
                    if (i==index)
                    {
                        outString = ((int)inpString[i]).ToString();
                        break;
                    }
                }
                return outString;
            }

剩下的 js的Array对应c#ArrayList 申明的是初始化长度所以值赋值o；(js中不需要)， lX4 & lY4修改（lX4 & lY4）!=0，length 大小写问题等等

最终版本

using System;
using System.CodeDom.Compiler;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Reflection;
using System.Security.Cryptography;
using System.Text;
using System.Threading.Tasks;
using Jint;
 
namespace ConsoleApp1
{
    class Program
    {
        static void Main(string[] args)
        {
            md5CS ms = new md5CS();
            var sss = ms.md5(, "dfdfddddfffff#$%%^111113333");
 
            Console.WriteLine(sss);
            Console.ReadKey();
        }
 
        public class md5CS
        {
            public dynamic md5(dynamic bit, dynamic sMessage)
            {
 
                dynamic RotateLeft(dynamic lValue, dynamic iShiftBits)
                {
                    return (lValue << iShiftBits) | UIntMoveRight(lValue,  - iShiftBits);
                }
 
                dynamic AddUnsigned(dynamic lX, dynamic lY)
                {
                    dynamic lX8 = (lX & 0x80000000);
                    dynamic lY8 = (lY & 0x80000000);
                    dynamic lX4 = (lX & 0x40000000);
                    dynamic lY4 = (lY & 0x40000000);
                    dynamic lResult = (lX & 0x3FFFFFFF) + (lY & 0x3FFFFFFF);
                    if ((lX4 & lY4) != ) return (lResult ^ 0x80000000 ^ lX8 ^ lY8);
                    if ((lX4 | lY4) != )
                    {
                        if ((lResult & 0x40000000) != ) return (lResult ^ 0xC0000000 ^ lX8 ^ lY8);
                        else return (lResult ^ 0x40000000 ^ lX8 ^ lY8);
                    }
                    else return (lResult ^ lX8 ^ lY8);
                }
 
                dynamic F(dynamic xx, dynamic y, dynamic z)
                {
                    return (xx & y) | ((~xx) & z);
                }
 
                dynamic G(dynamic xx, dynamic y, dynamic z)
                {
                    return (xx & z) | (y & (~z));
                }
 
                dynamic H(dynamic xx, dynamic y, dynamic z)
                {
                    return (xx ^ y ^ z);
                }
 
                dynamic I(dynamic xx, dynamic y, dynamic z)
                {
                    return (y ^ (xx | (~z)));
                }
 
                dynamic FF(dynamic a, dynamic b, dynamic c, dynamic d, dynamic x, dynamic s, dynamic ac)
                {
                    var ax = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac));
                    return AddUnsigned(RotateLeft(ax, s), b);
                }
 
                dynamic GG(dynamic a, dynamic b, dynamic c, dynamic d, dynamic x, dynamic s, dynamic ac)
                {
                    a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d), x), ac));
                    return AddUnsigned(RotateLeft(a, s), b);
                }
 
                dynamic HH(dynamic a, dynamic b, dynamic c, dynamic d, dynamic x, dynamic s, dynamic ac)
                {
                    a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac));
                    return AddUnsigned(RotateLeft(a, s), b);
                }
 
                dynamic II(dynamic a, dynamic b, dynamic c, dynamic d, dynamic x, dynamic s, dynamic ac)
                {
                    a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac));
                    return AddUnsigned(RotateLeft(a, s), b);
                }
 
                ArrayList ConvertToWordArray(string sMessagex)
                {
                    dynamic lWordCount;
                    var lMessageLength = sMessagex.Length;
                    var lNumberOfWords_temp1 = lMessageLength + ;
                    var lNumberOfWords_temp2 = (lNumberOfWords_temp1 - (lNumberOfWords_temp1 % )) / ;
                    var lNumberOfWords = (lNumberOfWords_temp2 + ) * ;
                    //js ArrayList
                    //var lWordArray = Array(lNumberOfWords - 1);
                    //Array转换ArrayList 默认需要全部赋值0
                    var lWordArray = new ArrayList(lNumberOfWords - );
                    for (int i = ; i < lNumberOfWords; i++)
                    {
                        lWordArray.Add();
                    }
                    dynamic lBytePosition = ;
                    dynamic lByteCount = ;
                    while (lByteCount < lMessageLength)
                    {
                        lWordCount = (lByteCount - (lByteCount % )) / ;
                        lBytePosition = (lByteCount % ) * ;
                        var lWordArrayValue = ;
                        if (lWordArray.Count > )
                        {
                            lWordArrayValue = lWordArray[lWordCount];
                        }
                        //Unicode 编码
                        var CharCodeAtx = int.Parse(CharCodeAt(sMessagex, lByteCount));
                        var tempValue = lWordArrayValue | (CharCodeAtx << lBytePosition);
                        lWordArray[lWordCount] = tempValue;
                        //js charCodeAt=》CharCodeAt
                        //lWordArray[lWordCount] = (lWordArray[lWordCount] | (sMessage.charCodeAt(lByteCount) << lBytePosition));
                        lByteCount++;
                    }
 
                    lWordCount = (lByteCount - (lByteCount % )) / ;
                    lBytePosition = (lByteCount % ) * ;
                    lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80 << lBytePosition);
                    //倒数第2位
                    lWordArray[lNumberOfWords - ] = lMessageLength << ;
                    //数组最后一位
                    lWordArray[lNumberOfWords - ] = UIntMoveRight(lMessageLength, );
                    return lWordArray;
                }
 
                string WordToHex(dynamic lValue)
                {
                    string WordToHexValue = "", WordToHexValue_temp = "";
                    dynamic lCount;
                    for (lCount = ; lCount <= ; lCount++)
                    {
                        dynamic lByte = UIntMoveRight(lValue, lCount * ) & ;
 
                        WordToHexValue_temp = "" + Convert.ToString(lByte, );
                        //WordToHexValue_temp = "0" + lByte.ToString(16);
                        //js substr=>Substring
                        WordToHexValue = WordToHexValue +
                                         WordToHexValue_temp.Substring(WordToHexValue_temp.Length - , );
                    }
 
                    return WordToHexValue;
                }
 
                var arrList = new ArrayList();
 
                dynamic k, AA, BB, CC, DD;
                dynamic S11 = , S12 = , S13 = , S14 = ;
                dynamic S21 = , S22 = , S23 = , S24 = ;
                dynamic S31 = , S32 = , S33 = , S34 = ;
                dynamic S41 = , S42 = , S43 = , S44 = ;
                // Steps 1 and 2. Append padding bits and length and convert to words
                arrList = ConvertToWordArray(sMessage);
                // Step 3. Initialise
                dynamic aa = 0x67452301;
                dynamic bb = 0xEFCDAB89;
                dynamic cc = 0x98BADCFE;
                dynamic dd = 0x10325476;
                // Step 4. Process the message in 16-word blocks
                for (k = ; k < arrList.Count; k += )
                {
                    AA = aa;
                    BB = bb;
                    CC = cc;
                    DD = dd;
                    aa = FF(aa, bb, cc, dd, arrList[k + ], S11, 0xD76AA478);
                    dd = FF(dd, aa, bb, cc, arrList[k + ], S12, 0xE8C7B756);
                    cc = FF(cc, dd, aa, bb, arrList[k + ], S13, 0x242070DB);
                    bb = FF(bb, cc, dd, aa, arrList[k + ], S14, 0xC1BDCEEE);
                    aa = FF(aa, bb, cc, dd, arrList[k + ], S11, 0xF57C0FAF);
                    dd = FF(dd, aa, bb, cc, arrList[k + ], S12, 0x4787C62A);
                    cc = FF(cc, dd, aa, bb, arrList[k + ], S13, 0xA8304613);
                    bb = FF(bb, cc, dd, aa, arrList[k + ], S14, 0xFD469501);
                    aa = FF(aa, bb, cc, dd, arrList[k + ], S11, 0x698098D8);
                    dd = FF(dd, aa, bb, cc, arrList[k + ], S12, 0x8B44F7AF);
                    cc = FF(cc, dd, aa, bb, arrList[k + ], S13, 0xFFFF5BB1);
                    bb = FF(bb, cc, dd, aa, arrList[k + ], S14, 0x895CD7BE);
                    aa = FF(aa, bb, cc, dd, arrList[k + ], S11, 0x6B901122);
                    dd = FF(dd, aa, bb, cc, arrList[k + ], S12, 0xFD987193);
                    cc = FF(cc, dd, aa, bb, arrList[k + ], S13, 0xA679438E);
                    bb = FF(bb, cc, dd, aa, arrList[k + ], S14, 0x49B40821);
                    aa = GG(aa, bb, cc, dd, arrList[k + ], S21, 0xF61E2562);
                    dd = GG(dd, aa, bb, cc, arrList[k + ], S22, 0xC040B340);
                    cc = GG(cc, dd, aa, bb, arrList[k + ], S23, 0x265E5A51);
                    bb = GG(bb, cc, dd, aa, arrList[k + ], S24, 0xE9B6C7AA);
                    aa = GG(aa, bb, cc, dd, arrList[k + ], S21, 0xD62F105D);
                    dd = GG(dd, aa, bb, cc, arrList[k + ], S22, 0x2441453);
                    cc = GG(cc, dd, aa, bb, arrList[k + ], S23, 0xD8A1E681);
                    bb = GG(bb, cc, dd, aa, arrList[k + ], S24, 0xE7D3FBC8);
                    aa = GG(aa, bb, cc, dd, arrList[k + ], S21, 0x21E1CDE6);
                    dd = GG(dd, aa, bb, cc, arrList[k + ], S22, 0xC33707D6);
                    cc = GG(cc, dd, aa, bb, arrList[k + ], S23, 0xF4D50D87);
                    bb = GG(bb, cc, dd, aa, arrList[k + ], S24, 0x455A14ED);
                    aa = GG(aa, bb, cc, dd, arrList[k + ], S21, 0xA9E3E905);
                    dd = GG(dd, aa, bb, cc, arrList[k + ], S22, 0xFCEFA3F8);
                    cc = GG(cc, dd, aa, bb, arrList[k + ], S23, 0x676F02D9);
                    bb = GG(bb, cc, dd, aa, arrList[k + ], S24, 0x8D2A4C8A);
                    aa = HH(aa, bb, cc, dd, arrList[k + ], S31, 0xFFFA3942);
                    dd = HH(dd, aa, bb, cc, arrList[k + ], S32, 0x8771F681);
                    cc = HH(cc, dd, aa, bb, arrList[k + ], S33, 0x6D9D6122);
                    bb = HH(bb, cc, dd, aa, arrList[k + ], S34, 0xFDE5380C);
                    aa = HH(aa, bb, cc, dd, arrList[k + ], S31, 0xA4BEEA44);
                    dd = HH(dd, aa, bb, cc, arrList[k + ], S32, 0x4BDECFA9);
                    cc = HH(cc, dd, aa, bb, arrList[k + ], S33, 0xF6BB4B60);
                    bb = HH(bb, cc, dd, aa, arrList[k + ], S34, 0xBEBFBC70);
                    aa = HH(aa, bb, cc, dd, arrList[k + ], S31, 0x289B7EC6);
                    dd = HH(dd, aa, bb, cc, arrList[k + ], S32, 0xEAA127FA);
                    cc = HH(cc, dd, aa, bb, arrList[k + ], S33, 0xD4EF3085);
                    bb = HH(bb, cc, dd, aa, arrList[k + ], S34, 0x4881D05);
                    aa = HH(aa, bb, cc, dd, arrList[k + ], S31, 0xD9D4D039);
                    dd = HH(dd, aa, bb, cc, arrList[k + ], S32, 0xE6DB99E5);
                    cc = HH(cc, dd, aa, bb, arrList[k + ], S33, 0x1FA27CF8);
                    bb = HH(bb, cc, dd, aa, arrList[k + ], S34, 0xC4AC5665);
                    aa = II(aa, bb, cc, dd, arrList[k + ], S41, 0xF4292244);
                    dd = II(dd, aa, bb, cc, arrList[k + ], S42, 0x432AFF97);
                    cc = II(cc, dd, aa, bb, arrList[k + ], S43, 0xAB9423A7);
                    bb = II(bb, cc, dd, aa, arrList[k + ], S44, 0xFC93A039);
                    aa = II(aa, bb, cc, dd, arrList[k + ], S41, 0x655B59C3);
                    dd = II(dd, aa, bb, cc, arrList[k + ], S42, 0x8F0CCC92);
                    cc = II(cc, dd, aa, bb, arrList[k + ], S43, 0xFFEFF47D);
                    bb = II(bb, cc, dd, aa, arrList[k + ], S44, 0x85845DD1);
                    aa = II(aa, bb, cc, dd, arrList[k + ], S41, 0x6FA87E4F);
                    dd = II(dd, aa, bb, cc, arrList[k + ], S42, 0xFE2CE6E0);
                    cc = II(cc, dd, aa, bb, arrList[k + ], S43, 0xA3014314);
                    bb = II(bb, cc, dd, aa, arrList[k + ], S44, 0x4E0811A1);
                    aa = II(aa, bb, cc, dd, arrList[k + ], S41, 0xF7537E82);
                    dd = II(dd, aa, bb, cc, arrList[k + ], S42, 0xBD3AF235);
                    cc = II(cc, dd, aa, bb, arrList[k + ], S43, 0x2AD7D2BB);
                    bb = II(bb, cc, dd, aa, arrList[k + ], S44, 0xEB86D391);
                    aa = AddUnsigned(aa, AA);
                    bb = AddUnsigned(bb, BB);
                    cc = AddUnsigned(cc, CC);
                    dd = AddUnsigned(dd, DD);
                }
                if (bit == )
                {
                    return WordToHex(aa) + WordToHex(bb) + WordToHex(cc) + WordToHex(dd);
                }
                else
                {
                    return WordToHex(bb) + WordToHex(cc);
                }
            }
 
            /// <summary>
            /// 无符号右移，与JS中的>>>等价
            /// </summary>
            /// <param name="x">要移位的数</param>
            /// <param name="y">移位数</param>
            /// <returns></returns>
            private static dynamic UIntMoveRight(dynamic x, dynamic y)
            {
                dynamic mask = 0x7fffffff; //Integer.MAX_VALUE
                for (dynamic i = ; i < y; i++)
                {
                    x >>= ;
                    x &= mask;
                }
                return x;
            }
 
            /// <summary>
            /// js charCodeAt=>c#
            /// </summary>
            /// <param name="inpString"> </param>
            /// <param name="index"></param>
            /// <returns></returns>
            private static string CharCodeAt(string inpString,int index)
            {
                string outString = "";
                for (var i = ; i < inpString.Length; i++)
                {
                    if (i==index)
                    {
                        outString = ((int)inpString[i]).ToString();
                        break;
                    }
                }
                return outString;
            }
        }
 
    }
}

大部分修改的都保留了原来的js注释。中间过程运行看结果发现值不对一步一步调试 c#调试到，js就调试到那一步一步确保每一步的值都相同。在调试过程找问题那个变量值不对。慢慢修正。

一段js MD5。加密转换C#语法过程的更多相关文章

js MD5加密后的字符串
js MD5加密后的字符串 <script language="JavaScript"> /************************************** ...
Java和JS MD5加密-附盐值加密demo
JAVA和JS的MD5加密经过测试:字母和数据好使,中文不好使. 源码如下: ** * 类MD5Util.java的实现描述: * */public class MD5Util { // 获得MD5 ...
js MD5加密与 java MD5加密不一致
因为该项目会部署到多台机器,所以需要用字符生成唯一的MD5,但是js生成的MD5和java生成的MD5不一致.经过博主查阅资料发现java生成MD5用的是utf-8的编码,而且js用的是2进制.那我就 ...
js MD5加密处理
关于MD5: MD5.js是通过前台js加密的方式对用户信息,密码等私密信息进行加密处理的工具,也可称为插件. 在本案例中可以看到MD5共有6种加密方法: 1, hex_md5(value) 2, ...
sql 根据指定条件获取一个字段批量获取数据插入另外一张表字段中+MD5加密
/****** Object: StoredProcedure [dbo].[getSplitValue] Script Date: 03/13/2014 13:58:12 ******/ SET A ...
用js md5加密
/* * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message * Digest Algorithm, as d ...
jQuery的md5加密插件及其它js md5加密代码
/** * jQuery MD5 hash algorithm function * * <code> * Calculate the md5 hash of a String * Str ...
js和java MD5加密
项目中用到js MD5加密和后台java MD5加密,刚开始加密后两个不一致,网上找了好久终于找到一个啦,记下来: md5.js /* * A JavaScript implementation of ...
C# js asp.net 字符串MD5加密GetMD5Hash
赵小虎老师 using System; using System.Collections.Generic; using System.Linq; using System.Text; using Sy ...

随机推荐

python 笔记二
17.进程线程进程间通信方式:管道Pipe:队列Queue:共享内存Value.Array.Manager: 多进程同步:锁Lock.递归锁RLock.Condition(条件变量):事件event ...
ViewBag---MVC3中 ViewBag、ViewData和TempData的使用和差别-------与ViewBag+Hashtable应用例子
ViewBag 在MVC3開始.视图数据能够通过ViewBag属性訪问.在MVC2中则是使用ViewData.MVC3中保留了ViewData的使用.ViewBag 是动态类型(dynamic),Vi ...
javascript_19-DOM初体验
DOM DOM: 文档对象模型(Document Object Model),又称为文档树模型.是一套操作HTML和XML文档的API. DOM可以把HTML和XML描述为一个文档树.树上的每一个分支 ...
SQL SERVER-SSMS安装联机丛书 book online
1.下载地址:https://www.microsoft.com/en-us/download/details.aspx?id=42557 2.解压. 3.在SSMS中添加引用. 选择解压路径找到ms ...
springboot2.1.3+Junit4 单元测试
引入依赖的包: <dependency> <groupId>org.mockito</groupId> <artifactId>mockito-core ...
keil5工程移植到IAR工程
keil5工程移植到IAR工程一. 软件版本 MDK-ARM Professional Version: 5.14.0.0 IAR 8.1 移植工程:基于正点原子开发板建立的STM32F407ZG ...
Centos部署项目
nginx + virtualenv + uwsgi + django + mysql + supervisor 部署项目一.安装Python3 二.安装MariaDB,并授权远程 grant al ...
FailOver的机制
package util import ( "fmt" "hash/crc32" "math/rand" "sort" ...
kafka2.12 集群搭建
前提: 1.下载 kafka http://kafka.apache.org/downloads 2.下载配置zookeeper http://www.cnblogs.com/eggplantpro/ ...
PostgreSQL 索引坏块处理
今天应用反应有张表查询报错,报错信息如下 back=# select max(create_time) from public.tbl_index_table where create_time> ...

一段js MD5。加密 转换C#语法过程

一段js MD5。加密 转换C#语法过程的更多相关文章

随机推荐

热门专题

一段js MD5。加密转换C#语法过程

一段js MD5。加密转换C#语法过程的更多相关文章