UnknownObject/js-sha1
1
0
Fork 0
mirror of https://github.com/emn178/js-sha1.git synced 2026-08-13 04:21:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Added

Browse Source 
- update method.
- support Array output.
- support ArrayBuffer output.
- support AMD.
This commit is contained in:
Chen, Yi-Cyuan
2016-12-05 17:00:43 +08:00
parent 731295e355
commit 80d540792b
12 changed files with 556 additions and 310 deletions
Download Patch File Download Diff File Expand all files Collapse all files
.covignore
+1
View File
@@ -1 +1,2 @@
/tests/ /tests/
node_modules/
.gitignore
+2
View File
@@ -1 +1,3 @@
node_modules/ node_modules/
covreporter
my_test
.travis.yml
+5 -6
View File
@@ -1,12 +1,11 @@
language: node_js language: node_js
node_js: node_js:
- "0.11" - "0.12.15"
- "0.10" - "4.5"
- "0.8" - "6.5.0"
before_install: before_install:
- npm install mocha -g - npm install coveralls
- npm install coveralls -g - npm install mocha-lcov-reporter
- npm install mocha-lcov-reporter -g
script: npm run-script coveralls script: npm run-script coveralls
branches: branches:
only: only:
CHANGELOG.md
+36 -23
View File
@@ -1,30 +1,43 @@
# v0.3.0 / 2015-03-04 # Change Log
* Support ArrayBuffer input. ## v0.4.0 / 2016-12-05
* Improve performance. ### Added
- update method.
- support Array output.
- support ArrayBuffer output.
- support AMD.
# v0.2.0 / 2015-02-16 ## v0.3.0 / 2015-03-04
### Added
- support ArrayBuffer input.
### Changed
- improve performance.
* Support byte array input. ## v0.2.0 / 2015-02-16
* Remove ascii parameter. ### Added
* Improve performance. - support byte array input.
* Add test cases. - test cases.
### Removed
- ascii parameter.
### Changed
- improve performance.
# v0.1.3 / 2015-01-07 ## v0.1.3 / 2015-01-07
### Added
- bower package.
- travis.
- coveralls.
### Fixed
- JSHint warnings.
* Add bower package. ## v0.1.2 / 2014-07-27
* Fixed JSHint warnings. ### Fixed
* Add travis. - accents bug.
* Add coveralls.
# v0.1.2 / 2014-07-27 ## v0.1.1 / 2014-01-05
### Changed
- update license.
Fixed accents bug ## v0.1.0 / 2014-01-04
### Added
# v0.1.1 / 2014-01-05 - initial release.
Update license
# v0.1.0 / 2014-01-04
Initial release
LICENSE.txt
+1 -1
View File
@@ -1,4 +1,4 @@
Copyright 2014-2015 emn178@gmail.com Copyright 2014-2016 Chen, Yi-Cyuan
Permission is hereby granted, free of charge, to any person obtaining Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the a copy of this software and associated documentation files (the
README.md
+27 -61
View File
@@ -24,79 +24,45 @@ For node.js, you can use this command to install:
You could use like this: You could use like this:
```JavaScript ```JavaScript
sha1('Message to hash'); sha1('Message to hash');
var hash = sha1.create();
hash.update('Message to hash');
hash.hex();
``` ```
If you use node.js, you should require the module first: If you use node.js, you should require the module first:
```JavaScript ```JavaScript
sha1 = require('js-sha1'); sha1 = require('js-sha1');
``` ```
It supports AMD:
```JavaScript
require(['your/path/sha1.js'], function(sha1) {
// ...
});
```
## Example ## Example
Code
```JavaScript ```JavaScript
sha1(''); sha1(''); // da39a3ee5e6b4b0d3255bfef95601890afd80709
sha1('The quick brown fox jumps over the lazy dog'); sha1('The quick brown fox jumps over the lazy dog'); // 2fd4e1c67a2d28fced849ee1bb76e7391b93eb12
sha1('The quick brown fox jumps over the lazy dog.'); sha1('The quick brown fox jumps over the lazy dog.'); // 408d94384216f890ff7a0c3528e8bed1e0b01621
// It also supports UTF-8 encoding
sha1('中文'); // 7be2d2d20c106eee0836c9bc2b939890a78e8fb3
// It also supports byte `Array`, `Uint8Array`, `ArrayBuffer`
sha1([]); // da39a3ee5e6b4b0d3255bfef95601890afd80709
sha1(new Uint8Array([])); // da39a3ee5e6b4b0d3255bfef95601890afd80709
// Different output
sha1(''); // da39a3ee5e6b4b0d3255bfef95601890afd80709
sha1.hex(''); // da39a3ee5e6b4b0d3255bfef95601890afd80709
sha1.array(''); // [218, 57, 163, 238, 94, 107, 75, 13, 50, 85, 191, 239, 149, 96, 24, 144, 175, 216, 7, 9]
sha1.digest(''); // [218, 57, 163, 238, 94, 107, 75, 13, 50, 85, 191, 239, 149, 96, 24, 144, 175, 216, 7, 9]
sha1.arrayBuffer(''); // ArrayBuffer
``` ```
Output
da39a3ee5e6b4b0d3255bfef95601890afd80709
2fd4e1c67a2d28fced849ee1bb76e7391b93eb12
408d94384216f890ff7a0c3528e8bed1e0b01621
It also supports UTF-8 encoding:
Code
```JavaScript
sha1('中文');
```
Output
7be2d2d20c106eee0836c9bc2b939890a78e8fb3
It also supports byte `Array`, `Uint8Array`, `ArrayBuffer` input:
Code
```JavaScript
sha1([]);
sha1(new Uint8Array([]));
```
Output
da39a3ee5e6b4b0d3255bfef95601890afd80709
da39a3ee5e6b4b0d3255bfef95601890afd80709
## Benchmark
[UTF8](http://jsperf.com/sha1-speed-test/11)
[ASCII](http://jsperf.com/sha1-speed-test/10)
## Extensions
### jQuery
If you prefer jQuery style, you can add following code to add a jQuery extension.
Code
```JavaScript
jQuery.sha1 = sha1;
```
And then you could use like this:
```JavaScript
$.sha1('message');
```
### Prototype
If you prefer prototype style, you can add following code to add a prototype extension.
Code
```JavaScript
String.prototype.sha1 = function() {
return sha1(this);
};
```
And then you could use like this:
```JavaScript
'message'.sha1();
```
## License ## License
The project is released under the [MIT license](http://www.opensource.org/licenses/MIT). The project is released under the [MIT license](http://www.opensource.org/licenses/MIT).
## Contact ## Contact
The project's website is located at https://github.com/emn178/js-sha1 The project's website is located at https://github.com/emn178/js-sha1
Author: emn178@gmail.com Author: Chen, Yi-Cyuan (emn178@gmail.com)
bower.json
+2 -2
View File
@@ -1,7 +1,7 @@
{ {
"name": "js-sha1", "name": "js-sha1",
"version": "0.3.0", "version": "0.4.0",
"main": ["build/sha1.min.js"], "main": ["src/sha1.js"],
"ignore": [ "ignore": [
"samples", "samples",
"tests" "tests"
build/sha1.min.js
Vendored
+9 -7
View File
File diff suppressed because one or more lines are too long
package.json
+9 -4
View File
@@ -1,15 +1,20 @@
{ {
"name": "js-sha1", "name": "js-sha1",
"version": "0.3.0", "version": "0.4.0",
"description": "A simple SHA1 hash function for JavaScript supports UTF-8 encoding.", "description": "A simple SHA1 hash function for JavaScript supports UTF-8 encoding.",
"main": "src/sha1.js", "main": "src/sha1.js",
"devDependencies": { "devDependencies": {
"expect.js": "~0.3.1", "expect.js": "~0.3.1",
"jscoverage": "~0.5.9" "jscoverage": "~0.5.9",
"mocha": "~2.3.4",
"requirejs": "^2.1.22",
"uglifyjs": "~2.4.10"
}, },
"scripts": { "scripts": {
"test": "mocha tests/node-test.js -r jscoverage", "test": "mocha tests/node-test.js -r jscoverage",
"coveralls": "mocha tests/node-test.js -R mocha-lcov-reporter -r jscoverage | coveralls" "report": "mocha tests/node-test.js -r jscoverage --covout=html",
"coveralls": "mocha tests/node-test.js -R mocha-lcov-reporter -r jscoverage | coveralls",
"build": "uglifyjs src/sha1.js --compress --mangle --comments --output build/sha1.min.js"
}, },
"repository": { "repository": {
"type": "git", "type": "git",
@@ -23,7 +28,7 @@
"HMAC" "HMAC"
], ],
"license": "MIT", "license": "MIT",
"author": "emn178 <emn178@gmail.com>", "author": "Chen, Yi-Cyuan <emn178@gmail.com>",
"homepage": "https://github.com/emn178/js-sha1", "homepage": "https://github.com/emn178/js-sha1",
"bugs": { "bugs": {
"url": "https://github.com/emn178/js-sha1/issues" "url": "https://github.com/emn178/js-sha1/issues"
src/sha1.js
+281 -148
View File
@@ -1,52 +1,124 @@
/* /*
* js-sha1 v0.3.0 * [js-sha1]{@link https://github.com/emn178/js-sha1}
* https://github.com/emn178/js-sha1
* *
* Copyright 2014-2015, emn178@gmail.com * @version 0.4.0
* * @author Chen, Yi-Cyuan [emn178@gmail.com]
* Licensed under the MIT license: * @copyright Chen, Yi-Cyuan 2014-2016
* http://www.opensource.org/licenses/MIT * @license MIT
*/ */
;(function(root, undefined){ (function(root) {
'use strict'; 'use strict';
var NODE_JS = typeof(module) != 'undefined'; var NODE_JS = typeof process == 'object' && process.versions && process.versions.node;
if(NODE_JS) { if (NODE_JS) {
root = global; root = global;
} }
var COMMON_JS = !root.JS_SHA1_TEST && typeof module == 'object' && module.exports;
var AMD = typeof define == 'function' && define.amd;
var HEX_CHARS = '0123456789abcdef'.split(''); var HEX_CHARS = '0123456789abcdef'.split('');
var EXTRA = [-2147483648, 8388608, 32768, 128]; var EXTRA = [-2147483648, 8388608, 32768, 128];
var SHIFT = [24, 16, 8, 0]; var SHIFT = [24, 16, 8, 0];
var OUTPUT_TYPES = ['hex', 'array', 'digest', 'arrayBuffer'];
var blocks = []; var blocks = [];
var sha1 = function(message) { var createOutputMethod = function (outputType) {
var notString = typeof(message) != 'string'; return function (message) {
if(notString && message.constructor == ArrayBuffer) { return new Sha1(true).update(message)[outputType]();
message = new Uint8Array(message); };
};
var createMethod = function () {
var method = createOutputMethod('hex');
if (NODE_JS) {
method = nodeWrap(method);
} }
method.create = function () {
return new Sha1();
};
method.update = function (message) {
return method.create().update(message);
};
for (var i = 0;i < OUTPUT_TYPES.length;++i) {
var type = OUTPUT_TYPES[i];
method[type] = createOutputMethod(type);
}
return method;
};
var h0, h1, h2, h3, h4, block = 0, code, end = false, t, f, var nodeWrap = function (method) {
i, j, index = 0, start = 0, bytes = 0, length = message.length; var crypto, Buffer;
try {
if (root.JS_SHA1_TEST) {
throw 'JS_SHA1_TEST';
}
crypto = require('crypto');
Buffer = require('buffer').Buffer;
} catch (e) {
console.log(e);
return method;
}
var nodeMethod = function (message) {
if (typeof message == 'string') {
return crypto.createHash('sha1').update(message, 'utf8').digest('hex');
} else if (message.constructor == ArrayBuffer) {
message = new Uint8Array(message);
} else if (message.length === undefined) {
return method(message);
}
return crypto.createHash('sha1').update(new Buffer(message)).digest('hex');
};
return nodeMethod;
};
h0 = 0x67452301; function Sha1(sharedMemory) {
h1 = 0xEFCDAB89; if (sharedMemory) {
h2 = 0x98BADCFE; blocks[0] = blocks[16] = blocks[1] = blocks[2] = blocks[3] =
h3 = 0x10325476;
h4 = 0xC3D2E1F0;
do {
blocks[0] = block;
blocks[16] = blocks[1] = blocks[2] = blocks[3] =
blocks[4] = blocks[5] = blocks[6] = blocks[7] = blocks[4] = blocks[5] = blocks[6] = blocks[7] =
blocks[8] = blocks[9] = blocks[10] = blocks[11] = blocks[8] = blocks[9] = blocks[10] = blocks[11] =
blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0; blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;
this.blocks = blocks;
} else {
this.blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
}
this.h0 = 0x67452301;
this.h1 = 0xEFCDAB89;
this.h2 = 0x98BADCFE;
this.h3 = 0x10325476;
this.h4 = 0xC3D2E1F0;
this.block = this.start = this.bytes = 0;
this.finalized = this.hashed = false;
this.first = true;
}
Sha1.prototype.update = function (message) {
if (this.finalized) {
return;
}
var notString = typeof(message) != 'string';
if (notString && message.constructor == root.ArrayBuffer) {
message = new Uint8Array(message);
}
var code, index = 0, i, length = message.length || 0, blocks = this.blocks;
while (index < length) {
if (this.hashed) {
this.hashed = false;
blocks[0] = this.block;
blocks[16] = blocks[1] = blocks[2] = blocks[3] =
blocks[4] = blocks[5] = blocks[6] = blocks[7] =
blocks[8] = blocks[9] = blocks[10] = blocks[11] =
blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;
}
if(notString) { if(notString) {
for (i = start;index < length && i < 64; ++index) { for (i = this.start;index < length && i < 64; ++index) {
blocks[i >> 2] |= message[index] << SHIFT[i++ & 3]; blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
} }
} else { } else {
for (i = start;index < length && i < 64; ++index) { for (i = this.start;index < length && i < 64; ++index) {
code = message.charCodeAt(index); code = message.charCodeAt(index);
if (code < 0x80) { if (code < 0x80) {
blocks[i >> 2] |= code << SHIFT[i++ & 3]; blocks[i >> 2] |= code << SHIFT[i++ & 3];
@@ -66,138 +138,172 @@
} }
} }
} }
bytes += i - start;
start = i - 64; this.lastByteIndex = i;
if(index == length) { this.bytes += i - this.start;
blocks[i >> 2] |= EXTRA[i & 3]; if (i >= 64) {
++index; this.block = blocks[16];
this.start = i - 64;
this.hash();
this.hashed = true;
} else {
this.start = i;
} }
block = blocks[16]; }
if(index > length && i < 56) { return this;
blocks[15] = bytes << 3; };
end = true;
Sha1.prototype.finalize = function () {
if (this.finalized) {
return;
}
this.finalized = true;
var blocks = this.blocks, i = this.lastByteIndex;
blocks[16] = this.block;
blocks[i >> 2] |= EXTRA[i & 3];
this.block = blocks[16];
if (i >= 56) {
if (!this.hashed) {
this.hash();
} }
blocks[0] = this.block;
blocks[16] = blocks[1] = blocks[2] = blocks[3] =
blocks[4] = blocks[5] = blocks[6] = blocks[7] =
blocks[8] = blocks[9] = blocks[10] = blocks[11] =
blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;
}
blocks[15] = this.bytes << 3;
this.hash();
};
for(j = 16;j < 80;++j) { Sha1.prototype.hash = function () {
t = blocks[j - 3] ^ blocks[j - 8] ^ blocks[j - 14] ^ blocks[j - 16]; var a = this.h0, b = this.h1, c = this.h2, d = this.h3, e = this.h4;
blocks[j] = (t << 1) | (t >>> 31); var f, j, t, blocks = this.blocks;
}
var a = h0, b = h1, c = h2, d = h3, e = h4; for(j = 16;j < 80;++j) {
for(j = 0;j < 20;j += 5) { t = blocks[j - 3] ^ blocks[j - 8] ^ blocks[j - 14] ^ blocks[j - 16];
f = (b & c) | ((~b) & d); blocks[j] = (t << 1) | (t >>> 31);
t = (a << 5) | (a >>> 27); }
e = t + f + e + 1518500249 + blocks[j] << 0;
b = (b << 30) | (b >>> 2);
f = (a & b) | ((~a) & c); for(j = 0;j < 20;j += 5) {
t = (e << 5) | (e >>> 27); f = (b & c) | ((~b) & d);
d = t + f + d + 1518500249 + blocks[j + 1] << 0; t = (a << 5) | (a >>> 27);
a = (a << 30) | (a >>> 2); e = t + f + e + 1518500249 + blocks[j] << 0;
b = (b << 30) | (b >>> 2);
f = (e & a) | ((~e) & b); f = (a & b) | ((~a) & c);
t = (d << 5) | (d >>> 27); t = (e << 5) | (e >>> 27);
c = t + f + c + 1518500249 + blocks[j + 2] << 0; d = t + f + d + 1518500249 + blocks[j + 1] << 0;
e = (e << 30) | (e >>> 2); a = (a << 30) | (a >>> 2);
f = (d & e) | ((~d) & a); f = (e & a) | ((~e) & b);
t = (c << 5) | (c >>> 27); t = (d << 5) | (d >>> 27);
b = t + f + b + 1518500249 + blocks[j + 3] << 0; c = t + f + c + 1518500249 + blocks[j + 2] << 0;
d = (d << 30) | (d >>> 2); e = (e << 30) | (e >>> 2);
f = (c & d) | ((~c) & e); f = (d & e) | ((~d) & a);
t = (b << 5) | (b >>> 27); t = (c << 5) | (c >>> 27);
a = t + f + a + 1518500249 + blocks[j + 4] << 0; b = t + f + b + 1518500249 + blocks[j + 3] << 0;
c = (c << 30) | (c >>> 2); d = (d << 30) | (d >>> 2);
}
for(;j < 40;j += 5) { f = (c & d) | ((~c) & e);
f = b ^ c ^ d; t = (b << 5) | (b >>> 27);
t = (a << 5) | (a >>> 27); a = t + f + a + 1518500249 + blocks[j + 4] << 0;
e = t + f + e + 1859775393 + blocks[j] << 0; c = (c << 30) | (c >>> 2);
b = (b << 30) | (b >>> 2); }
f = a ^ b ^ c; for(;j < 40;j += 5) {
t = (e << 5) | (e >>> 27); f = b ^ c ^ d;
d = t + f + d + 1859775393 + blocks[j + 1] << 0; t = (a << 5) | (a >>> 27);
a = (a << 30) | (a >>> 2); e = t + f + e + 1859775393 + blocks[j] << 0;
b = (b << 30) | (b >>> 2);
f = e ^ a ^ b; f = a ^ b ^ c;
t = (d << 5) | (d >>> 27); t = (e << 5) | (e >>> 27);
c = t + f + c + 1859775393 + blocks[j + 2] << 0; d = t + f + d + 1859775393 + blocks[j + 1] << 0;
e = (e << 30) | (e >>> 2); a = (a << 30) | (a >>> 2);
f = d ^ e ^ a; f = e ^ a ^ b;
t = (c << 5) | (c >>> 27); t = (d << 5) | (d >>> 27);
b = t + f + b + 1859775393 + blocks[j + 3] << 0; c = t + f + c + 1859775393 + blocks[j + 2] << 0;
d = (d << 30) | (d >>> 2); e = (e << 30) | (e >>> 2);
f = c ^ d ^ e; f = d ^ e ^ a;
t = (b << 5) | (b >>> 27); t = (c << 5) | (c >>> 27);
a = t + f + a + 1859775393 + blocks[j + 4] << 0; b = t + f + b + 1859775393 + blocks[j + 3] << 0;
c = (c << 30) | (c >>> 2); d = (d << 30) | (d >>> 2);
}
for(;j < 60;j += 5) { f = c ^ d ^ e;
f = (b & c) | (b & d) | (c & d); t = (b << 5) | (b >>> 27);
t = (a << 5) | (a >>> 27); a = t + f + a + 1859775393 + blocks[j + 4] << 0;
e = t + f + e - 1894007588 + blocks[j] << 0; c = (c << 30) | (c >>> 2);
b = (b << 30) | (b >>> 2); }
f = (a & b) | (a & c) | (b & c); for(;j < 60;j += 5) {
t = (e << 5) | (e >>> 27); f = (b & c) | (b & d) | (c & d);
d = t + f + d - 1894007588 + blocks[j + 1] << 0; t = (a << 5) | (a >>> 27);
a = (a << 30) | (a >>> 2); e = t + f + e - 1894007588 + blocks[j] << 0;
b = (b << 30) | (b >>> 2);
f = (e & a) | (e & b) | (a & b); f = (a & b) | (a & c) | (b & c);
t = (d << 5) | (d >>> 27); t = (e << 5) | (e >>> 27);
c = t + f + c - 1894007588 + blocks[j + 2] << 0; d = t + f + d - 1894007588 + blocks[j + 1] << 0;
e = (e << 30) | (e >>> 2); a = (a << 30) | (a >>> 2);
f = (d & e) | (d & a) | (e & a); f = (e & a) | (e & b) | (a & b);
t = (c << 5) | (c >>> 27); t = (d << 5) | (d >>> 27);
b = t + f + b - 1894007588 + blocks[j + 3] << 0; c = t + f + c - 1894007588 + blocks[j + 2] << 0;
d = (d << 30) | (d >>> 2); e = (e << 30) | (e >>> 2);
f = (c & d) | (c & e) | (d & e); f = (d & e) | (d & a) | (e & a);
t = (b << 5) | (b >>> 27); t = (c << 5) | (c >>> 27);
a = t + f + a - 1894007588 + blocks[j + 4] << 0; b = t + f + b - 1894007588 + blocks[j + 3] << 0;
c = (c << 30) | (c >>> 2); d = (d << 30) | (d >>> 2);
}
for(;j < 80;j += 5) { f = (c & d) | (c & e) | (d & e);
f = b ^ c ^ d; t = (b << 5) | (b >>> 27);
t = (a << 5) | (a >>> 27); a = t + f + a - 1894007588 + blocks[j + 4] << 0;
e = t + f + e - 899497514 + blocks[j] << 0; c = (c << 30) | (c >>> 2);
b = (b << 30) | (b >>> 2); }
f = a ^ b ^ c; for(;j < 80;j += 5) {
t = (e << 5) | (e >>> 27); f = b ^ c ^ d;
d = t + f + d - 899497514 + blocks[j + 1] << 0; t = (a << 5) | (a >>> 27);
a = (a << 30) | (a >>> 2); e = t + f + e - 899497514 + blocks[j] << 0;
b = (b << 30) | (b >>> 2);
f = e ^ a ^ b; f = a ^ b ^ c;
t = (d << 5) | (d >>> 27); t = (e << 5) | (e >>> 27);
c = t + f + c - 899497514 + blocks[j + 2] << 0; d = t + f + d - 899497514 + blocks[j + 1] << 0;
e = (e << 30) | (e >>> 2); a = (a << 30) | (a >>> 2);
f = d ^ e ^ a; f = e ^ a ^ b;
t = (c << 5) | (c >>> 27); t = (d << 5) | (d >>> 27);
b = t + f + b - 899497514 + blocks[j + 3] << 0; c = t + f + c - 899497514 + blocks[j + 2] << 0;
d = (d << 30) | (d >>> 2); e = (e << 30) | (e >>> 2);
f = c ^ d ^ e; f = d ^ e ^ a;
t = (b << 5) | (b >>> 27); t = (c << 5) | (c >>> 27);
a = t + f + a - 899497514 + blocks[j + 4] << 0; b = t + f + b - 899497514 + blocks[j + 3] << 0;
c = (c << 30) | (c >>> 2); d = (d << 30) | (d >>> 2);
}
h0 = h0 + a << 0; f = c ^ d ^ e;
h1 = h1 + b << 0; t = (b << 5) | (b >>> 27);
h2 = h2 + c << 0; a = t + f + a - 899497514 + blocks[j + 4] << 0;
h3 = h3 + d << 0; c = (c << 30) | (c >>> 2);
h4 = h4 + e << 0; }
} while(!end);
this.h0 = this.h0 + a << 0;
this.h1 = this.h1 + b << 0;
this.h2 = this.h2 + c << 0;
this.h3 = this.h3 + d << 0;
this.h4 = this.h4 + e << 0;
};
Sha1.prototype.hex = function () {
this.finalize();
var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4;
return HEX_CHARS[(h0 >> 28) & 0x0F] + HEX_CHARS[(h0 >> 24) & 0x0F] + return HEX_CHARS[(h0 >> 28) & 0x0F] + HEX_CHARS[(h0 >> 24) & 0x0F] +
HEX_CHARS[(h0 >> 20) & 0x0F] + HEX_CHARS[(h0 >> 16) & 0x0F] + HEX_CHARS[(h0 >> 20) & 0x0F] + HEX_CHARS[(h0 >> 16) & 0x0F] +
@@ -221,20 +327,47 @@
HEX_CHARS[(h4 >> 4) & 0x0F] + HEX_CHARS[h4 & 0x0F]; HEX_CHARS[(h4 >> 4) & 0x0F] + HEX_CHARS[h4 & 0x0F];
}; };
if(!root.JS_SHA1_TEST && typeof(module) != 'undefined') { Sha1.prototype.toString = Sha1.prototype.hex;
var crypto = require('crypto');
var Buffer = require('buffer').Buffer;
module.exports = function(message) { Sha1.prototype.digest = function () {
if(typeof(message) == 'string') { this.finalize();
return crypto.createHash('sha1').update(message, 'utf8').digest('hex');
} var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4;
if(message.constructor == ArrayBuffer) {
message = new Uint8Array(message); return [
} (h0 >> 24) & 0xFF, (h0 >> 16) & 0xFF, (h0 >> 8) & 0xFF, h0 & 0xFF,
return crypto.createHash('sha1').update(new Buffer(message)).digest('hex'); (h1 >> 24) & 0xFF, (h1 >> 16) & 0xFF, (h1 >> 8) & 0xFF, h1 & 0xFF,
}; (h2 >> 24) & 0xFF, (h2 >> 16) & 0xFF, (h2 >> 8) & 0xFF, h2 & 0xFF,
} else if(root) { (h3 >> 24) & 0xFF, (h3 >> 16) & 0xFF, (h3 >> 8) & 0xFF, h3 & 0xFF,
root.sha1 = sha1; (h4 >> 24) & 0xFF, (h4 >> 16) & 0xFF, (h4 >> 8) & 0xFF, h4 & 0xFF
];
};
Sha1.prototype.array = Sha1.prototype.digest;
Sha1.prototype.arrayBuffer = function () {
this.finalize();
var buffer = new ArrayBuffer(20);
var dataView = new DataView(buffer);
dataView.setUint32(0, this.h0);
dataView.setUint32(4, this.h1);
dataView.setUint32(8, this.h2);
dataView.setUint32(12, this.h3);
dataView.setUint32(16, this.h4);
return buffer;
};
var exports = createMethod();
if (COMMON_JS) {
module.exports = exports;
} else {
root.sha1 = exports;
if (AMD) {
define(function () {
return exports;
});
}
} }
}(this)); }(this));
tests/node-test.js
+12
View File
@@ -9,3 +9,15 @@ sha1 = null;
JS_SHA1_TEST = true; JS_SHA1_TEST = true;
require('../src/sha1.js'); require('../src/sha1.js');
require('./test.js'); require('./test.js');
delete require.cache[require.resolve('../src/sha1.js')];
delete require.cache[require.resolve('./test.js')];
sha1 = null;
define = function (func) {
sha1 = func();
require('./test.js');
};
define.amd = true;
require('../src/sha1.js');
tests/test.js
+171 -58
View File
@@ -1,66 +1,179 @@
(function(sha1) { (function(sha1) {
describe('ascii', function() { Array.prototype.toHexString = ArrayBuffer.prototype.toHexString = function () {
describe('less than 64 bytes', function() { var array = new Uint8Array(this);
it('should be successful', function() { var hex = '';
expect(sha1('')).to.be('da39a3ee5e6b4b0d3255bfef95601890afd80709'); for (var i = 0;i < array.length;++i) {
expect(sha1('The quick brown fox jumps over the lazy dog')).to.be('2fd4e1c67a2d28fced849ee1bb76e7391b93eb12'); var c = array[i].toString('16');
expect(sha1('The quick brown fox jumps over the lazy dog.')).to.be('408d94384216f890ff7a0c3528e8bed1e0b01621'); hex += c.length == 1 ? '0' + c : c;
}); }
}); return hex;
};
describe('more than 64 bytes', function() { var testCases = {
it('should be successful', function() { 'ascii': {
expect(sha1('The MD5 message-digest algorithm is a widely used cryptographic hash function producing a 128-bit (16-byte) hash value, typically expressed in text format as a 32 digit hexadecimal number. MD5 has been utilized in a wide variety of cryptographic applications, and is also commonly used to verify data integrity.')).to.be('8690faab7755408a03875895176fac318f14a699'); 'da39a3ee5e6b4b0d3255bfef95601890afd80709': '',
}); '2fd4e1c67a2d28fced849ee1bb76e7391b93eb12': 'The quick brown fox jumps over the lazy dog',
'408d94384216f890ff7a0c3528e8bed1e0b01621': 'The quick brown fox jumps over the lazy dog.'
},
'ascii more than 64 bytes': {
'8690faab7755408a03875895176fac318f14a699': 'The MD5 message-digest algorithm is a widely used cryptographic hash function producing a 128-bit (16-byte) hash value, typically expressed in text format as a 32 digit hexadecimal number. MD5 has been utilized in a wide variety of cryptographic applications, and is also commonly used to verify data integrity.'
},
'UTF8': {
'7be2d2d20c106eee0836c9bc2b939890a78e8fb3': '中文',
'9e4e5d978deced901d621475b03f1ded19e945bf': 'aécio',
'4667688a63420661469c8dbc0f871770349bab08': '𠜎'
},
'UTF8 more than 64 bytes': {
'ad8aae581c915fe01c4964a5e8b322cae74ee5c5': '訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一',
'3a15ad3ce9efdd4bf982eaaaecdeda36a887a3f9': '訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。'
},
'special length': {
'4cdeae78e8b7285aef73e0a15eec7d5b30f3f3e3': '0123456780123456780123456780123456780123456780123456780',
'e657e6bb6b5d0c2bf7e929451c14a5302589a60b': '01234567801234567801234567801234567801234567801234567801',
'e7ad97591c1a99d54d80751d341899769884c75a': '0123456780123456780123456780123456780123456780123456780123456780',
'55a13698cdc010c0d16dab2f7dc10f43a713f12f': '01234567801234567801234567801234567801234567801234567801234567801234567',
'006575418c27b0158e55a6d261c46f86b33a496a': '012345678012345678012345678012345678012345678012345678012345678012345678'
},
'Array': {
'da39a3ee5e6b4b0d3255bfef95601890afd80709': [],
'2fd4e1c67a2d28fced849ee1bb76e7391b93eb12': [84, 104, 101, 32, 113, 117, 105, 99, 107, 32, 98, 114, 111, 119, 110, 32, 102, 111, 120, 32, 106, 117, 109, 112, 115, 32, 111, 118, 101, 114, 32, 116, 104, 101, 32, 108, 97, 122, 121, 32, 100, 111, 103],
'55a13698cdc010c0d16dab2f7dc10f43a713f12f': [48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55]
},
'Uint8Array': {
'2fd4e1c67a2d28fced849ee1bb76e7391b93eb12': new Uint8Array([84, 104, 101, 32, 113, 117, 105, 99, 107, 32, 98, 114, 111, 119, 110, 32, 102, 111, 120, 32, 106, 117, 109, 112, 115, 32, 111, 118, 101, 114, 32, 116, 104, 101, 32, 108, 97, 122, 121, 32, 100, 111, 103])
},
'Int8Array': {
'2fd4e1c67a2d28fced849ee1bb76e7391b93eb12': new Int8Array([84, 104, 101, 32, 113, 117, 105, 99, 107, 32, 98, 114, 111, 119, 110, 32, 102, 111, 120, 32, 106, 117, 109, 112, 115, 32, 111, 118, 101, 114, 32, 116, 104, 101, 32, 108, 97, 122, 121, 32, 100, 111, 103])
},
'ArrayBuffer': {
'5ba93c9db0cff93f52b521d7420e43f6eda2784f': new ArrayBuffer(1)
},
'Object': {
'da39a3ee5e6b4b0d3255bfef95601890afd80709': {},
'da39a3ee5e6b4b0d3255bfef95601890afd80709': {what: 'ever'}
}
};
if (typeof process == 'object') {
testCases['Buffer'] = {
'da39a3ee5e6b4b0d3255bfef95601890afd80709': new Buffer(0),
'2fd4e1c67a2d28fced849ee1bb76e7391b93eb12': new Buffer(new Uint8Array([84, 104, 101, 32, 113, 117, 105, 99, 107, 32, 98, 114, 111, 119, 110, 32, 102, 111, 120, 32, 106, 117, 109, 112, 115, 32, 111, 118, 101, 114, 32, 116, 104, 101, 32, 108, 97, 122, 121, 32, 100, 111, 103]))
}
}
var methods = [
{
name: 'sha1',
call: sha1,
},
{
name: 'sha1.hex',
call: sha1.hex
},
{
name: 'sha1.array',
call: function (message) {
return sha1.array(message).toHexString();
}
},
{
name: 'sha1.digest',
call: function (message) {
return sha1.digest(message).toHexString();
}
},
{
name: 'sha1.arrayBuffer',
call: function (message) {
return sha1.arrayBuffer(message).toHexString();
}
}
];
var classMethods = [
{
name: 'create',
call: function (message) {
return sha1.create().update(message).toString();
}
},
{
name: 'update',
call: function (message) {
return sha1.update(message).toString();
}
},
{
name: 'hex',
call: function (message) {
return sha1.update(message).hex();
}
},
{
name: 'array',
call: function (message) {
return sha1.update(message).array().toHexString();
}
},
{
name: 'digest',
call: function (message) {
return sha1.update(message).digest().toHexString();
}
},
{
name: 'arrayBuffer',
call: function (message) {
return sha1.update(message).arrayBuffer().toHexString();
}
},
{
name: 'finalize',
call: function (message) {
var hash = sha1.update(message);
hash.hex();
hash.update(message);
return hash.hex();
}
}
];
methods.forEach(function (method) {
describe('#' + method.name, function () {
for (var testCaseName in testCases) {
(function (testCaseName) {
var testCase = testCases[testCaseName];
context('when ' + testCaseName, function () {
for (var hash in testCase) {
(function (message, hash) {
it('should be equal', function () {
expect(method.call(message)).to.be(hash);
});
})(testCase[hash], hash);
}
});
})(testCaseName);
}
}); });
}); });
describe('UTF8', function() { describe('Sha1', function () {
describe('less than 64 bytes', function() { classMethods.forEach(function (method) {
it('should be successful', function() { describe('#' + method.name, function () {
expect(sha1('中文')).to.be('7be2d2d20c106eee0836c9bc2b939890a78e8fb3'); for (var testCaseName in testCases) {
expect(sha1('aécio')).to.be('9e4e5d978deced901d621475b03f1ded19e945bf'); (function (testCaseName) {
expect(sha1('𠜎')).to.be('4667688a63420661469c8dbc0f871770349bab08'); var testCase = testCases[testCaseName];
}); context('when ' + testCaseName, function () {
}); for (var hash in testCase) {
(function (message, hash) {
describe('more than 64 bytes', function() { it('should be equal', function () {
it('should be successful', function() { expect(method.call(message)).to.be(hash);
expect(sha1('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('ad8aae581c915fe01c4964a5e8b322cae74ee5c5'); });
expect(sha1('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('3a15ad3ce9efdd4bf982eaaaecdeda36a887a3f9'); })(testCase[hash], hash);
}); }
}); });
}); })(testCaseName);
}
describe('special length', function() {
it('should be successful', function() {
expect(sha1('0123456780123456780123456780123456780123456780123456780')).to.be('4cdeae78e8b7285aef73e0a15eec7d5b30f3f3e3');
expect(sha1('01234567801234567801234567801234567801234567801234567801')).to.be('e657e6bb6b5d0c2bf7e929451c14a5302589a60b');
expect(sha1('0123456780123456780123456780123456780123456780123456780123456780')).to.be('e7ad97591c1a99d54d80751d341899769884c75a');
expect(sha1('01234567801234567801234567801234567801234567801234567801234567801234567')).to.be('55a13698cdc010c0d16dab2f7dc10f43a713f12f');
expect(sha1('012345678012345678012345678012345678012345678012345678012345678012345678')).to.be('006575418c27b0158e55a6d261c46f86b33a496a');
});
});
describe('Array', function() {
describe('Array', function() {
it('should be successful', function() {
expect(sha1([])).to.be('da39a3ee5e6b4b0d3255bfef95601890afd80709');
expect(sha1([84, 104, 101, 32, 113, 117, 105, 99, 107, 32, 98, 114, 111, 119, 110, 32, 102, 111, 120, 32, 106, 117, 109, 112, 115, 32, 111, 118, 101, 114, 32, 116, 104, 101, 32, 108, 97, 122, 121, 32, 100, 111, 103])).to.be('2fd4e1c67a2d28fced849ee1bb76e7391b93eb12');
expect(sha1([48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55, 56, 48, 49, 50, 51, 52, 53, 54, 55])).to.be('55a13698cdc010c0d16dab2f7dc10f43a713f12f');
});
});
describe('Uint8Array', function() {
it('should be successful', function() {
expect(sha1(new Uint8Array([]))).to.be('da39a3ee5e6b4b0d3255bfef95601890afd80709');
});
});
describe('ArrayBuffer', function() {
it('should be successful', function() {
expect(sha1(new ArrayBuffer(0))).to.be('da39a3ee5e6b4b0d3255bfef95601890afd80709');
expect(sha1(new ArrayBuffer(1))).to.be('5ba93c9db0cff93f52b521d7420e43f6eda2784f');
}); });
}); });
}); });