MD5 Encrypt Hash in JavaScript

The MD5 Message-Digest Algorithm is a widely used cryptographic hash function that produces a 128-bit (16-byte) hash value.

The md5() function (presented in this page) can be used in JavaScript to calculate the MD5 hash of a string. Returns the hash as a 32-character hexadecimal number.

<script type="text/javascript">

/**

*  MD5 (Message-Digest Algorithm)

*  http://ramsis-code.blogspot.in/

**/

function md5(string) {

  function RotateLeft(lValue, iShiftBits) {

    return (lValue<<iShiftBits) | (lValue>>>(32-iShiftBits));

  }

  function AddUnsigned(lX,lY) {

    var lX4,lY4,lX8,lY8,lResult;

    lX8 = (lX & 0x80000000);

    lY8 = (lY & 0x80000000);

    lX4 = (lX & 0x40000000);

    lY4 = (lY & 0x40000000);

    lResult = (lX & 0x3FFFFFFF)+(lY & 0x3FFFFFFF);

    if (lX4 & lY4) {

      return (lResult ^ 0x80000000 ^ lX8 ^ lY8);

    }

    if (lX4 | lY4) {

      if (lResult & 0x40000000) {

        return (lResult ^ 0xC0000000 ^ lX8 ^ lY8);

      } else {

        return (lResult ^ 0x40000000 ^ lX8 ^ lY8);

      }

    } else {

      return (lResult ^ lX8 ^ lY8);

    }

   }

   function F(x,y,z) { return (x & y) | ((~x) & z); }

   function G(x,y,z) { return (x & z) | (y & (~z)); }

   function H(x,y,z) { return (x ^ y ^ z); }

  function I(x,y,z) { return (y ^ (x | (~z))); }

 

  function FF(a,b,c,d,x,s,ac) {

    a = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac));

    return AddUnsigned(RotateLeft(a, s), b);

  };

  function GG(a,b,c,d,x,s,ac) {

    a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d), x), ac));

    return AddUnsigned(RotateLeft(a, s), b);

  };

  function HH(a,b,c,d,x,s,ac) {

    a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac));

    return AddUnsigned(RotateLeft(a, s), b);

  };

  function II(a,b,c,d,x,s,ac) {

    a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac));

    return AddUnsigned(RotateLeft(a, s), b);

  };

  function ConvertToWordArray(string) {

    var lWordCount;

    var lMessageLength = string.length;

    var lNumberOfWords_temp1=lMessageLength + 8;

    var lNumberOfWords_temp2=(lNumberOfWords_temp1-(lNumberOfWords_temp1 % 64))/64;

    var lNumberOfWords = (lNumberOfWords_temp2+1)*16;

    var lWordArray=Array(lNumberOfWords-1);

    var lBytePosition = 0;

    var lByteCount = 0;

    while ( lByteCount < lMessageLength ) {

      lWordCount = (lByteCount-(lByteCount % 4))/4;

      lBytePosition = (lByteCount % 4)*8;

      lWordArray[lWordCount] = (lWordArray[lWordCount] | (string.charCodeAt(lByteCount)<<lBytePosition));

      lByteCount++;

    }

    lWordCount = (lByteCount-(lByteCount % 4))/4;

    lBytePosition = (lByteCount % 4)*8;

    lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80<<lBytePosition);

    lWordArray[lNumberOfWords-2] = lMessageLength<<3;

    lWordArray[lNumberOfWords-1] = lMessageLength>>>29;

    return lWordArray;

  };

  function WordToHex(lValue) {

    var WordToHexValue="",WordToHexValue_temp="",lByte,lCount;

    for (lCount = 0;lCount<=3;lCount++) {

      lByte = (lValue>>>(lCount*8)) & 255;

      WordToHexValue_temp = "0" + lByte.toString(16);

      WordToHexValue = WordToHexValue + WordToHexValue_temp.substr(WordToHexValue_temp.length-2,2);

    }

    return WordToHexValue;

  };

  function Utf8Encode(string) {

    string = string.replace(/\r\n/g,"\n");

    var utftext = "";

    for (var n = 0; n < string.length; n++) {

      var c = string.charCodeAt(n);

      if (c < 128) {

        utftext += String.fromCharCode(c);

      }

      else if((c > 127) && (c < 2048)) {

        utftext += String.fromCharCode((c >> 6) | 192);

        utftext += String.fromCharCode((c & 63) | 128);

      }

      else {

        utftext += String.fromCharCode((c >> 12) | 224);

        utftext += String.fromCharCode(((c >> 6) & 63) | 128);

        utftext += String.fromCharCode((c & 63) | 128);

      }

    }

    return utftext;

  };

  var x=Array();

  var k,AA,BB,CC,DD,a,b,c,d;

  var S11=7, S12=12, S13=17, S14=22;

  var S21=5, S22=9 , S23=14, S24=20;

  var S31=4, S32=11, S33=16, S34=23;

  var S41=6, S42=10, S43=15, S44=21;

  string = Utf8Encode(string);

  x = ConvertToWordArray(string);

  a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476;

  for (k=0;k<x.length;k+=16) {

    AA=a; BB=b; CC=c; DD=d;

    a=FF(a,b,c,d,x[k+0], S11,0xD76AA478);

    d=FF(d,a,b,c,x[k+1], S12,0xE8C7B756);

    c=FF(c,d,a,b,x[k+2], S13,0x242070DB);

    b=FF(b,c,d,a,x[k+3], S14,0xC1BDCEEE);

    a=FF(a,b,c,d,x[k+4], S11,0xF57C0FAF);

    d=FF(d,a,b,c,x[k+5], S12,0x4787C62A);

    c=FF(c,d,a,b,x[k+6], S13,0xA8304613);

    b=FF(b,c,d,a,x[k+7], S14,0xFD469501);

    a=FF(a,b,c,d,x[k+8], S11,0x698098D8);

    d=FF(d,a,b,c,x[k+9], S12,0x8B44F7AF);

    c=FF(c,d,a,b,x[k+10],S13,0xFFFF5BB1);

    b=FF(b,c,d,a,x[k+11],S14,0x895CD7BE);

    a=FF(a,b,c,d,x[k+12],S11,0x6B901122);

    d=FF(d,a,b,c,x[k+13],S12,0xFD987193);

    c=FF(c,d,a,b,x[k+14],S13,0xA679438E);

    b=FF(b,c,d,a,x[k+15],S14,0x49B40821);

    a=GG(a,b,c,d,x[k+1], S21,0xF61E2562);

    d=GG(d,a,b,c,x[k+6], S22,0xC040B340);

    c=GG(c,d,a,b,x[k+11],S23,0x265E5A51);

    b=GG(b,c,d,a,x[k+0], S24,0xE9B6C7AA);

    a=GG(a,b,c,d,x[k+5], S21,0xD62F105D);

    d=GG(d,a,b,c,x[k+10],S22,0x2441453);

    c=GG(c,d,a,b,x[k+15],S23,0xD8A1E681);

    b=GG(b,c,d,a,x[k+4], S24,0xE7D3FBC8);

    a=GG(a,b,c,d,x[k+9], S21,0x21E1CDE6);

    d=GG(d,a,b,c,x[k+14],S22,0xC33707D6);

    c=GG(c,d,a,b,x[k+3], S23,0xF4D50D87);

    b=GG(b,c,d,a,x[k+8], S24,0x455A14ED);

    a=GG(a,b,c,d,x[k+13],S21,0xA9E3E905);

    d=GG(d,a,b,c,x[k+2], S22,0xFCEFA3F8);

    c=GG(c,d,a,b,x[k+7], S23,0x676F02D9);

    b=GG(b,c,d,a,x[k+12],S24,0x8D2A4C8A);

    a=HH(a,b,c,d,x[k+5], S31,0xFFFA3942);

    d=HH(d,a,b,c,x[k+8], S32,0x8771F681);

    c=HH(c,d,a,b,x[k+11],S33,0x6D9D6122);

    b=HH(b,c,d,a,x[k+14],S34,0xFDE5380C);

    a=HH(a,b,c,d,x[k+1], S31,0xA4BEEA44);

    d=HH(d,a,b,c,x[k+4], S32,0x4BDECFA9);

    c=HH(c,d,a,b,x[k+7], S33,0xF6BB4B60);

    b=HH(b,c,d,a,x[k+10],S34,0xBEBFBC70);

    a=HH(a,b,c,d,x[k+13],S31,0x289B7EC6);

    d=HH(d,a,b,c,x[k+0], S32,0xEAA127FA);

    c=HH(c,d,a,b,x[k+3], S33,0xD4EF3085);

    b=HH(b,c,d,a,x[k+6], S34,0x4881D05);

    a=HH(a,b,c,d,x[k+9], S31,0xD9D4D039);

    d=HH(d,a,b,c,x[k+12],S32,0xE6DB99E5);

    c=HH(c,d,a,b,x[k+15],S33,0x1FA27CF8);

    b=HH(b,c,d,a,x[k+2], S34,0xC4AC5665);

    a=II(a,b,c,d,x[k+0], S41,0xF4292244);

    d=II(d,a,b,c,x[k+7], S42,0x432AFF97);

    c=II(c,d,a,b,x[k+14],S43,0xAB9423A7);

    b=II(b,c,d,a,x[k+5], S44,0xFC93A039);

    a=II(a,b,c,d,x[k+12],S41,0x655B59C3);

    d=II(d,a,b,c,x[k+3], S42,0x8F0CCC92);

    c=II(c,d,a,b,x[k+10],S43,0xFFEFF47D);

    b=II(b,c,d,a,x[k+1], S44,0x85845DD1);

    a=II(a,b,c,d,x[k+8], S41,0x6FA87E4F);

    d=II(d,a,b,c,x[k+15],S42,0xFE2CE6E0);

    c=II(c,d,a,b,x[k+6], S43,0xA3014314);

    b=II(b,c,d,a,x[k+13],S44,0x4E0811A1);

    a=II(a,b,c,d,x[k+4], S41,0xF7537E82);

    d=II(d,a,b,c,x[k+11],S42,0xBD3AF235);

    c=II(c,d,a,b,x[k+2], S43,0x2AD7D2BB);

    b=II(b,c,d,a,x[k+9], S44,0xEB86D391);

    a=AddUnsigned(a,AA);

    b=AddUnsigned(b,BB);

    c=AddUnsigned(c,CC);

    d=AddUnsigned(d,DD);

  }

  var temp = WordToHex(a)+WordToHex(b)+WordToHex(c)+WordToHex(d);

  return temp.toLowerCase();

}

</script>

<form action="#" method="post">

<Strong>Enter any text:</strong><br/>

 <input type="text" name="strex" id="strex" size="20" /> <button id="codemd5">MD5 Encrypt</button><br/>

 <strong>MD5 Encrypted Hash String:</Strong><br/>

 <input type="text" name="strmd5" id="strmd5" size="50" />

</form>

<script type="text/javascript">

// Here add the code of the md5() function

// register onclick events for "Get MD5" button

document.getElementById('codemd5').onclick = function() {

  var txt_string = document.getElementById('strex').value;      // gets data from input text

  // encrypts data and adds it in #strmd5 element

  document.getElementById('strmd5').value = md5(txt_string);

  return false;

}

</script>

SHA1 Encrypt Hash in JavaScript

The SHA (Secure Hash Algorithm) can be used to encrypt data for secure transfer between applications and server.

The SHA1() function returns a string with the SHA1 encrypted hash as a string with 40 characters.

It is fully compatible with UTF-8 encoding.

<script type="text/javascript">

/**

*  Secure Hash Algorithm (SHA1)

*  http://ramsis-code.blogspot.in/

**/

function SHA1(msg) {

  function rotate_left(n,s) {

    var t4 = ( n<<s ) | (n>>>(32-s));

    return t4;

  };

  function lsb_hex(val) {

    var str="";

    var i;

    var vh;

    var vl;

    for( i=0; i<=6; i+=2 ) {

      vh = (val>>>(i*4+4))&0x0f;

      vl = (val>>>(i*4))&0x0f;

      str += vh.toString(16) + vl.toString(16);

    }

    return str;

  };

  function cvt_hex(val) {

    var str="";

    var i;

    var v;

    for( i=7; i>=0; i-- ) {

      v = (val>>>(i*4))&0x0f;

      str += v.toString(16);

    }

    return str;

  };

  function Utf8Encode(string) {

    string = string.replace(/\r\n/g,"\n");

    var utftext = "";

    for (var n = 0; n < string.length; n++) {

      var c = string.charCodeAt(n);

      if (c < 128) {

        utftext += String.fromCharCode(c);

      }

      else if((c > 127) && (c < 2048)) {

        utftext += String.fromCharCode((c >> 6) | 192);

        utftext += String.fromCharCode((c & 63) | 128);

      }

      else {

        utftext += String.fromCharCode((c >> 12) | 224);

        utftext += String.fromCharCode(((c >> 6) & 63) | 128);

        utftext += String.fromCharCode((c & 63) | 128);

      }

    }

    return utftext;

  };

  var blockstart;

  var i, j;

  var W = new Array(80);

  var H0 = 0x67452301;

  var H1 = 0xEFCDAB89;

  var H2 = 0x98BADCFE;

  var H3 = 0x10325476;

  var H4 = 0xC3D2E1F0;

  var A, B, C, D, E;

  var temp;

  msg = Utf8Encode(msg);

  var msg_len = msg.length;

  var word_array = new Array();

  for( i=0; i<msg_len-3; i+=4 ) {

    j = msg.charCodeAt(i)<<24 | msg.charCodeAt(i+1)<<16 |

    msg.charCodeAt(i+2)<<8 | msg.charCodeAt(i+3);

    word_array.push( j );

  }

  switch( msg_len % 4 ) {

    case 0:

      i = 0x080000000;

    break;

    case 1:

      i = msg.charCodeAt(msg_len-1)<<24 | 0x0800000;

    break;

    case 2:

      i = msg.charCodeAt(msg_len-2)<<24 | msg.charCodeAt(msg_len-1)<<16 | 0x08000;

    break;

    case 3:

      i = msg.charCodeAt(msg_len-3)<<24 | msg.charCodeAt(msg_len-2)<<16 | msg.charCodeAt(msg_len-1)<<8  | 0x80;

    break;

  }

  word_array.push( i );

  while( (word_array.length % 16) != 14 ) word_array.push( 0 );

  word_array.push( msg_len>>>29 );

  word_array.push( (msg_len<<3)&0x0ffffffff );

  for ( blockstart=0; blockstart<word_array.length; blockstart+=16 ) {

    for( i=0; i<16; i++ ) W[i] = word_array[blockstart+i];

    for( i=16; i<=79; i++ ) W[i] = rotate_left(W[i-3] ^ W[i-8] ^ W[i-14] ^ W[i-16], 1);

    A = H0;

    B = H1;

    C = H2;

    D = H3;

    E = H4;

    for( i= 0; i<=19; i++ ) {

      temp = (rotate_left(A,5) + ((B&C) | (~B&D)) + E + W[i] + 0x5A827999) & 0x0ffffffff;

      E = D;

      D = C;

      C = rotate_left(B,30);

      B = A;

      A = temp;

    }

    for( i=20; i<=39; i++ ) {

      temp = (rotate_left(A,5) + (B ^ C ^ D) + E + W[i] + 0x6ED9EBA1) & 0x0ffffffff;

      E = D;

      D = C;

      C = rotate_left(B,30);

      B = A;

      A = temp;

    }

    for( i=40; i<=59; i++ ) {

      temp = (rotate_left(A,5) + ((B&C) | (B&D) | (C&D)) + E + W[i] + 0x8F1BBCDC) & 0x0ffffffff;

      E = D;

      D = C;

      C = rotate_left(B,30);

      B = A;

      A = temp;

    }

    for( i=60; i<=79; i++ ) {

      temp = (rotate_left(A,5) + (B ^ C ^ D) + E + W[i] + 0xCA62C1D6) & 0x0ffffffff;

      E = D;

      D = C;

      C = rotate_left(B,30);

      B = A;

      A = temp;

    }

    H0 = (H0 + A) & 0x0ffffffff;

    H1 = (H1 + B) & 0x0ffffffff;

    H2 = (H2 + C) & 0x0ffffffff;

    H3 = (H3 + D) & 0x0ffffffff;

    H4 = (H4 + E) & 0x0ffffffff;

  }

  var temp = cvt_hex(H0) + cvt_hex(H1) + cvt_hex(H2) + cvt_hex(H3) + cvt_hex(H4);

  return temp.toLowerCase();

}

</script

<form action="#" method="post">

<Strong>Enter any text:</strong><br/>

<input type="text" name="strex" id="strex" size="20" /> <button id="cryptstr">SHA1 Encrypt</button><br/>

<Strong>SHA1 Encrypted Hash String:</Strong><br/>

<input type="text" name="strcrypt" id="strcrypt" size="50" />

</form>

<script type="text/javascript">

// Here add the code of the SHA1 function

// register onclick events for Encrypt button

document.getElementById('cryptstr').onclick = function() {

var txt_string = document.getElementById('strex').value;    // gets data from input text

// encrypts data and adds it in #strcrypt element

document.getElementById('strcrypt').value = SHA1(txt_string);

return false;

}

</script>

SHA512 Encrypt Hash in JavaScript

The SHA (Secure Hash Algorithm) can be used to encrypt data for secure transfer between server and applications.

The SHA512() function returns a string with the SHA512 encrypted hash as a 128-character hexadecimal string. It is fully compatible with UTF-8 encoding.

<script type="text/javascript">

/*

*  Secure Hash Algorithm (SHA512)

*  http://ramsis-code.blogspot.in/

*/

function SHA512(str) {

  function int64(msint_32, lsint_32) {

    this.highOrder = msint_32;

    this.lowOrder = lsint_32;

  }

  var H = [new int64(0x6a09e667, 0xf3bcc908), new int64(0xbb67ae85, 0x84caa73b),

      new int64(0x3c6ef372, 0xfe94f82b), new int64(0xa54ff53a, 0x5f1d36f1),

      new int64(0x510e527f, 0xade682d1), new int64(0x9b05688c, 0x2b3e6c1f),

      new int64(0x1f83d9ab, 0xfb41bd6b), new int64(0x5be0cd19, 0x137e2179)];

  var K = [new int64(0x428a2f98, 0xd728ae22), new int64(0x71374491, 0x23ef65cd),

      new int64(0xb5c0fbcf, 0xec4d3b2f), new int64(0xe9b5dba5, 0x8189dbbc),

      new int64(0x3956c25b, 0xf348b538), new int64(0x59f111f1, 0xb605d019),

      new int64(0x923f82a4, 0xaf194f9b), new int64(0xab1c5ed5, 0xda6d8118),

      new int64(0xd807aa98, 0xa3030242), new int64(0x12835b01, 0x45706fbe),

      new int64(0x243185be, 0x4ee4b28c), new int64(0x550c7dc3, 0xd5ffb4e2),

      new int64(0x72be5d74, 0xf27b896f), new int64(0x80deb1fe, 0x3b1696b1),

      new int64(0x9bdc06a7, 0x25c71235), new int64(0xc19bf174, 0xcf692694),

      new int64(0xe49b69c1, 0x9ef14ad2), new int64(0xefbe4786, 0x384f25e3),

      new int64(0x0fc19dc6, 0x8b8cd5b5), new int64(0x240ca1cc, 0x77ac9c65),

      new int64(0x2de92c6f, 0x592b0275), new int64(0x4a7484aa, 0x6ea6e483),

      new int64(0x5cb0a9dc, 0xbd41fbd4), new int64(0x76f988da, 0x831153b5),

      new int64(0x983e5152, 0xee66dfab), new int64(0xa831c66d, 0x2db43210),

      new int64(0xb00327c8, 0x98fb213f), new int64(0xbf597fc7, 0xbeef0ee4),

      new int64(0xc6e00bf3, 0x3da88fc2), new int64(0xd5a79147, 0x930aa725),

      new int64(0x06ca6351, 0xe003826f), new int64(0x14292967, 0x0a0e6e70),

      new int64(0x27b70a85, 0x46d22ffc), new int64(0x2e1b2138, 0x5c26c926),

      new int64(0x4d2c6dfc, 0x5ac42aed), new int64(0x53380d13, 0x9d95b3df),

      new int64(0x650a7354, 0x8baf63de), new int64(0x766a0abb, 0x3c77b2a8),

      new int64(0x81c2c92e, 0x47edaee6), new int64(0x92722c85, 0x1482353b),

      new int64(0xa2bfe8a1, 0x4cf10364), new int64(0xa81a664b, 0xbc423001),

      new int64(0xc24b8b70, 0xd0f89791), new int64(0xc76c51a3, 0x0654be30),

      new int64(0xd192e819, 0xd6ef5218), new int64(0xd6990624, 0x5565a910),

      new int64(0xf40e3585, 0x5771202a), new int64(0x106aa070, 0x32bbd1b8),

      new int64(0x19a4c116, 0xb8d2d0c8), new int64(0x1e376c08, 0x5141ab53),

      new int64(0x2748774c, 0xdf8eeb99), new int64(0x34b0bcb5, 0xe19b48a8),

      new int64(0x391c0cb3, 0xc5c95a63), new int64(0x4ed8aa4a, 0xe3418acb),

      new int64(0x5b9cca4f, 0x7763e373), new int64(0x682e6ff3, 0xd6b2b8a3),

      new int64(0x748f82ee, 0x5defb2fc), new int64(0x78a5636f, 0x43172f60),

      new int64(0x84c87814, 0xa1f0ab72), new int64(0x8cc70208, 0x1a6439ec),

      new int64(0x90befffa, 0x23631e28), new int64(0xa4506ceb, 0xde82bde9),

      new int64(0xbef9a3f7, 0xb2c67915), new int64(0xc67178f2, 0xe372532b),

      new int64(0xca273ece, 0xea26619c), new int64(0xd186b8c7, 0x21c0c207),

      new int64(0xeada7dd6, 0xcde0eb1e), new int64(0xf57d4f7f, 0xee6ed178),

      new int64(0x06f067aa, 0x72176fba), new int64(0x0a637dc5, 0xa2c898a6),

      new int64(0x113f9804, 0xbef90dae), new int64(0x1b710b35, 0x131c471b),

      new int64(0x28db77f5, 0x23047d84), new int64(0x32caab7b, 0x40c72493),

      new int64(0x3c9ebe0a, 0x15c9bebc), new int64(0x431d67c4, 0x9c100d4c),

      new int64(0x4cc5d4be, 0xcb3e42b6), new int64(0x597f299c, 0xfc657e2a),

      new int64(0x5fcb6fab, 0x3ad6faec), new int64(0x6c44198c, 0x4a475817)];

  var W = new Array(64);

  var a, b, c, d, e, f, g, h, i, j;

  var T1, T2;

  var charsize = 8;

  function utf8_encode(str) {

    return unescape(encodeURIComponent(str));

  }

  function str2binb(str) {

    var bin = [];

    var mask = (1 << charsize) - 1;

    var len = str.length * charsize;

    for (var i = 0; i < len; i += charsize) {

      bin[i >> 5] |= (str.charCodeAt(i / charsize) & mask) << (32 - charsize - (i % 32));

    }

    return bin;

  }

  function binb2hex(binarray) {

    var hex_tab = "0123456789abcdef";

    var str = "";

    var length = binarray.length * 4;

    var srcByte;

    for (var i = 0; i < length; i += 1) {

      srcByte = binarray[i >> 2] >> ((3 - (i % 4)) * 8);

      str += hex_tab.charAt((srcByte >> 4) & 0xF) + hex_tab.charAt(srcByte & 0xF);

    }

    return str;

  }

  function safe_add_2(x, y) {

    var lsw, msw, lowOrder, highOrder;

    lsw = (x.lowOrder & 0xFFFF) + (y.lowOrder & 0xFFFF);

    msw = (x.lowOrder >>> 16) + (y.lowOrder >>> 16) + (lsw >>> 16);

    lowOrder = ((msw & 0xFFFF) << 16) | (lsw & 0xFFFF);

    lsw = (x.highOrder & 0xFFFF) + (y.highOrder & 0xFFFF) + (msw >>> 16);

    msw = (x.highOrder >>> 16) + (y.highOrder >>> 16) + (lsw >>> 16);

    highOrder = ((msw & 0xFFFF) << 16) | (lsw & 0xFFFF);

    return new int64(highOrder, lowOrder);

  }

  function safe_add_4(a, b, c, d) {

    var lsw, msw, lowOrder, highOrder;

    lsw = (a.lowOrder & 0xFFFF) + (b.lowOrder & 0xFFFF) + (c.lowOrder & 0xFFFF) + (d.lowOrder & 0xFFFF);

    msw = (a.lowOrder >>> 16) + (b.lowOrder >>> 16) + (c.lowOrder >>> 16) + (d.lowOrder >>> 16) + (lsw >>> 16);

    lowOrder = ((msw & 0xFFFF) << 16) | (lsw & 0xFFFF);

    lsw = (a.highOrder & 0xFFFF) + (b.highOrder & 0xFFFF) + (c.highOrder & 0xFFFF) + (d.highOrder & 0xFFFF) + (msw >>> 16);

    msw = (a.highOrder >>> 16) + (b.highOrder >>> 16) + (c.highOrder >>> 16) + (d.highOrder >>> 16) + (lsw >>> 16);

    highOrder = ((msw & 0xFFFF) << 16) | (lsw & 0xFFFF);

    return new int64(highOrder, lowOrder);

  }

  function safe_add_5(a, b, c, d, e) {

    var lsw, msw, lowOrder, highOrder;

    lsw = (a.lowOrder & 0xFFFF) + (b.lowOrder & 0xFFFF) + (c.lowOrder & 0xFFFF) + (d.lowOrder & 0xFFFF) + (e.lowOrder & 0xFFFF);

    msw = (a.lowOrder >>> 16) + (b.lowOrder >>> 16) + (c.lowOrder >>> 16) + (d.lowOrder >>> 16) + (e.lowOrder >>> 16) + (lsw >>> 16);

    lowOrder = ((msw & 0xFFFF) << 16) | (lsw & 0xFFFF);

    lsw = (a.highOrder & 0xFFFF) + (b.highOrder & 0xFFFF) + (c.highOrder & 0xFFFF) + (d.highOrder & 0xFFFF) + (e.highOrder & 0xFFFF) + (msw >>> 16);

    msw = (a.highOrder >>> 16) + (b.highOrder >>> 16) + (c.highOrder >>> 16) + (d.highOrder >>> 16) + (e.highOrder >>> 16) + (lsw >>> 16);

    highOrder = ((msw & 0xFFFF) << 16) | (lsw & 0xFFFF);

    return new int64(highOrder, lowOrder);

  }

  function maj(x, y, z) {

    return new int64(

      (x.highOrder & y.highOrder) ^ (x.highOrder & z.highOrder) ^ (y.highOrder & z.highOrder),

      (x.lowOrder & y.lowOrder) ^ (x.lowOrder & z.lowOrder) ^ (y.lowOrder & z.lowOrder)

    );

  }

  function ch(x, y, z) {

    return new int64(

      (x.highOrder & y.highOrder) ^ (~x.highOrder & z.highOrder),

      (x.lowOrder & y.lowOrder) ^ (~x.lowOrder & z.lowOrder)

    );

  }

  function rotr(x, n) {

    if (n <= 32) {

      return new int64(

       (x.highOrder >>> n) | (x.lowOrder << (32 - n)),

       (x.lowOrder >>> n) | (x.highOrder << (32 - n))

      );

    } else {

      return new int64(

       (x.lowOrder >>> n) | (x.highOrder << (32 - n)),

       (x.highOrder >>> n) | (x.lowOrder << (32 - n))

      );

    }

  }

  function sigma0(x) {

    var rotr28 = rotr(x, 28);

    var rotr34 = rotr(x, 34);

    var rotr39 = rotr(x, 39);

    return new int64(

      rotr28.highOrder ^ rotr34.highOrder ^ rotr39.highOrder,

      rotr28.lowOrder ^ rotr34.lowOrder ^ rotr39.lowOrder

    );

  }

  function sigma1(x) {

    var rotr14 = rotr(x, 14);

    var rotr18 = rotr(x, 18);

    var rotr41 = rotr(x, 41);

    return new int64(

      rotr14.highOrder ^ rotr18.highOrder ^ rotr41.highOrder,

      rotr14.lowOrder ^ rotr18.lowOrder ^ rotr41.lowOrder

    );

  }

  function gamma0(x) {

    var rotr1 = rotr(x, 1), rotr8 = rotr(x, 8), shr7 = shr(x, 7);

    return new int64(

      rotr1.highOrder ^ rotr8.highOrder ^ shr7.highOrder,

      rotr1.lowOrder ^ rotr8.lowOrder ^ shr7.lowOrder

    );

  }

  function gamma1(x) {

    var rotr19 = rotr(x, 19);

    var rotr61 = rotr(x, 61);

    var shr6 = shr(x, 6);

    return new int64(

      rotr19.highOrder ^ rotr61.highOrder ^ shr6.highOrder,

      rotr19.lowOrder ^ rotr61.lowOrder ^ shr6.lowOrder

    );

  }

  function shr(x, n) {

    if (n <= 32) {

      return new int64(

       x.highOrder >>> n,

       x.lowOrder >>> n | (x.highOrder << (32 - n))

      );

    } else {

      return new int64(

       0,

       x.highOrder << (32 - n)

      );

    }

  }

  str = utf8_encode(str);

  strlen = str.length*charsize;

  str = str2binb(str);

  str[strlen >> 5] |= 0x80 << (24 - strlen % 32);

  str[(((strlen + 128) >> 10) << 5) + 31] = strlen;

  for (var i = 0; i < str.length; i += 32) {

    a = H[0];

    b = H[1];

    c = H[2];

    d = H[3];

    e = H[4];

    f = H[5];

    g = H[6];

    h = H[7];

    for (var j = 0; j < 80; j++) {

      if (j < 16) {

       W[j] = new int64(str[j*2 + i], str[j*2 + i + 1]);

      } else {

       W[j] = safe_add_4(gamma1(W[j - 2]), W[j - 7], gamma0(W[j - 15]), W[j - 16]);

      }

      T1 = safe_add_5(h, sigma1(e), ch(e, f, g), K[j], W[j]);

      T2 = safe_add_2(sigma0(a), maj(a, b, c));

      h = g;

      g = f;

      f = e;

      e = safe_add_2(d, T1);

      d = c;

      c = b;

      b = a;

      a = safe_add_2(T1, T2);

    }

    H[0] = safe_add_2(a, H[0]);

    H[1] = safe_add_2(b, H[1]);

    H[2] = safe_add_2(c, H[2]);

    H[3] = safe_add_2(d, H[3]);

    H[4] = safe_add_2(e, H[4]);

    H[5] = safe_add_2(f, H[5]);

    H[6] = safe_add_2(g, H[6]);

    H[7] = safe_add_2(h, H[7]);

  }

  var binarray = [];

  for (var i = 0; i < H.length; i++) {

    binarray.push(H[i].highOrder);

    binarray.push(H[i].lowOrder);

  }

  return binb2hex(binarray);

}

</script>

<form action="#" method="GET">

<strong>Enter any text:</strong><br/>

<input type="text" name="strex" id="strex" size="50" /> <button id="cryptstr">Encrypt</button><br/>

<strong>SHA512 Bit Encrypted Hash String:</strong><br/>

<textarea type="text" name="strcrypt" id="strcrypt" rows="5" cols="50" > </textarea>

</form>

<script type="text/javascript">

// Here add the code of SHA512 function

// register onclick events for Encrypt button

document.getElementById('cryptstr').onclick = function() {

var txt_string = document.getElementById('strex').value;    // gets data from input text

// encrypts data and adds it in #strcrypt element

document.getElementById('strcrypt').value = SHA512(txt_string);

return false;

}

</script>

Create an own method for encode any Text into SHA1 in java

What is SHA ?   

The SHA hash functions are a set of cryptographic hash functions designed by the National Security Agency (NSA) and published by the NIST as a U.S. Federal Information Processing Standard. 

SHA stands for "Secure Hash Algorithm". The three SHA algorithms are structured differently and are distinguished as SHA-0, SHA-1, and SHA-2. The SHA-2 family uses an identical algorithm with a variable digest size which is distinguished as SHA-224, SHA-256, SHA-384, and SHA-512.

Below this code We are using MessageDigest class, first setting it to use SHA-1 algorithm, than feeding it with source data and getting byte array with hash value. To convert this array to hex-string we using our own method convertToHex.

Here is "SHA1DC" class, which single public static method SHA1 returns hexadecimal string representation for SHA1 hash of input argument.

-------------------------------------SHA1DCUSE.java----------------------------------------

package SHA1;

import java.io.BufferedReader; 

import java.io.IOException; 

import java.io.InputStreamReader; 

import java.io.UnsupportedEncodingException; 

import java.security.NoSuchAlgorithmException; 

public class SHA1DCUSE { 

    public static void main(String[] args) throws IOException { 

        BufferedReader userInput = new BufferedReader (new InputStreamReader(System.in));

        System.out.println("Enter string:");

        String rawString = userInput.readLine();

        try { 

            System.out.println("SHA1 Encode: " + SHA1DC.SHA1(rawString));

        } catch (NoSuchAlgorithmException e) { 

            // TODO Auto-generated catch block 

            e.printStackTrace();

        } catch (UnsupportedEncodingException e) { 

            // TODO Auto-generated catch block 

            e.printStackTrace();

        } 

    } 

} 

----------------------------------------SHA1DC.java-------------------------------------------

package SHA1;

import java.io.UnsupportedEncodingException; 

import java.security.MessageDigest; 

import java.security.NoSuchAlgorithmException; 

public class SHA1DC { 

    private static String convertToHex(byte[] data) { 

        StringBuffer buf = new StringBuffer();

        for (int i = 0; i < data.length; i++) { 

            int halfbyte = (data[i] >>> 4) & 0x0F;

            int two_halfs = 0;

            do { 

                if ((0 <= halfbyte) && (halfbyte <= 9)) 

                    buf.append((char) ('0' + halfbyte));

                else 

                    buf.append((char) ('a' + (halfbyte - 10)));

                halfbyte = data[i] & 0x0F;

            } while(two_halfs++ < 1);

        } 

        return buf.toString();

    } 

    public static String SHA1(String text) 

    throws NoSuchAlgorithmException, UnsupportedEncodingException  { 

    MessageDigest md;

    md = MessageDigest.getInstance("SHA-1");

    byte[] sha1hash = new byte[40];

    md.update(text.getBytes("iso-8859-1"), 0, text.length());

    sha1hash = md.digest();

    return convertToHex(sha1hash);

    } 

} 

How to encode Text message into SHA1 and MD5 in java

Encode text in SHA1

import java.security.*;

import java.math.*;

public class SHA1 {

    public static void main(String args[]) throws Exception{

        String txt="Hello Ramsis";

        MessageDigest m=MessageDigest.getInstance("SHA1");

        m.update(txt.getBytes(),0,txt.length());

        System.out.println("SHA1 Code: "+new BigInteger(1,m.digest()).toString(16));

    }

}

//--------------------------------------------------------------------------------------------------

Encode text in MD5

import java.security.*;

import java.math.*;

public class MD5 {

    public static void main(String args[]) throws Exception{

        String txt="Aman";

        MessageDigest m=MessageDigest.getInstance("MD5");

        m.update(txt.getBytes(),0,txt.length());

        System.out.println("MD5 Code: "+new BigInteger(1,m.digest()).toString(16));

    }

}

How to do Auto refresh date in jsp

<%@ page import="java.io.*,java.util.*" %>

<html>

<head>

<title>How we can do Auto refresh date in jsp example</title>

</head>

<body>

<center>

<h2>Auto Refresh Date</h2>

<%

   // Set refresh, autoload time as 5 seconds

   response.setIntHeader("Refresh", 5);

   // Get current time

   Calendar calendar = new GregorianCalendar();

   String am_pm;

int datetoday = calendar.get(Calendar.DATE);

int month = calendar.get(Calendar.MONTH);

int year = calendar.get(Calendar.YEAR);

   int hour = calendar.get(Calendar.HOUR);

   int minute = calendar.get(Calendar.MINUTE);

   int second = calendar.get(Calendar.SECOND);

   if(calendar.get(Calendar.AM_PM) == 0)

      am_pm = "AM";

   else

      am_pm = "PM";

   String CT = hour+":"+ minute +":"+ second +" "+ am_pm;

   out.println("Crrent Time: " + CT + "\n");

out.println("<br/>");

out.println("date (dd/mm/yyyy) :"+datetoday+month+year);

 out.println("<br/>");

out.println("date:"+datetoday);

out.println("month:"+month);

out.println("year:"+year);

%>

</center>

</body>

</html>

How to create Pagination in Jsp

Pagination is a common problem in any language. Which lot of friends are facing it. So here i showing you how to create a pagination in jsp page.

What Is Pagination ?

Fetching thousand and millions of records from database is big time consuming and consumes more almost all CPU power with memory of machine.

If we break thousand of records into small chunks (Pages) with showing 10 or 25 some limited number of records, it will load records very faster and smoothly.

Pagination in JSP achieves by total number of rows and with limit the number of rows in ResultSet. If numbers of records are larger than limit specified rows, it will automatically make page index. It is like google pagination or google pagination index.

//----------------------------- index.jsp ------------------------------------// 

<%@ page language="java" contentType="text/html; charset=ISO-8859-1" %>

<%@ page import="java.sql.PreparedStatement"  %>

<%@ page import="java.sql.ResultSet" %>

<%@ page import="java.sql.Connection" %>

<%@ page import="java.sql.DriverManager" %>

<%!

public int nullIntconv(String str)

{   

    int conv=0;

    if(str==null)

    {

        str="0";

    }

    else if((str.trim()).equals("null"))

    {

        str="0";

    }

    else if(str.equals(""))

    {

        str="0";

    }

    try{

        conv=Integer.parseInt(str);

    }

    catch(Exception e)

    {

    }

    return conv;

}

%>

<%

    Connection conn = null;

    Class.forName("com.mysql.jdbc.Driver").newInstance();

    conn = DriverManager.getConnection("jdbc:mysql://localhost:3306/employee","Username", "password");

    ResultSet rsPagination = null;

    ResultSet rsRowCnt = null;

    

    PreparedStatement psPagination=null;

    PreparedStatement psRowCnt=null;

    

    int iShowRows=5;  // Number of records show on per page

    int iTotalSearchRecords=10;  // Number of pages index shown

    

    int iTotalRows=nullIntconv(request.getParameter("iTotalRows"));

    int iTotalPages=nullIntconv(request.getParameter("iTotalPages"));

    int pageid=nullIntconv(request.getParameter("pageid"));

    int cPageNo=nullIntconv(request.getParameter("cPageNo"));

    

    int iStartResultNo=0;

    int iEndResultNo=0;

    

    if(pageid==0)

    {

        pageid=0;

    }

    else{

        pageid=Math.abs((pageid-1)*iShowRows);

    }

    

    

    String sqlPagination="SELECT SQL_CALC_FOUND_ROWS * FROM employee limit "+pageid+","+iShowRows+"";

    psPagination=conn.prepareStatement(sqlPagination);

    rsPagination=psPagination.executeQuery();

    

    //// this will count total number of rows

     String sqlRowCnt="SELECT FOUND_ROWS() as cnt";

     psRowCnt=conn.prepareStatement(sqlRowCnt);

     rsRowCnt=psRowCnt.executeQuery();

     

     if(rsRowCnt.next())

      {

         iTotalRows=rsRowCnt.getInt("cnt");

      }

%>

<html>

<head>

<title>Pagination of JSP page</title>

</head>

<body>

<form name="frm">

<input type="hidden" name="pageid" value="<%=pageid%>">

<input type="hidden" name="cPageNo" value="<%=cPageNo%>">

<input type="hidden" name="iShowRows" value="<%=iShowRows%>">

<table width="50%" cellpadding="5" cellspacing="0" border="1" >

<tr>

<th>Emp ID</th>

<th>Name</th>

<th>Salary</th>

<th>Department</th>

</tr>

<%

  while(rsPagination.next())

  {

  %>

    <tr>

 <td><%=rsPagination.getString("emp_id")%></td>

      <td><%=rsPagination.getString("emp_name")%></td>

      <td><%=rsPagination.getString("salary")%></td>

      <td><%=rsPagination.getString("dept_name")%></td>

    </tr>

    <% 

 }

 %>

<%

  //// calculate next record start record  and end record 

        try{

            if(iTotalRows<(pageid+iShowRows))

            {

                iEndResultNo=iTotalRows;

            }

            else

            {

                iEndResultNo=(pageid+iShowRows);

            }

           

            iStartResultNo=(pageid+1);

            iTotalPages=((int)(Math.ceil((double)iTotalRows/iShowRows)));

        

        }

        catch(Exception e)

        {

            e.printStackTrace();

        }

%>

<tr>

<td colspan="4">

<div>

<%

        //// index of pages 

        

        int i=0;

        int cPage=0;

        if(iTotalRows!=0)

        {

        cPage=((int)(Math.ceil((double)iEndResultNo/(iTotalSearchRecords*iShowRows))));

        

        int prePageNo=(cPage*iTotalSearchRecords)-((iTotalSearchRecords-1)+iTotalSearchRecords);

        if((cPage*iTotalSearchRecords)-(iTotalSearchRecords)>0)

        {

         %>

          <a href="index.jsp?pageid=<%=prePageNo%>&cPageNo=<%=prePageNo%>"> << Previous</a>

         <%

        }

        

        for(i=((cPage*iTotalSearchRecords)-(iTotalSearchRecords-1));i<=(cPage*iTotalSearchRecords);i++)

        {

          if(i==((pageid/iShowRows)+1))

          {

          %>

           <a href="index.jsp?pageid=<%=i%>" style="cursor:pointer;color: red"><b><%=i%></b></a>

          <%

          }

          else if(i<=iTotalPages)

          {

          %>

           <a href="index.jsp?pageid=<%=i%>"><%=i%></a>

          <% 

          }

        }

        if(iTotalPages>iTotalSearchRecords && i<iTotalPages)

        {

         %>

         <a href="index.jsp?pageid=<%=i%>&cPageNo=<%=i%>"> >> Next</a> 

         <%

        }

        }

      %>

<b>Rows <%=iStartResultNo%> - <%=iEndResultNo%>   Total Result  <%=iTotalRows%> </b>

</div>

</td>

</tr>

</table>

</form>

</body>

</html>

<%

    try{

         if(psPagination!=null){

             psPagination.close();

         }

         if(rsPagination!=null){

             rsPagination.close();

         }

         

         if(psRowCnt!=null){

             psRowCnt.close();

         }

         if(rsRowCnt!=null){

             rsRowCnt.close();

         }

         

         if(conn!=null){

          conn.close();

         }

    }

    catch(Exception e)

    {

        e.printStackTrace();

    }

%>