/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */ /* SHA-1 (FIPS 180-4) implementation in JavaScript (c) Chris Veness 2002-2016 */ /* MIT Licence */ /* www.movable-type.co.uk/scripts/sha1.html */ /* */ /* - see http://csrc.nist.gov/groups/ST/toolkit/secure_hashing.html */ /* http://csrc.nist.gov/groups/ST/toolkit/examples.html */ /* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */ 'use strict'; function f(s, x, y, z) { switch (s) { case 0: return (x & y) ^ (~x & z); // Ch() case 1: return x ^ y ^ z; // Parity() case 2: return (x & y) ^ (x & z) ^ (y & z); // Maj() case 3: return x ^ y ^ z; // Parity() } } function ROTL(x, n) { return (x<>>(32-n)); } var Sha1 = {}; Sha1.hash = function(msg, options) { var defaults = { msgFormat: 'string', outFormat: 'hex' }; var opt = Object.assign(defaults, options); switch (opt.msgFormat) { default: // default is to convert string to UTF-8, as SHA only deals with byte-streams case 'string': msg = Sha1.utf8Encode(msg); break; case 'hex-bytes':msg = Sha1.hexBytesToString(msg); break; // mostly for running tests } // constants [¤4.2.1] var K = [ 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 ]; // initial hash value [¤5.3.1] var H = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ]; // PREPROCESSING [¤6.1.1] msg += String.fromCharCode(0x80); // add trailing '1' bit (+ 0's padding) to string [¤5.1.1] // convert string msg into 512-bit/16-integer blocks arrays of ints [¤5.2.1] var l = msg.length/4 + 2; // length (in 32-bit integers) of msg + Ô1Õ + appended length var N = Math.ceil(l/16); // number of 16-integer-blocks required to hold 'l' ints var M = new Array(N); for (var i=0; i>> 32, but since JS converts // bitwise-op args to 32 bits, we need to simulate this by arithmetic operators M[N-1][14] = ((msg.length-1)*8) / Math.pow(2, 32); M[N-1][14] = Math.floor(M[N-1][14]); M[N-1][15] = ((msg.length-1)*8) & 0xffffffff; // HASH COMPUTATION [¤6.1.2] for (var i=0; i>> 0' to emulate UInt32 variables) for (var t=0; t<80; t++) { var s = Math.floor(t/20); // seq for blocks of 'f' functions and 'K' constants var T = (ROTL(a,5) + f(s,b,c,d) + e + K[s] + W[t]) >>> 0; e = d; d = c; c = ROTL(b, 30) >>> 0; b = a; a = T; } // 4 - compute the new intermediate hash value (note 'addition modulo 2^32' Ð JavaScript // '>>> 0' coerces to unsigned UInt32 which achieves modulo 2^32 addition) H[0] = (H[0]+a) >>> 0; H[1] = (H[1]+b) >>> 0; H[2] = (H[2]+c) >>> 0; H[3] = (H[3]+d) >>> 0; H[4] = (H[4]+e) >>> 0; } // convert H0..H4 to hex strings (with leading zeros) for (var h=0; h