View the DQSD CVS repository here:
http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/dqsd/
Update of /cvsroot/dqsd/dqsd/searches
In directory usw-pr-cvs1:/tmp/cvs-serv13230/searches
Added Files:
md5.xml
Log Message:
added md5 digest calculation
--- NEW FILE: md5.xml ---
<search function="md5">
<name>md5 Calculator</name>
<description>
Calculate md5 value for a string<br/>
<div class="helpboxDescLabels">Example:</div>
<table class="helpboxDescTable">
<tr>
<td>md5 string to encrypt</td><td> - </td><td>would put
917bf3c14d785096f2240db672639fb5 in the edit box</td>
</tr>
</table>
</description>
<link></link>
<category>Functions</category>
<contributor>Brent Beardsley</contributor>
<script><![CDATA[
/*
* A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
* Digest Algorithm, as defined in RFC 1321.
* Version 1.1 Copyright (C) Paul Johnston 1999 - 2002.
* Code also contributed by Greg Holt
* See http://pajhome.org.uk/site/legal.html for details.
*/
/*
* Modified by Brent Beardsley - 9 Oct 2002 - prepended md5_ to all function names to
* collisions with other function names. See http://www.pajhome.org.uk/crypt/md5/ for
* original file.
*/
/*
* Add integers, wrapping at 2^32. This uses 16-bit operations internally
* to work around bugs in some JS interpreters.
*/
function md5_safe_add(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.
*/
function md5_rol(num, cnt)
{
return (num << cnt) | (num >>> (32 - cnt))
}
/*
* These functions implement the four basic operations the algorithm uses.
*/
function md5_cmn(q, a, b, x, s, t)
{
return md5_safe_add(md5_rol(md5_safe_add(md5_safe_add(a, q), md5_safe_add(x, t)),
s), b)
}
function md5_ff(a, b, c, d, x, s, t)
{
return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t)
}
function md5_gg(a, b, c, d, x, s, t)
{
return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t)
}
function md5_hh(a, b, c, d, x, s, t)
{
return md5_cmn(b ^ c ^ d, a, b, x, s, t)
}
function md5_ii(a, b, c, d, x, s, t)
{
return md5_cmn(c ^ (b | (~d)), a, b, x, s, t)
}
/*
* Calculate the MD5 of an array of little-endian words, producing an array
* of little-endian words.
*/
function md5_coreMD5(x)
{
var a = 1732584193
var b = -271733879
var c = -1732584194
var d = 271733878
for(i = 0; i < x.length; i += 16)
{
var olda = a
var oldb = b
var oldc = c
var oldd = d
a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936)
d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586)
c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819)
b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330)
a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897)
d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426)
c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341)
b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983)
a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416)
d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417)
c = md5_ff(c, d, a, b, x[i+10], 17, -42063)
b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162)
a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682)
d = md5_ff(d, a, b, c, x[i+13], 12, -40341101)
c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290)
b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329)
a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510)
d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632)
c = md5_gg(c, d, a, b, x[i+11], 14, 643717713)
b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302)
a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691)
d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083)
c = md5_gg(c, d, a, b, x[i+15], 14, -660478335)
b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848)
a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438)
d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690)
c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961)
b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501)
a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467)
d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784)
c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473)
b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734)
a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558)
d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463)
c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562)
b = md5_hh(b, c, d, a, x[i+14], 23, -35309556)
a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060)
d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353)
c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632)
b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640)
a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174)
d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222)
c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979)
b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189)
a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487)
d = md5_hh(d, a, b, c, x[i+12], 11, -421815835)
c = md5_hh(c, d, a, b, x[i+15], 16, 530742520)
b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651)
a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844)
d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415)
c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905)
b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055)
a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571)
d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606)
c = md5_ii(c, d, a, b, x[i+10], 15, -1051523)
b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799)
a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359)
d = md5_ii(d, a, b, c, x[i+15], 10, -30611744)
c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380)
b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649)
a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070)
d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379)
c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259)
b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551)
a = md5_safe_add(a, olda)
b = md5_safe_add(b, oldb)
c = md5_safe_add(c, oldc)
d = md5_safe_add(d, oldd)
}
return [a, b, c, d]
}
/*
* Convert an array of little-endian words to a hex string.
*/
function md5_binl2hex(binarray)
{
var hex_tab = "0123456789abcdef"
var str = ""
for(var i = 0; i < binarray.length * 4; i++)
{
str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
hex_tab.charAt((binarray[i>>2] >> ((i%4)*8)) & 0xF)
}
return str
}
/*
* Convert an array of little-endian words to a base64 encoded string.
This is correct:
ogroup[0] = dtable[igroup[0] >> 2];
ogroup[1] = dtable[((igroup[0] & 3) << 4) | (igroup[1] >> 4)];
ogroup[2] = dtable[((igroup[1] & 0xF) << 2) | (igroup[2] >> 6)];
ogroup[3] = dtable[igroup[2] & 0x3F];
and should pad with '='
*/
function md5_binl2b64(binarray)
{
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
var str = ""
for(var i = 0; i < binarray.length * 4; i += 3)
{
x = binarray[i>>2]
alert(binarray[i>>5+1])
str += tab.charAt(((binarray[i>>5] << (i%32)) & 0x3F) |
((binarray[i>>5+1] >> (32-i%32)) & 0x3F))
}
return str
}
/*
I think this is correct for BIG endian
*/
function md5_binb2b64(binarray)
{
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
var str = ""
for(var i = 0; i < binarray.length * 32; i += 6)
{
alert(binarray[i>>5+1])
str += tab.charAt(((binarray[i>>5] << (i%32)) & 0x3F) |
((binarray[i>>5+1] >> (32-i%32)) & 0x3F))
}
// TBD: pad with =
return str
}
/*
* Convert an 8-bit character string to a sequence of 16-word blocks, stored
* as an array, and append appropriate padding for MD4/5 calculation.
* If any of the characters are >255, the high byte is silently ignored.
*/
function md5_str2binl(str)
{
var nblk = ((str.length + 8) >> 6) + 1 // number of 16-word blocks
var blks = new Array(nblk * 16)
for(var i = 0; i < nblk * 16; i++) blks[i] = 0
for(var i = 0; i < str.length; i++)
blks[i>>2] |= (str.charCodeAt(i) & 0xFF) << ((i%4) * 8)
blks[i>>2] |= 0x80 << ((i%4) * 8)
blks[nblk*16-2] = str.length * 8
return blks
}
/*
* Convert a wide-character string to a sequence of 16-word blocks, stored as
* an array, and append appropriate padding for MD4/5 calculation.
*/
function md5_strw2binl(str)
{
var nblk = ((str.length + 4) >> 5) + 1 // number of 16-word blocks
var blks = new Array(nblk * 16)
for(var i = 0; i < nblk * 16; i++) blks[i] = 0
for(var i = 0; i < str.length; i++)
blks[i>>1] |= str.charCodeAt(i) << ((i%2) * 16)
blks[i>>1] |= 0x80 << ((i%2) * 16)
blks[nblk*16-2] = str.length * 16
return blks
}
/*
* External interface
*/
function hexMD5 (str) { return md5_binl2hex(md5_coreMD5( md5_str2binl(str))) }
function hexMD5w(str) { return md5_binl2hex(md5_coreMD5(md5_strw2binl(str))) }
function b64MD5 (str) { return md5_binl2b64(md5_coreMD5( md5_str2binl(str))) }
function b64MD5w(str) { return md5_binl2b64(md5_coreMD5(md5_strw2binl(str))) }
/* Backward compatibility */
function calcMD5(str) { return md5_binl2hex(md5_coreMD5( md5_str2binl(str))) }
]]>
</script>
<script><![CDATA[
function md5(q)
{
if( nullArgs("md5", q) )
return;
document.deff.q.value = hexMD5(q);
}
]]>
</script>
</search>
-------------------------------------------------------
This sf.net email is sponsored by:ThinkGeek
Welcome to geek heaven.
http://thinkgeek.com/sf
_______________________________________________
DQSD-CVS mailing list
https://lists.sourceforge.net/lists/listinfo/dqsd-cvs
DQSD CVS repository:
http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/dqsd/
