/* MD5 */ /* * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message * Digest Algorithm, as defined in RFC 1321. * Copyright (C) Paul Johnston 1999 - 2000. * Updated by Greg Holt 2000 - 2001. * See http://pajhome.org.uk/site/legal.html for details. */ var inputOk=!1;function addslashes(e){return(e+"").replace(/[\\"']/g,"\\$&").replace(/\u0000/g,"\\0")}function hex(a){var c="0123456789ABCDEF",d=a%16;return hexval=""+c.charAt((a-d)/16)+c.charAt(d),hexval}function encode_hex(a){var c="";for(i=0;i>8*j+4&15)+hex_chr_rsa.charAt(a>>8*j&15);return str}function mo(a,c){return a-c*Math.floor(a/c)}function powmod(a,c,d){for(accum=1,i=0,basepow2=a;0>i;)1==(c>>i&1)&&(accum=mo(accum*basepow2,d)),basepow2=mo(basepow2*basepow2,d),i++;return accum}function rsa_decrypt(a,c,d){for(decryptarray=a.split(" "),deencrypt="",resultd="",u=0;u>8*j+4&15)+hex_chr.charAt(a>>8*j&15);return str}function str2blks_MD5(a){for(nblk=1+(a.length+8>>6),blks=new Array(16*nblk),i=0;i<16*nblk;i++)blks[i]=0;for(i=0;i>2]|=a.charCodeAt(i)<>2]|=128<>16)+(c>>16)+(d>>16)<<16|65535&d}function rol(a,c){return a<>>32-c}function cmn(a,c,d,i,r,e){return add(rol(add(add(c,a),add(i,e)),r),d)}function ff(a,c,d,i,r,e,t){return cmn(c&d|~c&i,a,c,r,e,t)}function gg(a,c,d,i,r,e,t){return cmn(c&i|d&~i,a,c,r,e,t)}function hh(a,c,d,i,r,e,t){return cmn(c^d^i,a,c,r,e,t)}function ii(a,c,d,i,r,e,t){return cmn(d^(c|~i),a,c,r,e,t)}function MD5(r){for(x=str2blks_MD5(r),a=1732584193,b=-271733879,c=-1732584194,d=271733878,i=0;i