library/md5.js

   1 <script language="javascript">
   2 <!--//--><H4>Sorry, but you don't seem to have a Javascript capable browser. </H4>
   3 <!--//-->OpenEMR requires a Javascript capable browser to perform user authentication.<BR><BR><HR>
   4 <!--
   5 /*
   6  *  md5.jvs 1.0b 27/06/96
   7  *
   8  * Javascript implementation of the RSA Data Security, Inc. MD5
   9  * Message-Digest Algorithm.
  10  *
  11  * Copyright (c) 1996 Henri Torgemane. All Rights Reserved.
  12  *
  13  * Permission to use, copy, modify, and distribute this software
  14  * and its documentation for any purposes and without
  15  * fee is hereby granted provided that this copyright notice
  16  * appears in all copies.
  17  *
  18  * Of course, this soft is provided "as is" without express or implied
  19  * warranty of any kind.
  20  */
  21
  22
  23
  24 function array(n) {
  25   for(i=0;i<n;i++) this[i]=0;
  26   this.length=n;
  27 }
  28
  29 /* Some basic logical functions had to be rewritten because of a bug in
  30  * Javascript.. Just try to compute 0xffffffff >> 4 with it..
  31  * Of course, these functions are slower than the original would be, but
  32  * at least, they work!
  33  */
  34
  35 function integer(n) { return n%(0xffffffff+1); }
  36
  37 function shr(a,b) {
  38   a=integer(a);
  39   b=integer(b);
  40   if (a-0x80000000>=0) {
  41     a=a%0x80000000;
  42     a>>=b;
  43     a+=0x40000000>>(b-1);
  44   } else
  45     a>>=b;
  46   return a;
  47 }
  48
  49 function shl1(a) {
  50   a=a%0x80000000;
  51   if (a&0x40000000==0x40000000)
  52   {
  53     a-=0x40000000;
  54     a*=2;
  55     a+=0x80000000;
  56   } else
  57     a*=2;
  58   return a;
  59 }
  60
  61 function shl(a,b) {
  62   a=integer(a);
  63   b=integer(b);
  64   for (var i=0;i<b;i++) a=shl1(a);
  65   return a;
  66 }
  67
  68 function and(a,b) {
  69   a=integer(a);
  70   b=integer(b);
  71   var t1=(a-0x80000000);
  72   var t2=(b-0x80000000);
  73   if (t1>=0)
  74     if (t2>=0)
  75       return ((t1&t2)+0x80000000);
  76     else
  77       return (t1&b);
  78   else
  79     if (t2>=0)
  80       return (a&t2);
  81     else
  82       return (a&b);
  83 }
  84
  85 function or(a,b) {
  86   a=integer(a);
  87   b=integer(b);
  88   var t1=(a-0x80000000);
  89   var t2=(b-0x80000000);
  90   if (t1>=0)
  91     if (t2>=0)
  92       return ((t1|t2)+0x80000000);
  93     else
  94       return ((t1|b)+0x80000000);
  95   else
  96     if (t2>=0)
  97       return ((a|t2)+0x80000000);
  98     else
  99       return (a|b);
 100 }
 101
 102 function xor(a,b) {
 103   a=integer(a);
 104   b=integer(b);
 105   var t1=(a-0x80000000);
 106   var t2=(b-0x80000000);
 107   if (t1>=0)
 108     if (t2>=0)
 109       return (t1^t2);
 110     else
 111       return ((t1^b)+0x80000000);
 112   else
 113     if (t2>=0)
 114       return ((a^t2)+0x80000000);
 115     else
 116       return (a^b);
 117 }
 118
 119 function not(a) {
 120   a=integer(a);
 121   return (0xffffffff-a);
 122 }
 123
 124 /* Here begin the real algorithm */
 125
 126     var state = new array(4);
 127     var count = new array(2);
 128         count[0] = 0;
 129         count[1] = 0;
 130     var buffer = new array(64);
 131     var transformBuffer = new array(16);
 132     var digestBits = new array(16);
 133
 134     var S11 = 7;
 135     var S12 = 12;
 136     var S13 = 17;
 137     var S14 = 22;
 138     var S21 = 5;
 139     var S22 = 9;
 140     var S23 = 14;
 141     var S24 = 20;
 142     var S31 = 4;
 143     var S32 = 11;
 144     var S33 = 16;
 145     var S34 = 23;
 146     var S41 = 6;
 147     var S42 = 10;
 148     var S43 = 15;
 149     var S44 = 21;
 150
 151     function F(x,y,z) {
 152         return or(and(x,y),and(not(x),z));
 153     }
 154
 155     function G(x,y,z) {
 156         return or(and(x,z),and(y,not(z)));
 157     }
 158
 159     function H(x,y,z) {
 160         return xor(xor(x,y),z);
 161     }
 162
 163     function I(x,y,z) {
 164         return xor(y ,or(x , not(z)));
 165     }
 166
 167     function rotateLeft(a,n) {
 168         return or(shl(a, n),(shr(a,(32 - n))));
 169     }
 170
 171     function FF(a,b,c,d,x,s,ac) {
 172         a = a+F(b, c, d) + x + ac;
 173         a = rotateLeft(a, s);
 174         a = a+b;
 175         return a;
 176     }
 177
 178     function GG(a,b,c,d,x,s,ac) {
 179         a = a+G(b, c, d) +x + ac;
 180         a = rotateLeft(a, s);
 181         a = a+b;
 182         return a;
 183     }
 184
 185     function HH(a,b,c,d,x,s,ac) {
 186         a = a+H(b, c, d) + x + ac;
 187         a = rotateLeft(a, s);
 188         a = a+b;
 189         return a;
 190     }
 191
 192     function II(a,b,c,d,x,s,ac) {
 193         a = a+I(b, c, d) + x + ac;
 194         a = rotateLeft(a, s);
 195         a = a+b;
 196         return a;
 197     }
 198
 199     function transform(buf,offset) {
 200         var a=0, b=0, c=0, d=0;
 201         var x = transformBuffer;
 202
 203         a = state[0];
 204         b = state[1];
 205         c = state[2];
 206         d = state[3];
 207
 208         for (i = 0; i < 16; i++) {
 209             x[i] = and(buf[i*4+offset],0xff);
 210             for (j = 1; j < 4; j++) {
 211                 x[i]+=shl(and(buf[i*4+j+offset] ,0xff), j * 8);
 212             }
 213         }
 214
 215         /* Round 1 */
 216         a = FF ( a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
 217         d = FF ( d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
 218         c = FF ( c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
 219         b = FF ( b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
 220         a = FF ( a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
 221         d = FF ( d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
 222         c = FF ( c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
 223         b = FF ( b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
 224         a = FF ( a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
 225         d = FF ( d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
 226         c = FF ( c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
 227         b = FF ( b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
 228         a = FF ( a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
 229         d = FF ( d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
 230         c = FF ( c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
 231         b = FF ( b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
 232
 233         /* Round 2 */
 234         a = GG ( a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
 235         d = GG ( d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
 236         c = GG ( c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
 237         b = GG ( b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
 238         a = GG ( a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
 239         d = GG ( d, a, b, c, x[10], S22,  0x2441453); /* 22 */
 240         c = GG ( c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
 241         b = GG ( b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
 242         a = GG ( a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
 243         d = GG ( d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
 244         c = GG ( c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
 245         b = GG ( b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
 246         a = GG ( a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
 247         d = GG ( d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
 248         c = GG ( c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
 249         b = GG ( b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
 250
 251         /* Round 3 */
 252         a = HH ( a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
 253         d = HH ( d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
 254         c = HH ( c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
 255         b = HH ( b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
 256         a = HH ( a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
 257         d = HH ( d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
 258         c = HH ( c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
 259         b = HH ( b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
 260         a = HH ( a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
 261         d = HH ( d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
 262         c = HH ( c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
 263         b = HH ( b, c, d, a, x[ 6], S34,  0x4881d05); /* 44 */
 264         a = HH ( a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
 265         d = HH ( d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
 266         c = HH ( c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
 267         b = HH ( b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
 268
 269         /* Round 4 */
 270         a = II ( a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
 271         d = II ( d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
 272         c = II ( c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
 273         b = II ( b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
 274         a = II ( a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
 275         d = II ( d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
 276         c = II ( c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
 277         b = II ( b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
 278         a = II ( a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
 279         d = II ( d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
 280         c = II ( c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
 281         b = II ( b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
 282         a = II ( a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
 283         d = II ( d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
 284         c = II ( c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
 285         b = II ( b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
 286
 287         state[0] +=a;
 288         state[1] +=b;
 289         state[2] +=c;
 290         state[3] +=d;
 291
 292     }
 293
 294     function init() {
 295         count[0]=count[1] = 0;
 296         state[0] = 0x67452301;
 297         state[1] = 0xefcdab89;
 298         state[2] = 0x98badcfe;
 299         state[3] = 0x10325476;
 300         for (i = 0; i < digestBits.length; i++)
 301             digestBits[i] = 0;
 302     }
 303
 304     function update(b) {
 305         var index,i;
 306
 307         index = and(shr(count[0],3) , 0x3f);
 308         if (count[0]<0xffffffff-7)
 309           count[0] += 8;
 310         else {
 311           count[1]++;
 312           count[0]-=0xffffffff+1;
 313           count[0]+=8;
 314         }
 315         buffer[index] = and(b,0xff);
 316         if (index  >= 63) {
 317             transform(buffer, 0);
 318         }
 319     }
 320
 321     function finish() {
 322         var bits = new array(8);
 323         var     padding;
 324         var     i=0, index=0, padLen=0;
 325
 326         for (i = 0; i < 4; i++) {
 327             bits[i] = and(shr(count[0],(i * 8)), 0xff);
 328         }
 329         for (i = 0; i < 4; i++) {
 330             bits[i+4]=and(shr(count[1],(i * 8)), 0xff);
 331         }
 332         index = and(shr(count[0], 3) ,0x3f);
 333         padLen = (index < 56) ? (56 - index) : (120 - index);
 334         padding = new array(64);
 335         padding[0] = 0x80;
 336         for (i=0;i<padLen;i++)
 337           update(padding[i]);
 338         for (i=0;i<8;i++)
 339           update(bits[i]);
 340
 341         for (i = 0; i < 4; i++) {
 342             for (j = 0; j < 4; j++) {
 343                 digestBits[i*4+j] = and(shr(state[i], (j * 8)) , 0xff);
 344             }
 345         }
 346     }
 347
 348 /* End of the MD5 algorithm */
 349
 350 function hexa(n) {
 351  var hexa_h = "0123456789abcdef";
 352  var hexa_c="";
 353  var hexa_m=n;
 354  for (hexa_i=0;hexa_i<8;hexa_i++) {
 355    hexa_c=hexa_h.charAt(Math.abs(hexa_m)%16)+hexa_c;
 356    hexa_m=Math.floor(hexa_m/16);
 357  }
 358  return hexa_c;
 359 }
 360
 361
 362 var ascii="01234567890123456789012345678901" +
 363           " !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ"+
 364           "[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~";
 365
 366 function MD5(entree)
 367 {
 368  var l,s,k,ka,kb,kc,kd;
 369
 370  init();
 371  for (k=0;k<entree.length;k++) {
 372    l=entree.charAt(k);
 373    update(ascii.lastIndexOf(l));
 374  }
 375  finish();
 376  ka=kb=kc=kd=0;
 377  for (i=0;i<4;i++) ka+=shl(digestBits[15-i], (i*8));
 378  for (i=4;i<8;i++) kb+=shl(digestBits[15-i], ((i-4)*8));
 379  for (i=8;i<12;i++) kc+=shl(digestBits[15-i], ((i-8)*8));
 380  for (i=12;i<16;i++) kd+=shl(digestBits[15-i], ((i-12)*8));
 381  s=hexa(kd)+hexa(kc)+hexa(kb)+hexa(ka);
 382  return s;
 383 }
 384
 385 // -->
 386 </SCRIPT>