text: /*
  ==================================================================================================
    Core - JavaScript Foundation
    Copyright 2010-2012 Zynga Inc.
    Copyright 2012-2014 Sebastian Werner
  --------------------------------------------------------------------------------------------------
    Based on the work of:
    Version 2.2 Copyright (C) Paul Johnston 1999 - 2009
    Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
    Distributed under the BSD License
    See http://pajhome.org.uk/crypt/md5 for more info.
  ==================================================================================================
  */
  
  "use strict";
  
  /* jshint bitwise:false */
  
  (function(Util, StringUtil)
  {
  	/**
  	 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message Digest Algorithm, as defined in RFC 1321.
  	 */
  	core.Module("core.crypt.MD5",
  	{
  		/**
  		 * {String} Returns the MD5 checksum of the given @str {String} as a raw string.
  		 */
  		checksum : function(str) {
  			return Util.byteArrayToRawString(this.checksumAsByteArray(str));
  		},
  
  
  		/**
  		 * {Array} Returns the MD5 checksum of the given @str {String} as an byte array.
  		 */
  		checksumAsByteArray : function(str)
  		{
  			str = StringUtil.encodeUtf8(str);
  			return Util.littleEndianToByteArray(binl(Util.rawStringToLittleEndian(str), str.length * 8));
  		},
  
  
  		/**
  		 * {String} Returns a HMAC (Hash-based Message Authentication Code) using the MD5 hash function as a raw string.
  		 *
  		 * HMAC is a specific construction for calculating a message authentication code (MAC) involving a
  		 * cryptographic hash function in combination with a secret key.
  		 *
  		 * - @key {String} The secret key for verifying authenticity
  		 * - @str {String} Message to compute the HMAC for
  		 */
  		hmac : function(key, str)
  		{
  			key = StringUtil.encodeUtf8(key);
  			str = StringUtil.encodeUtf8(str);
  
  			var bkey = Util.rawStringToLittleEndian(key);
  			if (bkey.length > 16) {
  				bkey = binl(bkey, key.length * 8);
  			}
  
  			var ipad = new Array(16);
  			var opad = new Array(16);
  
  			for (var i = 0; i < 16; i++)
  			{
  				ipad[i] = bkey[i] ^ 0x36363636;
  				opad[i] = bkey[i] ^ 0x5C5C5C5C;
  			}
  
  			var hash = binl(ipad.concat(Util.rawStringToLittleEndian(str)), 512 + str.length * 8);
  			return Util.littleEndianToRawString(binl(opad.concat(hash), 512 + 128));
  		}
  	});
  
  
  	/*
  	 * Calculate the MD5 of an array of little-endian words, and a bit length.
  	 */
  	var binl = function(x, len)
  	{
  		/* append padding */
  		x[len >> 5] |= 0x80 << ((len) % 32);
  		x[(((len + 64) >>> 9) << 4) + 14] = len;
  
  		var a = 1732584193;
  		var b = -271733879;
  		var c = -1732584194;
  		var d = 271733878;
  
  		for(var i = 0; i < x.length; i += 16)
  		{
  			var olda = a;
  			var oldb = b;
  			var oldc = c;
  			var oldd = d;
  
  			a = ff(a, b, c, d, x[i+ 0], 7 , -680876936);
  			d = ff(d, a, b, c, x[i+ 1], 12, -389564586);
  			c = ff(c, d, a, b, x[i+ 2], 17,  606105819);
  			b = ff(b, c, d, a, x[i+ 3], 22, -1044525330);
  			a = ff(a, b, c, d, x[i+ 4], 7 , -176418897);
  			d = ff(d, a, b, c, x[i+ 5], 12,  1200080426);
  			c = ff(c, d, a, b, x[i+ 6], 17, -1473231341);
  			b = ff(b, c, d, a, x[i+ 7], 22, -45705983);
  			a = ff(a, b, c, d, x[i+ 8], 7 ,  1770035416);
  			d = ff(d, a, b, c, x[i+ 9], 12, -1958414417);
  			c = ff(c, d, a, b, x[i+10], 17, -42063);
  			b = ff(b, c, d, a, x[i+11], 22, -1990404162);
  			a = ff(a, b, c, d, x[i+12], 7 ,  1804603682);
  			d = ff(d, a, b, c, x[i+13], 12, -40341101);
  			c = ff(c, d, a, b, x[i+14], 17, -1502002290);
  			b = ff(b, c, d, a, x[i+15], 22,  1236535329);
  
  			a = gg(a, b, c, d, x[i+ 1], 5 , -165796510);
  			d = gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
  			c = gg(c, d, a, b, x[i+11], 14,  643717713);
  			b = gg(b, c, d, a, x[i+ 0], 20, -373897302);
  			a = gg(a, b, c, d, x[i+ 5], 5 , -701558691);
  			d = gg(d, a, b, c, x[i+10], 9 ,  38016083);
  			c = gg(c, d, a, b, x[i+15], 14, -660478335);
  			b = gg(b, c, d, a, x[i+ 4], 20, -405537848);
  			a = gg(a, b, c, d, x[i+ 9], 5 ,  568446438);
  			d = gg(d, a, b, c, x[i+14], 9 , -1019803690);
  			c = gg(c, d, a, b, x[i+ 3], 14, -187363961);
  			b = gg(b, c, d, a, x[i+ 8], 20,  1163531501);
  			a = gg(a, b, c, d, x[i+13], 5 , -1444681467);
  			d = gg(d, a, b, c, x[i+ 2], 9 , -51403784);
  			c = gg(c, d, a, b, x[i+ 7], 14,  1735328473);
  			b = gg(b, c, d, a, x[i+12], 20, -1926607734);
  
  			a = hh(a, b, c, d, x[i+ 5], 4 , -378558);
  			d = hh(d, a, b, c, x[i+ 8], 11, -2022574463);
  			c = hh(c, d, a, b, x[i+11], 16,  1839030562);
  			b = hh(b, c, d, a, x[i+14], 23, -35309556);
  			a = hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
  			d = hh(d, a, b, c, x[i+ 4], 11,  1272893353);
  			c = hh(c, d, a, b, x[i+ 7], 16, -155497632);
  			b = hh(b, c, d, a, x[i+10], 23, -1094730640);
  			a = hh(a, b, c, d, x[i+13], 4 ,  681279174);
  			d = hh(d, a, b, c, x[i+ 0], 11, -358537222);
  			c = hh(c, d, a, b, x[i+ 3], 16, -722521979);
  			b = hh(b, c, d, a, x[i+ 6], 23,  76029189);
  			a = hh(a, b, c, d, x[i+ 9], 4 , -640364487);
  			d = hh(d, a, b, c, x[i+12], 11, -421815835);
  			c = hh(c, d, a, b, x[i+15], 16,  530742520);
  			b = hh(b, c, d, a, x[i+ 2], 23, -995338651);
  
  			a = ii(a, b, c, d, x[i+ 0], 6 , -198630844);
  			d = ii(d, a, b, c, x[i+ 7], 10,  1126891415);
  			c = ii(c, d, a, b, x[i+14], 15, -1416354905);
  			b = ii(b, c, d, a, x[i+ 5], 21, -57434055);
  			a = ii(a, b, c, d, x[i+12], 6 ,  1700485571);
  			d = ii(d, a, b, c, x[i+ 3], 10, -1894986606);
  			c = ii(c, d, a, b, x[i+10], 15, -1051523);
  			b = ii(b, c, d, a, x[i+ 1], 21, -2054922799);
  			a = ii(a, b, c, d, x[i+ 8], 6 ,  1873313359);
  			d = ii(d, a, b, c, x[i+15], 10, -30611744);
  			c = ii(c, d, a, b, x[i+ 6], 15, -1560198380);
  			b = ii(b, c, d, a, x[i+13], 21,  1309151649);
  			a = ii(a, b, c, d, x[i+ 4], 6 , -145523070);
  			d = ii(d, a, b, c, x[i+11], 10, -1120210379);
  			c = ii(c, d, a, b, x[i+ 2], 15,  718787259);
  			b = ii(b, c, d, a, x[i+ 9], 21, -343485551);
  
  			a = safeAdd(a, olda);
  			b = safeAdd(b, oldb);
  			c = safeAdd(c, oldc);
  			d = safeAdd(d, oldd);
  		}
  
  		return new Array(a, b, c, d);
  	};
  
  	/* jshint -W072 */
  
  	/*
  	 * These functions implement the four basic operations the algorithm uses.
  	 */
  	var cmn = function(q, a, b, x, s, t) {
  		return safeAdd(bitRol(safeAdd(safeAdd(a, q), safeAdd(x, t)), s),b);
  	};
  
  	var ff = function(a, b, c, d, x, s, t) {
  		return cmn((b & c) | ((~b) & d), a, b, x, s, t);
  	};
  
  	var gg = function(a, b, c, d, x, s, t) {
  		return cmn((b & d) | (c & (~d)), a, b, x, s, t);
  	};
  
  	var hh = function(a, b, c, d, x, s, t) {
  		return cmn(b ^ c ^ d, a, b, x, s, t);
  	};
  
  	var ii = function(a, b, c, d, x, s, t) {
  		return cmn(c ^ (b | (~d)), a, b, x, s, t);
  	};
  
  	/*
  	 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
  	 * to work around bugs in some JS interpreters.
  	 */
  	var safeAdd = function(x, y)
  	{
  		var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  		var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  
  		return (msw << 16) | (lsw & 0xFFFF);
  	};
  
  	/*
  	 * Bitwise rotate a 32-bit number to the left.
  	 */
  	var bitRol = function(num, cnt) {
  		return (num << cnt) | (num >>> (32 - cnt));
  	};
  
  })(core.crypt.Util, core.String);
  