Skip to content

Instantly share code, notes, and snippets.

@daoiqi
Created June 3, 2014 03:04
Show Gist options
  • Save daoiqi/4dee306de59649c38243 to your computer and use it in GitHub Desktop.
Save daoiqi/4dee306de59649c38243 to your computer and use it in GitHub Desktop.
jquery sha1 plugin
/**
* jQuery SHA1 hash algorithm function
*
* <code>
* Calculate the sha1 hash of a String
* String $.sha1 ( String str )
* </code>
*
* Calculates the sha1 hash of str using the US Secure Hash Algorithm 1.
* SHA-1 the Secure Hash Algorithm (SHA) was developed by NIST and is specified in the Secure Hash Standard (SHS, FIPS 180).
* This script is used to process variable length message into a fixed-length output using the SHA-1 algorithm. It is fully compatible with UTF-8 encoding.
* If you plan using UTF-8 encoding in your project don't forget to set the page encoding to UTF-8 (Content-Type meta tag).
* This function orginally get from the WebToolkit and rewrite for using as the jQuery plugin.
*
* Example
* Code
* <code>
* $.sha1("I'm Persian.");
* </code>
* Result
* <code>
* "1d302f9dc925d62fc859055999d2052e274513ed"
* </code>
*
* @alias Muhammad Hussein Fattahizadeh < muhammad [AT] semnanweb [DOT] com >
* @link http://www.semnanweb.com/jquery-plugin/sha1.html
* @see http://www.webtoolkit.info/
* @license http://www.gnu.org/licenses/gpl.html [GNU General Public License]
* @param {jQuery} {sha1:function(string))
* @return string
*/
(function($){
var rotateLeft = function(lValue, iShiftBits) {
return (lValue << iShiftBits) | (lValue >>> (32 - iShiftBits));
}
var lsbHex = function(value) {
var string = "";
var i;
var vh;
var vl;
for(i = 0;i <= 6;i += 2) {
vh = (value>>>(i * 4 + 4))&0x0f;
vl = (value>>>(i*4))&0x0f;
string += vh.toString(16) + vl.toString(16);
}
return string;
};
var cvtHex = function(value) {
var string = "";
var i;
var v;
for(i = 7;i >= 0;i--) {
v = (value>>>(i * 4))&0x0f;
string += v.toString(16);
}
return string;
};
var uTF8Encode = function(string) {
string = string.replace(/\x0d\x0a/g, "\x0a");
var output = "";
for (var n = 0; n < string.length; n++) {
var c = string.charCodeAt(n);
if (c < 128) {
output += String.fromCharCode(c);
} else if ((c > 127) && (c < 2048)) {
output += String.fromCharCode((c >> 6) | 192);
output += String.fromCharCode((c & 63) | 128);
} else {
output += String.fromCharCode((c >> 12) | 224);
output += String.fromCharCode(((c >> 6) & 63) | 128);
output += String.fromCharCode((c & 63) | 128);
}
}
return output;
};
$.extend({
sha1: function(string) {
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 tempValue;
string = uTF8Encode(string);
var stringLength = string.length;
var wordArray = new Array();
for(i = 0;i < stringLength - 3;i += 4) {
j = string.charCodeAt(i)<<24 | string.charCodeAt(i + 1)<<16 | string.charCodeAt(i + 2)<<8 | string.charCodeAt(i + 3);
wordArray.push(j);
}
switch(stringLength % 4) {
case 0:
i = 0x080000000;
break;
case 1:
i = string.charCodeAt(stringLength - 1)<<24 | 0x0800000;
break;
case 2:
i = string.charCodeAt(stringLength - 2)<<24 | string.charCodeAt(stringLength - 1)<<16 | 0x08000;
break;
case 3:
i = string.charCodeAt(stringLength - 3)<<24 | string.charCodeAt(stringLength - 2)<<16 | string.charCodeAt(stringLength - 1)<<8 | 0x80;
break;
}
wordArray.push(i);
while((wordArray.length % 16) != 14 ) wordArray.push(0);
wordArray.push(stringLength>>>29);
wordArray.push((stringLength<<3)&0x0ffffffff);
for(blockstart = 0;blockstart < wordArray.length;blockstart += 16) {
for(i = 0;i < 16;i++) W[i] = wordArray[blockstart+i];
for(i = 16;i <= 79;i++) W[i] = rotateLeft(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++) {
tempValue = (rotateLeft(A, 5) + ((B&C) | (~B&D)) + E + W[i] + 0x5A827999) & 0x0ffffffff;
E = D;
D = C;
C = rotateLeft(B, 30);
B = A;
A = tempValue;
}
for(i = 20;i <= 39;i++) {
tempValue = (rotateLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0x6ED9EBA1) & 0x0ffffffff;
E = D;
D = C;
C = rotateLeft(B, 30);
B = A;
A = tempValue;
}
for(i = 40;i <= 59;i++) {
tempValue = (rotateLeft(A, 5) + ((B&C) | (B&D) | (C&D)) + E + W[i] + 0x8F1BBCDC) & 0x0ffffffff;
E = D;
D = C;
C = rotateLeft(B, 30);
B = A;
A = tempValue;
}
for(i = 60;i <= 79;i++) {
tempValue = (rotateLeft(A, 5) + (B ^ C ^ D) + E + W[i] + 0xCA62C1D6) & 0x0ffffffff;
E = D;
D = C;
C = rotateLeft(B, 30);
B = A;
A = tempValue;
}
H0 = (H0 + A) & 0x0ffffffff;
H1 = (H1 + B) & 0x0ffffffff;
H2 = (H2 + C) & 0x0ffffffff;
H3 = (H3 + D) & 0x0ffffffff;
H4 = (H4 + E) & 0x0ffffffff;
}
tempValue = cvtHex(H0) + cvtHex(H1) + cvtHex(H2) + cvtHex(H3) + cvtHex(H4);
return tempValue.toLowerCase();
}
});
})(jQuery);
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment