vendor: 9,085 bytes, lines 1-222
1 2 /** 3 * jQuery MD5 hash algorithm function 4 * 5 * <code> 6 * Calculate the md5 hash of a String 7 * String $.md5 ( String str ) 8 * </code> 9 * 10 * Calculates the MD5 hash of str using the » RSA Data Security, Inc. MD5 Message-Digest Algorithm, and returns that hash. 11 * MD5 (Message-Digest algorithm 5) is a widely-used cryptographic hash function with a 128-bit hash value. MD5 has been employed in a wide variety of security applications, and is also commonly used to check the integrity of data. The generated hash is also non-reversable. Data cannot be retrieved from the message digest, the digest uniquely identifies the data. 12 * MD5 was developed by Professor Ronald L. Rivest in 1994. Its 128 bit (16 byte) message digest makes it a faster implementation than SHA-1. 13 * This script is used to process a variable length message into a fixed-length output of 128 bits using the MD5 algorithm. It is fully compatible with UTF-8 encoding. It is very useful when u want to transfer encrypted passwords over the internet. If you plan using UTF-8 encoding in your project don't forget to set the page encoding to UTF-8 (Content-Type meta tag). 14 * This function orginally get from the WebToolkit and rewrite for using as the jQuery plugin. 15 * 16 * Example 17 * Code 18 * <code> 19 * $.md5("I'm Persian."); 20 * </code> 21 * Result 22 * <code> 23 * "b8c901d0f02223f9761016cfff9d68df" 24 * </code> 25 * 26 * @alias Muhammad Hussein Fattahizadeh < muhammad [AT] semnanweb [DOT] com > 27 * @link http://www.semnanweb.com/jquery-plugin/md5.html 28 * @see http://www.webtoolkit.info/ 29 * @license http://www.gnu.org/licenses/gpl.html [GNU General Public License] 30 * @param {jQuery} {md5:function(string)) 31 * @return string 32 */ 33 34 (function($){ 35 36 var rotateLeft = function(lValue, iShiftBits) { 37 return (lValue << iShiftBits) | (lValue >>> (32 - iShiftBits)); 38 } 39 40 var addUnsigned = function(lX, lY) { 41 var lX4, lY4, lX8, lY8, lResult; 42 lX8 = (lX & 0x80000000); 43 lY8 = (lY & 0x80000000); 44 lX4 = (lX & 0x40000000); 45 lY4 = (lY & 0x40000000); 46 lResult = (lX & 0x3FFFFFFF) + (lY & 0x3FFFFFFF); 47 if (lX4 & lY4) return (lResult ^ 0x80000000 ^ lX8 ^ lY8); 48 if (lX4 | lY4) { 49 if (lResult & 0x40000000) return (lResult ^ 0xC0000000 ^ lX8 ^ lY8); 50 else return (lResult ^ 0x40000000 ^ lX8 ^ lY8); 51 } else { 52 return (lResult ^ lX8 ^ lY8); 53 } 54 } 55 56 var F = function(x, y, z) { 57 return (x & y) | ((~ x) & z); 58 } 59 60 var G = function(x, y, z) { 61 return (x & z) | (y & (~ z)); 62 } 63 64 var H = function(x, y, z) { 65 return (x ^ y ^ z); 66 } 67 68 var I = function(x, y, z) { 69 return (y ^ (x | (~ z))); 70 } 71 72 var FF = function(a, b, c, d, x, s, ac) { 73 a = addUnsigned(a, addUnsigned(addUnsigned(F(b, c, d), x), ac)); 74 return addUnsigned(rotateLeft(a, s), b); 75 }; 76 77 var GG = function(a, b, c, d, x, s, ac) { 78 a = addUnsigned(a, addUnsigned(addUnsigned(G(b, c, d), x), ac)); 79 return addUnsigned(rotateLeft(a, s), b); 80 }; 81 82 var HH = function(a, b, c, d, x, s, ac) { 83 a = addUnsigned(a, addUnsigned(addUnsigned(H(b, c, d), x), ac)); 84 return addUnsigned(rotateLeft(a, s), b); 85 }; 86 87 var II = function(a, b, c, d, x, s, ac) { 88 a = addUnsigned(a, addUnsigned(addUnsigned(I(b, c, d), x), ac)); 89 return addUnsigned(rotateLeft(a, s), b); 90 }; 91 92 var convertToWordArray = function(string) { 93 var lWordCount; 94 var lMessageLength = string.length; 95 var lNumberOfWordsTempOne = lMessageLength + 8; 96 var lNumberOfWordsTempTwo = (lNumberOfWordsTempOne - (lNumberOfWordsTempOne % 64)) / 64; 97 var lNumberOfWords = (lNumberOfWordsTempTwo + 1) * 16; 98 var lWordArray = Array(lNumberOfWords - 1); 99 var lBytePosition = 0; 100 var lByteCount = 0; 101 while (lByteCount < lMessageLength) { 102 lWordCount = (lByteCount - (lByteCount % 4)) / 4; 103 lBytePosition = (lByteCount % 4) * 8; 104 lWordArray[lWordCount] = (lWordArray[lWordCount] | (string.charCodeAt(lByteCount) << lBytePosition)); 105 lByteCount++; 106 } 107 lWordCount = (lByteCount - (lByteCount % 4)) / 4; 108 lBytePosition = (lByteCount % 4) * 8; 109 lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80 << lBytePosition); 110 lWordArray[lNumberOfWords - 2] = lMessageLength << 3; 111 lWordArray[lNumberOfWords - 1] = lMessageLength >>> 29; 112 return lWordArray; 113 }; 114 115 var wordToHex = function(lValue) { 116 var WordToHexValue = "", WordToHexValueTemp = "", lByte, lCount; 117 for (lCount = 0; lCount <= 3; lCount++) { 118 lByte = (lValue >>> (lCount * 8)) & 255; 119 WordToHexValueTemp = "0" + lByte.toString(16); 120 WordToHexValue = WordToHexValue + WordToHexValueTemp.substr(WordToHexValueTemp.length - 2, 2); 121 } 122 return WordToHexValue; 123 }; 124 125 var uTF8Encode = function(string) { 126 string = string.replace(/\x0d\x0a/g, "\x0a"); 127 var output = ""; 128 for (var n = 0; n < string.length; n++) { 129 var c = string.charCodeAt(n); 130 if (c < 128) { 131 output += String.fromCharCode(c); 132 } else if ((c > 127) && (c < 2048)) { 133 output += String.fromCharCode((c >> 6) | 192); 134 output += String.fromCharCode((c & 63) | 128); 135 } else { 136 output += String.fromCharCode((c >> 12) | 224); 137 output += String.fromCharCode(((c >> 6) & 63) | 128); 138 output += String.fromCharCode((c & 63) | 128); 139 } 140 } 141 return output; 142 }; 143 144 $.extend({ 145 md5: function(string) { 146 var x = Array(); 147 var k, AA, BB, CC, DD, a, b, c, d; 148 var S11=7, S12=12, S13=17, S14=22; 149 var S21=5, S22=9 , S23=14, S24=20; 150 var S31=4, S32=11, S33=16, S34=23; 151 var S41=6, S42=10, S43=15, S44=21; 152 string = uTF8Encode(string); 153 x = convertToWordArray(string); 154 a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476; 155 for (k = 0; k < x.length; k += 16) { 156 AA = a; BB = b; CC = c; DD = d; 157 a = FF(a, b, c, d, x[k+0], S11, 0xD76AA478); 158 d = FF(d, a, b, c, x[k+1], S12, 0xE8C7B756); 159 c = FF(c, d, a, b, x[k+2], S13, 0x242070DB); 160 b = FF(b, c, d, a, x[k+3], S14, 0xC1BDCEEE); 161 a = FF(a, b, c, d, x[k+4], S11, 0xF57C0FAF); 162 d = FF(d, a, b, c, x[k+5], S12, 0x4787C62A); 163 c = FF(c, d, a, b, x[k+6], S13, 0xA8304613); 164 b = FF(b, c, d, a, x[k+7], S14, 0xFD469501); 165 a = FF(a, b, c, d, x[k+8], S11, 0x698098D8); 166 d = FF(d, a, b, c, x[k+9], S12, 0x8B44F7AF); 167 c = FF(c, d, a, b, x[k+10], S13, 0xFFFF5BB1); 168 b = FF(b, c, d, a, x[k+11], S14, 0x895CD7BE); 169 a = FF(a, b, c, d, x[k+12], S11, 0x6B901122); 170 d = FF(d, a, b, c, x[k+13], S12, 0xFD987193); 171 c = FF(c, d, a, b, x[k+14], S13, 0xA679438E); 172 b = FF(b, c, d, a, x[k+15], S14, 0x49B40821); 173 a = GG(a, b, c, d, x[k+1], S21, 0xF61E2562); 174 d = GG(d, a, b, c, x[k+6], S22, 0xC040B340); 175 c = GG(c, d, a, b, x[k+11], S23, 0x265E5A51); 176 b = GG(b, c, d, a, x[k+0], S24, 0xE9B6C7AA); 177 a = GG(a, b, c, d, x[k+5], S21, 0xD62F105D); 178 d = GG(d, a, b, c, x[k+10], S22, 0x2441453); 179 c = GG(c, d, a, b, x[k+15], S23, 0xD8A1E681); 180 b = GG(b, c, d, a, x[k+4], S24, 0xE7D3FBC8); 181 a = GG(a, b, c, d, x[k+9], S21, 0x21E1CDE6); 182 d = GG(d, a, b, c, x[k+14], S22, 0xC33707D6); 183 c = GG(c, d, a, b, x[k+3], S23, 0xF4D50D87); 184 b = GG(b, c, d, a, x[k+8], S24, 0x455A14ED); 185 a = GG(a, b, c, d, x[k+13], S21, 0xA9E3E905); 186 d = GG(d, a, b, c, x[k+2], S22, 0xFCEFA3F8); 187 c = GG(c, d, a, b, x[k+7], S23, 0x676F02D9); 188 b = GG(b, c, d, a, x[k+12], S24, 0x8D2A4C8A); 189 a = HH(a, b, c, d, x[k+5], S31, 0xFFFA3942); 190 d = HH(d, a, b, c, x[k+8], S32, 0x8771F681); 191 c = HH(c, d, a, b, x[k+11], S33, 0x6D9D6122); 192 b = HH(b, c, d, a, x[k+14], S34, 0xFDE5380C); 193 a = HH(a, b, c, d, x[k+1], S31, 0xA4BEEA44); 194 d = HH(d, a, b, c, x[k+4], S32, 0x4BDECFA9); 195 c = HH(c, d, a, b, x[k+7], S33, 0xF6BB4B60); 196 b = HH(b, c, d, a, x[k+10], S34, 0xBEBFBC70); 197 a = HH(a, b, c, d, x[k+13], S31, 0x289B7EC6); 198 d = HH(d, a, b, c, x[k+0], S32, 0xEAA127FA); 199 c = HH(c, d, a, b, x[k+3], S33, 0xD4EF3085); 200 b = HH(b, c, d, a, x[k+6], S34, 0x4881D05); 201 a = HH(a, b, c, d, x[k+9], S31, 0xD9D4D039); 202 d = HH(d, a, b, c, x[k+12], S32, 0xE6DB99E5); 203 c = HH(c, d, a, b, x[k+15], S33, 0x1FA27CF8); 204 b = HH(b, c, d, a, x[k+2], S34, 0xC4AC5665); 205 a = II(a, b, c, d, x[k+0], S41, 0xF4292244); 206 d = II(d, a, b, c, x[k+7], S42, 0x432AFF97); 207 c = II(c, d, a, b, x[k+14], S43, 0xAB9423A7); 208 b = II(b, c, d, a, x[k+5], S44, 0xFC93A039); 209 a = II(a, b, c, d, x[k+12], S41, 0x655B59C3); 210 d = II(d, a, b, c, x[k+3], S42, 0x8F0CCC92); 211 c = II(c, d, a, b, x[k+10], S43, 0xFFEFF47D); 212 b = II(b, c, d, a, x[k+1], S44, 0x85845DD1); 213 a = II(a, b, c, d, x[k+8], S41, 0x6FA87E4F); 214 d = II(d, a, b, c, x[k+15], S42, 0xFE2CE6E0); 215 c = II(c, d, a, b, x[k+6], S43, 0xA3014314); 216 b = II(b, c, d, a, x[k+13], S44, 0x4E0811A1); 217 a = II(a, b, c, d, x[k+4], S41, 0xF7537E82); 218 d = II(d, a, b, c, x[k+11], S42, 0xBD3AF235); 219 c = II(c, d, a, b, x[k+2], S43, 0x2AD7D2BB); 220 b = II(b, c, d, a, x[k+9], S44, 0xEB86D391); 221 a = addUnsigned(a, AA); 222 b = addUnsigned(b, BB);
223 c = addUnsigned(c, CC); 224 d = addUnsigned(d, DD); 225 } 226 var tempValue = wordToHex(a) + wordToHex(b) + wordToHex(c) + wordToHex(d); 227 return tempValue.toLowerCase(); 228 } 229 }); 230 })(jQuery);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.