]>
Dogcows Code - chaz/p5-CGI-Ex/blob - lib/CGI/Ex/sha1.js
2 * Code taken directly from source listed below via the BSD license with two
3 * function added at bottom - Paul Seamons - March 2004
8 * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
10 * Version 2.1 Copyright Paul Johnston 2000 - 2002.
11 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
12 * Distributed under the BSD License
13 * See http://pajhome.org.uk/crypt/md5 for details.
17 * Configurable variables. You may need to tweak these to be compatible with
18 * the server-side, but the defaults work in most cases.
20 var hexcase
= 0; /* hex output format. 0 - lowercase; 1 - uppercase */
21 var b64pad
= ""; /* base-64 pad character. "=" for strict RFC compliance */
22 var chrsz
= 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
25 * These are the functions you'll usually want to call
26 * They take string arguments and return either hex or base-64 encoded strings
28 function hex_sha1(s
){return binb2hex(core_sha1(str2binb(s
),s
.length
* chrsz
));}
29 function b64_sha1(s
){return binb2b64(core_sha1(str2binb(s
),s
.length
* chrsz
));}
30 function str_sha1(s
){return binb2str(core_sha1(str2binb(s
),s
.length
* chrsz
));}
31 function hex_hmac_sha1(key
, data
){ return binb2hex(core_hmac_sha1(key
, data
));}
32 function b64_hmac_sha1(key
, data
){ return binb2b64(core_hmac_sha1(key
, data
));}
33 function str_hmac_sha1(key
, data
){ return binb2str(core_hmac_sha1(key
, data
));}
36 * Perform a simple self-test to see if the VM is working
38 function sha1_vm_test()
40 return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
44 * Calculate the SHA-1 of an array of big-endian words, and a bit length
46 function core_sha1(x
, len
)
49 x
[len
>> 5] |= 0x80 << (24 - len
% 32);
50 x
[((len
+ 64 >> 9) << 4) + 15] = len
;
59 for(var i
= 0; i
< x
.length
; i
+= 16)
67 for(var j
= 0; j
< 80; j
++)
69 if(j
< 16) w
[j
] = x
[i
+ j
];
70 else w
[j
] = rol(w
[j
-3] ^ w
[j
-8] ^ w
[j
-14] ^ w
[j
-16], 1);
71 var t
= safe_add(safe_add(rol(a
, 5), sha1_ft(j
, b
, c
, d
)),
72 safe_add(safe_add(e
, w
[j
]), sha1_kt(j
)));
80 a
= safe_add(a
, olda
);
81 b
= safe_add(b
, oldb
);
82 c
= safe_add(c
, oldc
);
83 d
= safe_add(d
, oldd
);
84 e
= safe_add(e
, olde
);
86 return Array(a
, b
, c
, d
, e
);
91 * Perform the appropriate triplet combination function for the current
94 function sha1_ft(t
, b
, c
, d
)
96 if(t
< 20) return (b
& c
) | ((~b
) & d
);
97 if(t
< 40) return b
^ c
^ d
;
98 if(t
< 60) return (b
& c
) | (b
& d
) | (c
& d
);
103 * Determine the appropriate additive constant for the current iteration
107 return (t
< 20) ? 1518500249 : (t
< 40) ? 1859775393 :
108 (t
< 60) ? -1894007588 : -899497514;
112 * Calculate the HMAC-SHA1 of a key and some data
114 function core_hmac_sha1(key
, data
)
116 var bkey
= str2binb(key
);
117 if(bkey
.length
> 16) bkey
= core_sha1(bkey
, key
.length
* chrsz
);
119 var ipad
= Array(16), opad
= Array(16);
120 for(var i
= 0; i
< 16; i
++)
122 ipad
[i
] = bkey
[i
] ^ 0x36363636;
123 opad
[i
] = bkey
[i
] ^ 0x5C5C5C5C;
126 var hash
= core_sha1(ipad
.concat(str2binb(data
)), 512 + data
.length
* chrsz
);
127 return core_sha1(opad
.concat(hash
), 512 + 160);
131 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
132 * to work around bugs in some JS interpreters.
134 function safe_add(x
, y
)
136 var lsw
= (x
& 0xFFFF) + (y
& 0xFFFF);
137 var msw
= (x
>> 16) + (y
>> 16) + (lsw
>> 16);
138 return (msw
<< 16) | (lsw
& 0xFFFF);
142 * Bitwise rotate a 32-bit number to the left.
144 function rol(num
, cnt
)
146 return (num
<< cnt
) | (num
>>> (32 - cnt
));
150 * Convert an 8-bit or 16-bit string to an array of big-endian words
151 * In 8-bit function, characters >255 have their hi-byte silently ignored.
153 function str2binb(str
)
156 var mask
= (1 << chrsz
) - 1;
157 for(var i
= 0; i
< str
.length
* chrsz
; i
+= chrsz
)
158 bin
[i
>>5] |= (str
.charCodeAt(i
/ chrsz
) & mask
) << (24 - i
%32);
163 * Convert an array of big-endian words to a string
165 function binb2str(bin
)
168 var mask
= (1 << chrsz
) - 1;
169 for(var i
= 0; i
< bin
.length
* 32; i
+= chrsz
)
170 str
+= String
.fromCharCode((bin
[i
>>5] >>> (24 - i
%32)) & mask
);
175 * Convert an array of big-endian words to a hex string.
177 function binb2hex(binarray
)
179 var hex_tab
= hexcase
? "0123456789ABCDEF" : "0123456789abcdef";
181 for(var i
= 0; i
< binarray
.length
* 4; i
++)
183 str
+= hex_tab
.charAt((binarray
[i
>>2] >> ((3 - i
%4)*8+4)) & 0xF) +
184 hex_tab
.charAt((binarray
[i
>>2] >> ((3 - i
%4)*8 )) & 0xF);
190 * Convert an array of big-endian words to a base-64 string
192 function binb2b64(binarray
)
194 var tab
= "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
196 for(var i
= 0; i
< binarray
.length
* 4; i
+= 3)
198 var triplet
= (((binarray
[i
>> 2] >> 8 * (3 - i
%4)) & 0xFF) << 16)
199 | (((binarray
[i
+1 >> 2] >> 8 * (3 - (i
+1)%4)) & 0xFF) << 8 )
200 | ((binarray
[i
+2 >> 2] >> 8 * (3 - (i
+2)%4)) & 0xFF);
201 for(var j
= 0; j
< 4; j
++)
203 if(i
* 8 + j
* 6 > binarray
.length
* 32) str
+= b64pad
;
204 else str
+= tab
.charAt((triplet
>> 6*(3-j
)) & 0x3F);
210 /* simple sub added so we can test for existance */
211 document
.sha1_hex = function (s
) {
215 document
.sha1_is_functional = function () {
216 return sha1_vm_test();
This page took 0.047644 seconds and 4 git commands to generate.