[Pkg-javascript-commits] [node-create-hash] 01/40: first
Bastien Roucariès
rouca at moszumanska.debian.org
Sat May 27 14:10:33 UTC 2017
This is an automated email from the git hooks/post-receive script.
rouca pushed a commit to branch master
in repository node-create-hash.
commit b5c03ab1d8f98ade1d746b4a72c7d92e2e26f681
Author: Calvin Metcalf <cmetcalf at appgeo.com>
Date: Wed Jan 14 08:00:04 2015 -0500
first
---
create-hash.js | 83 ++++++++++++++++++++++++++++++
helpers.js | 34 +++++++++++++
md5.js | 156 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++
package.json | 32 ++++++++++++
readme.md | 6 +++
test.js | 37 ++++++++++++++
6 files changed, 348 insertions(+)
diff --git a/create-hash.js b/create-hash.js
new file mode 100644
index 0000000..62fc416
--- /dev/null
+++ b/create-hash.js
@@ -0,0 +1,83 @@
+'use strict';
+var createHash = require('sha.js')
+
+var md5 = require('./md5')
+var rmd160 = require('ripemd160')
+var Transform = require('stream').Transform;
+var inherits = require('inherits')
+
+module.exports = function (alg) {
+ if('md5' === alg) return new HashNoConstructor(md5)
+ if('rmd160' === alg) return new HashNoConstructor(rmd160)
+ return new Hash(createHash(alg))
+}
+inherits(HashNoConstructor, Transform)
+
+function HashNoConstructor(hash) {
+ Transform.call(this);
+ this._hash = hash
+ this.buffers = []
+}
+
+HashNoConstructor.prototype._transform = function (data, _, done) {
+ this.buffers.push(data)
+ done()
+}
+HashNoConstructor.prototype._flush = function (done) {
+ var buf = Buffer.concat(this.buffers)
+ var r = this._hash(buf)
+ this.buffers = null
+ this.push(r)
+ done()
+}
+HashNoConstructor.prototype.update = function (data, enc) {
+ this.write(data, enc)
+ return this
+}
+
+HashNoConstructor.prototype.digest = function (enc) {
+ this.end()
+ var outData = new Buffer('')
+ var chunk
+ while ((chunk = this.read())) {
+ outData = Buffer.concat([outData, chunk])
+ }
+ if (enc) {
+ outData = outData.toString(enc)
+ }
+ return outData
+}
+
+inherits(Hash, Transform)
+
+function Hash(hash) {
+ Transform.call(this);
+ this._hash = hash
+}
+
+Hash.prototype._transform = function (data, _, done) {
+ this._hash.update(data)
+ done()
+}
+Hash.prototype._flush = function (done) {
+ this.push(this._hash.digest())
+ this._hash = null
+ done()
+}
+Hash.prototype.update = function (data, enc) {
+ this.write(data, enc)
+ return this
+}
+
+Hash.prototype.digest = function (enc) {
+ this.end()
+ var outData = new Buffer('')
+ var chunk
+ while ((chunk = this.read())) {
+ outData = Buffer.concat([outData, chunk])
+ }
+ if (enc) {
+ outData = outData.toString(enc)
+ }
+ return outData
+}
\ No newline at end of file
diff --git a/helpers.js b/helpers.js
new file mode 100644
index 0000000..33b463d
--- /dev/null
+++ b/helpers.js
@@ -0,0 +1,34 @@
+'use strict';
+var intSize = 4;
+var zeroBuffer = new Buffer(intSize); zeroBuffer.fill(0);
+var chrsz = 8;
+
+function toArray(buf, bigEndian) {
+ if ((buf.length % intSize) !== 0) {
+ var len = buf.length + (intSize - (buf.length % intSize));
+ buf = Buffer.concat([buf, zeroBuffer], len);
+ }
+
+ var arr = [];
+ var fn = bigEndian ? buf.readInt32BE : buf.readInt32LE;
+ for (var i = 0; i < buf.length; i += intSize) {
+ arr.push(fn.call(buf, i));
+ }
+ return arr;
+}
+
+function toBuffer(arr, size, bigEndian) {
+ var buf = new Buffer(size);
+ var fn = bigEndian ? buf.writeInt32BE : buf.writeInt32LE;
+ for (var i = 0; i < arr.length; i++) {
+ fn.call(buf, arr[i], i * 4, true);
+ }
+ return buf;
+}
+
+function hash(buf, fn, hashSize, bigEndian) {
+ if (!Buffer.isBuffer(buf)) buf = new Buffer(buf);
+ var arr = fn(toArray(buf, bigEndian), buf.length * chrsz);
+ return toBuffer(arr, hashSize, bigEndian);
+}
+exports.hash = hash;
\ No newline at end of file
diff --git a/md5.js b/md5.js
new file mode 100644
index 0000000..d2135f4
--- /dev/null
+++ b/md5.js
@@ -0,0 +1,156 @@
+'use strict';
+/*
+ * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
+ * Digest Algorithm, as defined in RFC 1321.
+ * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+ * Distributed under the BSD License
+ * See http://pajhome.org.uk/crypt/md5 for more info.
+ */
+
+var helpers = require('./helpers');
+
+/*
+ * Calculate the MD5 of an array of little-endian words, and a bit length
+ */
+function core_md5(x, len)
+{
+ /* append padding */
+ x[len >> 5] |= 0x80 << ((len) % 32);
+ x[(((len + 64) >>> 9) << 4) + 14] = len;
+
+ var a = 1732584193;
+ var b = -271733879;
+ var c = -1732584194;
+ var d = 271733878;
+
+ for(var i = 0; i < x.length; i += 16)
+ {
+ var olda = a;
+ var oldb = b;
+ var oldc = c;
+ var oldd = d;
+
+ a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
+ d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
+ c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
+ b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
+ a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
+ d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
+ c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
+ b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
+ a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
+ d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
+ c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
+ b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
+ a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
+ d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
+ c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
+ b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
+
+ a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
+ d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
+ c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
+ b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
+ a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
+ d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
+ c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
+ b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
+ a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
+ d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
+ c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
+ b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
+ a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
+ d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
+ c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
+ b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
+
+ a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
+ d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
+ c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
+ b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
+ a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
+ d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
+ c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
+ b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
+ a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
+ d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
+ c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
+ b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
+ a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
+ d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
+ c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
+ b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
+
+ a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
+ d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
+ c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
+ b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
+ a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
+ d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
+ c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
+ b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
+ a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
+ d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
+ c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
+ b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
+ a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
+ d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
+ c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
+ b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
+
+ a = safe_add(a, olda);
+ b = safe_add(b, oldb);
+ c = safe_add(c, oldc);
+ d = safe_add(d, oldd);
+ }
+ return Array(a, b, c, d);
+
+}
+
+/*
+ * These functions implement the four basic operations the algorithm uses.
+ */
+function md5_cmn(q, a, b, x, s, t)
+{
+ return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
+}
+function md5_ff(a, b, c, d, x, s, t)
+{
+ return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
+}
+function md5_gg(a, b, c, d, x, s, t)
+{
+ return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
+}
+function md5_hh(a, b, c, d, x, s, t)
+{
+ return md5_cmn(b ^ c ^ d, a, b, x, s, t);
+}
+function md5_ii(a, b, c, d, x, s, t)
+{
+ return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
+}
+
+/*
+ * Add integers, wrapping at 2^32. This uses 16-bit operations internally
+ * to work around bugs in some JS interpreters.
+ */
+function safe_add(x, y)
+{
+ var lsw = (x & 0xFFFF) + (y & 0xFFFF);
+ var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+ return (msw << 16) | (lsw & 0xFFFF);
+}
+
+/*
+ * Bitwise rotate a 32-bit number to the left.
+ */
+function bit_rol(num, cnt)
+{
+ return (num << cnt) | (num >>> (32 - cnt));
+}
+
+module.exports = function md5(buf) {
+ return helpers.hash(buf, core_md5, 16);
+};
\ No newline at end of file
diff --git a/package.json b/package.json
new file mode 100644
index 0000000..6c67991
--- /dev/null
+++ b/package.json
@@ -0,0 +1,32 @@
+{
+ "name": "create-hash",
+ "version": "1.0.0",
+ "description": "create hashes for browserify",
+ "main": "create-hash.js",
+ "scripts": {
+ "test": "node test.js | tspec"
+ },
+ "repository": {
+ "type": "git",
+ "url": "git at github.com:crypto-browserify/crypto-createHash.git"
+ },
+ "keywords": [
+ "crypto"
+ ],
+ "author": "",
+ "license": "MIT",
+ "bugs": {
+ "url": "https://github.com/crypto-browserify/crypto-createHash/issues"
+ },
+ "homepage": "https://github.com/crypto-browserify/crypto-createHash",
+ "devDependencies": {
+ "hash-test-vectors": "^1.3.2",
+ "tap-spec": "^2.1.2",
+ "tape": "^3.0.3"
+ },
+ "dependencies": {
+ "inherits": "^2.0.1",
+ "ripemd160": "^0.2.1",
+ "sha.js": "^2.3.6"
+ }
+}
diff --git a/readme.md b/readme.md
new file mode 100644
index 0000000..a4ea4ef
--- /dev/null
+++ b/readme.md
@@ -0,0 +1,6 @@
+create-hash
+===
+
+[](https://travis-ci.org/crypto-browserify/crypto-createHash)
+
+Node style hashes for use in the browser.
\ No newline at end of file
diff --git a/test.js b/test.js
new file mode 100644
index 0000000..5cc2324
--- /dev/null
+++ b/test.js
@@ -0,0 +1,37 @@
+var fs = require('fs')
+var test = require('tape')
+
+var algorithms = ['sha1', 'sha224', 'sha256', 'sha384', 'sha512', 'md5', 'rmd160']
+var encodings = [/*'binary',*/ 'hex', 'base64'];
+var vectors = require('hash-test-vectors')
+
+var createHash = require('./create-hash')
+
+algorithms.forEach(function (algorithm) {
+ test('test ' + algorithm + ' against test vectors', function (t) {
+ vectors.forEach(function (obj, i) {
+ var input = new Buffer(obj.input, 'base64')
+ var node = obj[algorithm]
+ var js = createHash(algorithm).update(input).digest('hex')
+ t.equal(js, node, algorithm + '(testVector['+i+']) == ' + node)
+ })
+
+ encodings.forEach(function (encoding) {
+ vectors.forEach(function (obj, i) {
+ var input = new Buffer(obj.input, 'base64').toString(encoding)
+ var node = obj[algorithm]
+ var js = createHash(algorithm).update(input, encoding).digest('hex')
+ t.equal(js, node, algorithm + '(testVector['+i+'], '+encoding+') == ' + node)
+ })
+ });
+ vectors.forEach(function (obj, i) {
+ var input = new Buffer(obj.input, 'base64')
+ var node = obj[algorithm]
+ var hash = createHash(algorithm);
+ hash.end(input)
+ var js = hash.read().toString('hex')
+ t.equal(js, node, algorithm + '(testVector['+i+']) == ' + node)
+ })
+ t.end()
+ })
+});
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-javascript/node-create-hash.git
More information about the Pkg-javascript-commits
mailing list