mirror of
https://github.com/emn178/js-sha256.git
synced 2026-08-12 20:32:16 +08:00
Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
 Chen Yi-Cyuan
|
1ff17fbdd9 | ||
|
Chen Yi-Cyuan
|
f73267ad15 | ||
|
emn178
|
18457729c8 | ||
|
emn178
|
90136f7a05 | ||
|
Chen Yi-Cyuan
|
009d7b6070 | ||
|
Chen Yi-Cyuan
|
8754ac17ef | ||
|
emn178
|
c016df9256 | ||
|
Chen Yi-Cyuan
|
f0ba196020 | ||
|
Chen Yi-Cyuan
|
5df847f0e0 |
@@ -1 +1,2 @@
|
||||
/tests/
|
||||
node_modules/
|
||||
|
||||
@@ -1 +1,2 @@
|
||||
node_modules/
|
||||
covreporter
|
||||
|
||||
@@ -0,0 +1,3 @@
|
||||
covreporter
|
||||
build
|
||||
tests
|
||||
+5
-4
@@ -3,10 +3,11 @@ node_js:
|
||||
- "0.11"
|
||||
- "0.10"
|
||||
- "0.8"
|
||||
install:
|
||||
before_install:
|
||||
- npm install mocha -g
|
||||
- npm install coveralls -g
|
||||
- npm install mocha-lcov-reporter -g
|
||||
- npm install
|
||||
script:
|
||||
- npm run-script coveralls
|
||||
script: npm run-script coveralls
|
||||
branches:
|
||||
only:
|
||||
- master
|
||||
|
||||
@@ -1,3 +1,30 @@
|
||||
# v0.3.0 / 2015-05-23
|
||||
|
||||
* Support ArrayBuffer input.
|
||||
|
||||
# v0.2.3 / 2015-02-11
|
||||
|
||||
* Support byte array input.
|
||||
|
||||
# v0.2.2 / 2015-02-10
|
||||
|
||||
* Improve performance.
|
||||
|
||||
# v0.2.1 / 2015-02-05
|
||||
|
||||
* Fixed special length bug.
|
||||
* Add test cases.
|
||||
|
||||
# v0.2.0 / 2015-02-03
|
||||
|
||||
* Remove ascii parameter.
|
||||
* Improve performance.
|
||||
* Add test cases.
|
||||
|
||||
# v0.1.4 / 2015-01-24
|
||||
|
||||
* Improve performance.
|
||||
|
||||
# v0.1.3 / 2015-01-09
|
||||
|
||||
* Improve performance.
|
||||
|
||||
+3
-1
@@ -1,4 +1,6 @@
|
||||
Copyright 2014-2015 emn178@gmail.com
|
||||
Copyright (c) 2015 Chen Yi-Cyuan
|
||||
|
||||
MIT License
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining
|
||||
a copy of this software and associated documentation files (the
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
# js-sha256
|
||||
[](https://travis-ci.org/emn178/js-sha256)
|
||||
[](https://coveralls.io/r/emn178/js-sha256?branch=master)
|
||||
[](https://travis-ci.org/emn178/js-sha256)
|
||||
[](https://coveralls.io/r/emn178/js-sha256?branch=master)
|
||||
[](https://nodei.co/npm/js-sha256/)
|
||||
A simple SHA-256 / SHA-224 hash function for JavaScript supports UTF-8 encoding.
|
||||
|
||||
@@ -37,41 +37,15 @@ sha256 = require('js-sha256').sha256;
|
||||
sha224 = require('js-sha256').sha224;
|
||||
```
|
||||
|
||||
### Methods
|
||||
|
||||
#### sha256(str, asciiOnly)
|
||||
|
||||
Hash string to sha256, set asciiOnly to true for better performace if you ensure input is ascii.
|
||||
|
||||
##### *str: `String`*
|
||||
|
||||
String to hash.
|
||||
|
||||
##### *asciiOnly: `Boolean` (default: `false`)*
|
||||
|
||||
Specify the string encoding is ASCII.
|
||||
|
||||
#### sha224(str, asciiOnly)
|
||||
|
||||
Hash string to sha224, set asciiOnly to true for better performace if you ensure input is ascii.
|
||||
|
||||
##### *str: `String`*
|
||||
|
||||
String to hash.
|
||||
|
||||
##### *asciiOnly: `Boolean` (default: `false`)*
|
||||
|
||||
Specify the string encoding is ASCII.
|
||||
|
||||
## Example
|
||||
Code
|
||||
```JavaScript
|
||||
sha256('');
|
||||
sha256('The quick brown fox jumps over the lazy dog', true);
|
||||
sha256('The quick brown fox jumps over the lazy dog.', true);
|
||||
sha256('The quick brown fox jumps over the lazy dog');
|
||||
sha256('The quick brown fox jumps over the lazy dog.');
|
||||
sha224('');
|
||||
sha224('The quick brown fox jumps over the lazy dog', true);
|
||||
sha224('The quick brown fox jumps over the lazy dog.', true);
|
||||
sha224('The quick brown fox jumps over the lazy dog');
|
||||
sha224('The quick brown fox jumps over the lazy dog.');
|
||||
```
|
||||
Output
|
||||
|
||||
@@ -94,9 +68,21 @@ Output
|
||||
72726d8818f693066ceb69afa364218b692e62ea92b385782363780f47529c21
|
||||
dfbab71afdf54388af4d55f8bd3de8c9b15e0eb916bf9125f4a959d4
|
||||
|
||||
It also supports byte `Array`, `Uint8Array`, `ArrayBuffer` input:
|
||||
|
||||
Code
|
||||
```JavaScript
|
||||
sha256([]);
|
||||
sha256(new Uint8Array([211, 212]));
|
||||
```
|
||||
Output
|
||||
|
||||
e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855
|
||||
182889f925ae4e5cc37118ded6ed87f7bdc7cab5ec5e78faef2e50048999473f
|
||||
|
||||
## Benchmark
|
||||
[ASCII](http://jsperf.com/sha256-ascii/)
|
||||
[UTF8](http://jsperf.com/sha256-utf8/)
|
||||
[UTF8](http://jsperf.com/sha256/66)
|
||||
[ASCII](http://jsperf.com/sha256/65)
|
||||
|
||||
## Extensions
|
||||
### jQuery
|
||||
|
||||
+2
-2
@@ -1,7 +1,7 @@
|
||||
{
|
||||
"name": "js-sha256",
|
||||
"version": "0.1.3",
|
||||
"main": ["build/sha256.min.js"],
|
||||
"version": "0.3.0",
|
||||
"main": ["src/sha256.js"],
|
||||
"ignore": [
|
||||
"samples",
|
||||
"tests"
|
||||
|
||||
Vendored
+17
-7
@@ -1,7 +1,17 @@
|
||||
(function(E,J){var G="0123456789abcdef".split(""),F=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,
|
||||
3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298],z=function(e,x){return H(e,!0,x)},I=function(e,x){return H(e,!1,x)},H=function(e,x,f){x===J&&(x=!0);var k,g,l,a,B,C,D;if(!f&&/[^\x00-\x7F]/.test(e)){g=[];for(l=f=0;l<e.length;l++)a=e.charCodeAt(l),128>a?g[f++]=a:(2048>a?g[f++]=192|a>>6:(55296>a||57344<=a?g[f++]=224|
|
||||
a>>12:(a=65536+((a&1023)<<10|e.charCodeAt(++l)&1023),g[f++]=240|a>>18,g[f++]=128|a>>12&63),g[f++]=128|a>>6&63),g[f++]=128|a&63);e=g.length;f=(e+8>>6)+1;l=[];for(a=0;a<f;++a)l[a]=k=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0];for(a=0;a<e;++a)k=l[a>>6],k[(a&63)>>2]|=g[a]<<(3-(a&3)<<3);k[(a&63)>>2]|=128<<(3-(a&3)<<3);k[15]=e<<3}else{k=e.length;f=(k+8>>6)+1;l=[];for(a=0;a<f;++a)l[a]=g=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0];for(a=0;a<k;++a)g=l[a>>6],g[(a&63)>>2]|=e.charCodeAt(a)<<(3-(a&3)<<3);g[(a&63)>>2]|=128<<(3-(a&
|
||||
3)<<3);g[15]=k<<3}k=l;x?(g=1779033703,f=3144134277,l=1013904242,a=2773480762,B=1359893119,C=2600822924,D=528734635,e=1541459225):(g=3238371032,f=914150663,l=812702999,a=4144912697,B=4290775857,C=1750603025,D=1694076839,e=3204075428);for(var z=0,E=k.length;z<E;++z){var y=k[z],m,b,h,c,d,n=g,p=f,q=l,r=a,t=B,u=C,v=D,w=e;for(h=16;64>h;++h)c=b=y[h-15],c=c>>>7|c<<25,b=b>>>18|b<<14,m=c^b^y[h-15]>>>3,c=b=y[h-2],c=c>>>17|c<<15,b=b>>>19|b<<13,b=c^b^y[h-2]>>>10,y[h]=y[h-16]+m+y[h-7]+b<<0;for(h=0;64>h;h+=4)c=
|
||||
n>>>2|n<<30,b=n>>>13|n<<19,d=n>>>22|n<<10,m=c^b^d,c=t>>>6|t<<26,b=t>>>11|t<<21,d=t>>>25|t<<7,b=c^b^d,c=n&p^n&q^p&q,d=t&u^~t&v,b=w+b+d+F[h+0]+y[h+0]<<0,m=m+c<<0,w=r+b<<0,r=b+m<<0,c=r>>>2|r<<30,b=r>>>13|r<<19,d=r>>>22|r<<10,m=c^b^d,c=w>>>6|w<<26,b=w>>>11|w<<21,d=w>>>25|w<<7,b=c^b^d,c=r&n^r&p^n&p,d=w&t^~w&u,b=v+b+d+F[h+1]+y[h+1]<<0,m=m+c<<0,v=q+b<<0,q=b+m<<0,c=q>>>2|q<<30,b=q>>>13|q<<19,d=q>>>22|q<<10,m=c^b^d,c=v>>>6|v<<26,b=v>>>11|v<<21,d=v>>>25|v<<7,b=c^b^d,c=q&r^q&n^r&n,d=v&w^~v&t,b=u+b+d+F[h+2]+
|
||||
y[h+2]<<0,m=m+c<<0,u=p+b<<0,p=b+m<<0,c=p>>>2|p<<30,b=p>>>13|p<<19,d=p>>>22|p<<10,m=c^b^d,c=u>>>6|u<<26,b=u>>>11|u<<21,d=u>>>25|u<<7,b=c^b^d,c=p&q^p&r^q&r,d=u&v^~u&w,b=t+b+d+F[h+3]+y[h+3]<<0,m=m+c<<0,t=n+b<<0,n=b+m<<0;g=g+n<<0;f=f+p<<0;l=l+q<<0;a=a+r<<0;B=B+t<<0;C=C+u<<0;D=D+v<<0;e=e+w<<0}k=A(g)+A(f)+A(l)+A(a)+A(B)+A(C)+A(D);x&&(k+=A(e));return k},A=function(e){for(var x="",f=0;4>f;f++)var k=3-f<<3,x=x+(G[e>>k+4&15]+G[e>>k&15]);return x};"undefined"!=typeof module?(z.sha256=z,z.sha224=I,module.exports=
|
||||
z):E&&(E.sha256=z,E.sha224=I)})(this);
|
||||
/*
|
||||
* js-sha256 v0.3.0
|
||||
* https://github.com/emn178/js-sha256
|
||||
*
|
||||
* Copyright 2014-2015, emn178@gmail.com
|
||||
*
|
||||
* Licensed under the MIT license:
|
||||
* http://www.opensource.org/licenses/MIT
|
||||
*/
|
||||
(function(I,R){var K="undefined"!=typeof module;K&&(I=global);var a="0123456789abcdef".split(""),Q=[-2147483648,8388608,32768,128],C=[24,16,8,0],M=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,
|
||||
773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298],c=[],L=function(a){return A(a,!0)},A=function(D,A){var J="string"!=typeof D;J&&D.constructor==I.ArrayBuffer&&(D=new Uint8Array(D));var m,n,p,q,r,t,u,v,f,K=!0,L=!1,b,B=
|
||||
0,N=0,P=0,O=D.length,e,d,E,F,G,H;A?(m=3238371032,n=914150663,p=812702999,q=4144912697,r=4290775857,t=1750603025,u=1694076839,v=3204075428):(m=1779033703,n=3144134277,p=1013904242,q=2773480762,r=1359893119,t=2600822924,u=528734635,v=1541459225);f=0;do{c[0]=f;c[16]=c[1]=c[2]=c[3]=c[4]=c[5]=c[6]=c[7]=c[8]=c[9]=c[10]=c[11]=c[12]=c[13]=c[14]=c[15]=0;if(J)for(b=N;B<O&&64>b;++B)c[b>>2]|=D[B]<<C[b++&3];else for(b=N;B<O&&64>b;++B)f=D.charCodeAt(B),128>f?c[b>>2]|=f<<C[b++&3]:(2048>f?c[b>>2]|=(192|f>>6)<<C[b++&
|
||||
3]:(55296>f||57344<=f?c[b>>2]|=(224|f>>12)<<C[b++&3]:(f=65536+((f&1023)<<10|D.charCodeAt(++B)&1023),c[b>>2]|=(240|f>>18)<<C[b++&3],c[b>>2]|=(128|f>>12&63)<<C[b++&3]),c[b>>2]|=(128|f>>6&63)<<C[b++&3]),c[b>>2]|=(128|f&63)<<C[b++&3]);P+=b-N;N=b-64;B==O&&(c[b>>2]|=Q[b&3],++B);f=c[16];B>O&&56>b&&(c[15]=P<<3,L=!0);var w=m,k=n,l=p,g=q,x=r,y=t,z=u,h=v;for(b=16;64>b;++b)d=c[b-15],e=(d>>>7|d<<25)^(d>>>18|d<<14)^d>>>3,d=c[b-2],d=(d>>>17|d<<15)^(d>>>19|d<<13)^d>>>10,c[b]=c[b-16]+e+c[b-7]+d<<0;H=k&l;for(b=0;64>
|
||||
b;b+=4)K?(A?(G=300032,d=c[0]-1413257819,h=d-150054599<<0,g=d+24177077<<0):(G=704751109,d=c[0]-210244248,h=d-1521486534<<0,g=d+143694565<<0),K=!1):(e=(w>>>2|w<<30)^(w>>>13|w<<19)^(w>>>22|w<<10),d=(x>>>6|x<<26)^(x>>>11|x<<21)^(x>>>25|x<<7),G=w&k,E=G^w&l^H,F=x&y^~x&z,d=h+d+F+M[b]+c[b],e+=E,h=g+d<<0,g=d+e<<0),e=(g>>>2|g<<30)^(g>>>13|g<<19)^(g>>>22|g<<10),d=(h>>>6|h<<26)^(h>>>11|h<<21)^(h>>>25|h<<7),H=g&w,E=H^g&k^G,F=h&x^~h&y,d=z+d+F+M[b+1]+c[b+1],e+=E,z=l+d<<0,l=d+e<<0,e=(l>>>2|l<<30)^(l>>>13|l<<19)^
|
||||
(l>>>22|l<<10),d=(z>>>6|z<<26)^(z>>>11|z<<21)^(z>>>25|z<<7),G=l&g,E=G^l&w^H,F=z&h^~z&x,d=y+d+F+M[b+2]+c[b+2],e+=E,y=k+d<<0,k=d+e<<0,e=(k>>>2|k<<30)^(k>>>13|k<<19)^(k>>>22|k<<10),d=(y>>>6|y<<26)^(y>>>11|y<<21)^(y>>>25|y<<7),H=k&l,E=H^k&g^G,F=y&z^~y&h,d=x+d+F+M[b+3]+c[b+3],e+=E,x=w+d<<0,w=d+e<<0;m=m+w<<0;n=n+k<<0;p=p+l<<0;q=q+g<<0;r=r+x<<0;t=t+y<<0;u=u+z<<0;v=v+h<<0}while(!L);J=a[m>>28&15]+a[m>>24&15]+a[m>>20&15]+a[m>>16&15]+a[m>>12&15]+a[m>>8&15]+a[m>>4&15]+a[m&15]+a[n>>28&15]+a[n>>24&15]+a[n>>20&
|
||||
15]+a[n>>16&15]+a[n>>12&15]+a[n>>8&15]+a[n>>4&15]+a[n&15]+a[p>>28&15]+a[p>>24&15]+a[p>>20&15]+a[p>>16&15]+a[p>>12&15]+a[p>>8&15]+a[p>>4&15]+a[p&15]+a[q>>28&15]+a[q>>24&15]+a[q>>20&15]+a[q>>16&15]+a[q>>12&15]+a[q>>8&15]+a[q>>4&15]+a[q&15]+a[r>>28&15]+a[r>>24&15]+a[r>>20&15]+a[r>>16&15]+a[r>>12&15]+a[r>>8&15]+a[r>>4&15]+a[r&15]+a[t>>28&15]+a[t>>24&15]+a[t>>20&15]+a[t>>16&15]+a[t>>12&15]+a[t>>8&15]+a[t>>4&15]+a[t&15]+a[u>>28&15]+a[u>>24&15]+a[u>>20&15]+a[u>>16&15]+a[u>>12&15]+a[u>>8&15]+a[u>>4&15]+a[u&
|
||||
15];A||(J+=a[v>>28&15]+a[v>>24&15]+a[v>>20&15]+a[v>>16&15]+a[v>>12&15]+a[v>>8&15]+a[v>>4&15]+a[v&15]);return J};!I.JS_SHA256_TEST&&K?(A.sha256=A,A.sha224=L,module.exports=A):I&&(I.sha256=A,I.sha224=L)})(this);
|
||||
|
||||
+1
-1
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "js-sha256",
|
||||
"version": "0.1.3",
|
||||
"version": "0.3.0",
|
||||
"description": "A simple SHA-256 / SHA-224 hash function for JavaScript supports UTF-8 encoding.",
|
||||
"main": "src/sha256.js",
|
||||
"devDependencies": {
|
||||
|
||||
+176
-179
@@ -1,5 +1,5 @@
|
||||
/*
|
||||
* js-sha256 v0.1.3
|
||||
* js-sha256 v0.3.0
|
||||
* https://github.com/emn178/js-sha256
|
||||
*
|
||||
* Copyright 2014-2015, emn178@gmail.com
|
||||
@@ -10,8 +10,14 @@
|
||||
;(function(root, undefined) {
|
||||
'use strict';
|
||||
|
||||
var NODE_JS = typeof(module) != 'undefined';
|
||||
if(NODE_JS) {
|
||||
root = global;
|
||||
}
|
||||
var TYPED_ARRAY = typeof(Uint8Array) != 'undefined';
|
||||
var HEX_CHARS = '0123456789abcdef'.split('');
|
||||
|
||||
var EXTRA = [-2147483648, 8388608, 32768, 128];
|
||||
var SHIFT = [24, 16, 8, 0];
|
||||
var K =[0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
|
||||
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
|
||||
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
|
||||
@@ -21,35 +27,23 @@
|
||||
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
|
||||
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2];
|
||||
|
||||
var sha256 = function(message, asciiOnly) {
|
||||
return sha2(message, true, asciiOnly);
|
||||
var blocks = [];
|
||||
|
||||
var sha224 = function(message) {
|
||||
return sha256(message, true);
|
||||
};
|
||||
|
||||
var sha224 = function(message, asciiOnly) {
|
||||
return sha2(message, false, asciiOnly);
|
||||
};
|
||||
|
||||
var sha2 = function(message, is256, asciiOnly) {
|
||||
if(is256 === undefined) {
|
||||
is256 = true;
|
||||
var sha256 = function(message, is224) {
|
||||
var notString = typeof(message) != 'string';
|
||||
if(notString && message.constructor == root.ArrayBuffer) {
|
||||
message = new Uint8Array(message);
|
||||
}
|
||||
|
||||
var chunks, h0, h1, h2, h3, h4, h5, h6, h7;
|
||||
if(!asciiOnly && /[^\x00-\x7F]/.test(message)) {
|
||||
chunks = getChunksFromUtf8(message);
|
||||
} else {
|
||||
chunks = getChunksFromAscii(message);
|
||||
}
|
||||
if(is256) {
|
||||
h0 = 0x6a09e667;
|
||||
h1 = 0xbb67ae85;
|
||||
h2 = 0x3c6ef372;
|
||||
h3 = 0xa54ff53a;
|
||||
h4 = 0x510e527f;
|
||||
h5 = 0x9b05688c;
|
||||
h6 = 0x1f83d9ab;
|
||||
h7 = 0x5be0cd19;
|
||||
} else { // 224
|
||||
var h0, h1, h2, h3, h4, h5, h6, h7, block, code, first = true, end = false,
|
||||
i, j, index = 0, start = 0, bytes = 0, length = message.length,
|
||||
s0, s1, maj, t1, t2, ch, ab, da, cd, bc;
|
||||
|
||||
if(is224) {
|
||||
h0 = 0xc1059ed8;
|
||||
h1 = 0x367cd507;
|
||||
h2 = 0x3070dd17;
|
||||
@@ -58,170 +52,173 @@
|
||||
h5 = 0x68581511;
|
||||
h6 = 0x64f98fa7;
|
||||
h7 = 0xbefa4fa4;
|
||||
} else { // 256
|
||||
h0 = 0x6a09e667;
|
||||
h1 = 0xbb67ae85;
|
||||
h2 = 0x3c6ef372;
|
||||
h3 = 0xa54ff53a;
|
||||
h4 = 0x510e527f;
|
||||
h5 = 0x9b05688c;
|
||||
h6 = 0x1f83d9ab;
|
||||
h7 = 0x5be0cd19;
|
||||
}
|
||||
block = 0;
|
||||
do {
|
||||
blocks[0] = 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) {
|
||||
for (i = start;index < length && i < 64; ++index) {
|
||||
blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
|
||||
}
|
||||
} else {
|
||||
for (i = start;index < length && i < 64; ++index) {
|
||||
code = message.charCodeAt(index);
|
||||
if (code < 0x80) {
|
||||
blocks[i >> 2] |= code << SHIFT[i++ & 3];
|
||||
} else if (code < 0x800) {
|
||||
blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else if (code < 0xd800 || code >= 0xe000) {
|
||||
blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
}
|
||||
}
|
||||
}
|
||||
bytes += i - start;
|
||||
start = i - 64;
|
||||
if(index == length) {
|
||||
blocks[i >> 2] |= EXTRA[i & 3];
|
||||
++index;
|
||||
}
|
||||
block = blocks[16];
|
||||
if(index > length && i < 56) {
|
||||
blocks[15] = bytes << 3;
|
||||
end = true;
|
||||
}
|
||||
|
||||
for(var i = 0, length = chunks.length;i < length;++i) {
|
||||
var w = chunks[i], s0, s1, j, tmp1, tmp2, tmp3, maj, t1, t2, ch,
|
||||
a = h0, b = h1, c = h2, d = h3, e = h4, f = h5, g = h6, h = h7;
|
||||
|
||||
var a = h0, b = h1, c = h2, d = h3, e = h4, f = h5, g = h6, h = h7;
|
||||
for(j = 16;j < 64;++j) {
|
||||
// rightrotate
|
||||
tmp1 = tmp2 = w[j - 15];
|
||||
tmp1 = (tmp1 >>> 7) | (tmp1 << 25);
|
||||
tmp2 = (tmp2 >>> 18) | (tmp2 << 14);
|
||||
s0 = tmp1 ^ tmp2 ^ (w[j - 15] >>> 3);
|
||||
tmp1 = tmp2 = w[j - 2];
|
||||
tmp1 = (tmp1 >>> 17) | (tmp1 << 15);
|
||||
tmp2 = (tmp2 >>> 19) | (tmp2 << 13);
|
||||
s1 = tmp1 ^ tmp2 ^ (w[j - 2] >>> 10);
|
||||
w[j] = (w[j - 16] + s0 + w[j - 7] + s1) << 0;
|
||||
t1 = blocks[j - 15];
|
||||
s0 = ((t1 >>> 7) | (t1 << 25)) ^ ((t1 >>> 18) | (t1 << 14)) ^ (t1 >>> 3);
|
||||
t1 = blocks[j - 2];
|
||||
s1 = ((t1 >>> 17) | (t1 << 15)) ^ ((t1 >>> 19) | (t1 << 13)) ^ (t1 >>> 10);
|
||||
blocks[j] = blocks[j - 16] + s0 + blocks[j - 7] + s1 << 0;
|
||||
}
|
||||
|
||||
bc = b & c;
|
||||
for(j = 0;j < 64;j += 4) {
|
||||
tmp1 = (a >>> 2) | (a << 30);
|
||||
tmp2 = (a >>> 13) | (a << 19);
|
||||
tmp3 = (a >>> 22) | (a << 10);
|
||||
s0 = tmp1 ^ tmp2 ^ tmp3;
|
||||
tmp1 = (e >>> 6) | (e << 26);
|
||||
tmp2 = (e >>> 11) | (e << 21);
|
||||
tmp3 = (e >>> 25) | (e << 7);
|
||||
s1 = tmp1 ^ tmp2 ^ tmp3;
|
||||
maj = (a & b) ^ (a & c) ^ (b & c);
|
||||
ch = (e & f) ^ (~e & g);
|
||||
t1 = (h + s1 + ch + K[j + 0] + w[j + 0]) << 0;
|
||||
t2 = (s0 + maj) << 0;
|
||||
h = (d + t1) << 0;
|
||||
d = (t1 + t2) << 0;
|
||||
tmp1 = (d >>> 2) | (d << 30);
|
||||
tmp2 = (d >>> 13) | (d << 19);
|
||||
tmp3 = (d >>> 22) | (d << 10);
|
||||
s0 = tmp1 ^ tmp2 ^ tmp3;
|
||||
tmp1 = (h >>> 6) | (h << 26);
|
||||
tmp2 = (h >>> 11) | (h << 21);
|
||||
tmp3 = (h >>> 25) | (h << 7);
|
||||
s1 = tmp1 ^ tmp2 ^ tmp3;
|
||||
maj = (d & a) ^ (d & b) ^ (a & b);
|
||||
ch = (h & e) ^ (~h & f);
|
||||
t1 = (g + s1 + ch + K[j + 1] + w[j + 1]) << 0;
|
||||
t2 = (s0 + maj) << 0;
|
||||
g = (c + t1) << 0;
|
||||
c = (t1 + t2) << 0;
|
||||
tmp1 = (c >>> 2) | (c << 30);
|
||||
tmp2 = (c >>> 13) | (c << 19);
|
||||
tmp3 = (c >>> 22) | (c << 10);
|
||||
s0 = tmp1 ^ tmp2 ^ tmp3;
|
||||
tmp1 = (g >>> 6) | (g << 26);
|
||||
tmp2 = (g >>> 11) | (g << 21);
|
||||
tmp3 = (g >>> 25) | (g << 7);
|
||||
s1 = tmp1 ^ tmp2 ^ tmp3;
|
||||
maj = (c & d) ^ (c & a) ^ (d & a);
|
||||
ch = (g & h) ^ (~g & e);
|
||||
t1 = (f + s1 + ch + K[j + 2] + w[j + 2]) << 0;
|
||||
t2 = (s0 + maj) << 0;
|
||||
f = (b + t1) << 0;
|
||||
b = (t1 + t2) << 0;
|
||||
tmp1 = (b >>> 2) | (b << 30);
|
||||
tmp2 = (b >>> 13) | (b << 19);
|
||||
tmp3 = (b >>> 22) | (b << 10);
|
||||
s0 = tmp1 ^ tmp2 ^ tmp3;
|
||||
tmp1 = (f >>> 6) | (f << 26);
|
||||
tmp2 = (f >>> 11) | (f << 21);
|
||||
tmp3 = (f >>> 25) | (f << 7);
|
||||
s1 = tmp1 ^ tmp2 ^ tmp3;
|
||||
maj = (b & c) ^ (b & d) ^ (c & d);
|
||||
ch = (f & g) ^ (~f & h);
|
||||
t1 = (e + s1 + ch + K[j + 3] + w[j + 3]) << 0;
|
||||
t2 = (s0 + maj) << 0;
|
||||
e = (a + t1) << 0;
|
||||
a = (t1 + t2) << 0;
|
||||
}
|
||||
|
||||
h0 = (h0 + a) << 0;
|
||||
h1 = (h1 + b) << 0;
|
||||
h2 = (h2 + c) << 0;
|
||||
h3 = (h3 + d) << 0;
|
||||
h4 = (h4 + e) << 0;
|
||||
h5 = (h5 + f) << 0;
|
||||
h6 = (h6 + g) << 0;
|
||||
h7 = (h7 + h) << 0;
|
||||
}
|
||||
|
||||
var hex = toHexString(h0) + toHexString(h1)+ toHexString(h2) + toHexString(h3) + toHexString(h4) + toHexString(h5) + toHexString(h6);
|
||||
if(is256) {
|
||||
hex += toHexString(h7);
|
||||
}
|
||||
return hex;
|
||||
};
|
||||
|
||||
var toHexString = function(num) {
|
||||
var hex = '';
|
||||
for(var i = 0; i < 4; i++) {
|
||||
var offset = 3 - i << 3;
|
||||
hex += HEX_CHARS[(num >> (offset + 4)) & 0x0F] + HEX_CHARS[(num >> offset) & 0x0F];
|
||||
}
|
||||
return hex;
|
||||
};
|
||||
|
||||
var getBytesFromUtf8 = function(str) {
|
||||
var bytes = [], index = 0;
|
||||
for (var i = 0;i < str.length; i++) {
|
||||
var c = str.charCodeAt(i);
|
||||
if (c < 0x80) {
|
||||
bytes[index++] = c;
|
||||
} else if (c < 0x800) {
|
||||
bytes[index++] = 0xc0 | (c >> 6);
|
||||
bytes[index++] = 0x80 | (c & 0x3f);
|
||||
} else if (c < 0xd800 || c >= 0xe000) {
|
||||
bytes[index++] = 0xe0 | (c >> 12);
|
||||
bytes[index++] = 0x80 | ((c >> 6) & 0x3f);
|
||||
bytes[index++] = 0x80 | (c & 0x3f);
|
||||
if(first) {
|
||||
if(is224) {
|
||||
ab = 300032;
|
||||
t1 = blocks[0] - 1413257819;
|
||||
h = t1 - 150054599 << 0;
|
||||
d = t1 + 24177077 << 0;
|
||||
} else {
|
||||
c = 0x10000 + (((c & 0x3ff) << 10) | (str.charCodeAt(++i) & 0x3ff));
|
||||
bytes[index++] = 0xf0 | (c >> 18);
|
||||
bytes[index++] = 0x80 | ((c >> 12) & 0x3f);
|
||||
bytes[index++] = 0x80 | ((c >> 6) & 0x3f);
|
||||
bytes[index++] = 0x80 | (c & 0x3f);
|
||||
ab = 704751109;
|
||||
t1 = blocks[0] - 210244248;
|
||||
h = t1 - 1521486534 << 0;
|
||||
d = t1 + 143694565 << 0;
|
||||
}
|
||||
first = false;
|
||||
} else {
|
||||
s0 = ((a >>> 2) | (a << 30)) ^ ((a >>> 13) | (a << 19)) ^ ((a >>> 22) | (a << 10));
|
||||
s1 = ((e >>> 6) | (e << 26)) ^ ((e >>> 11) | (e << 21)) ^ ((e >>> 25) | (e << 7));
|
||||
ab = a & b;
|
||||
maj = ab ^ (a & c) ^ bc;
|
||||
ch = (e & f) ^ (~e & g);
|
||||
t1 = h + s1 + ch + K[j] + blocks[j];
|
||||
t2 = s0 + maj;
|
||||
h = d + t1 << 0;
|
||||
d = t1 + t2 << 0;
|
||||
}
|
||||
return bytes;
|
||||
s0 = ((d >>> 2) | (d << 30)) ^ ((d >>> 13) | (d << 19)) ^ ((d >>> 22) | (d << 10));
|
||||
s1 = ((h >>> 6) | (h << 26)) ^ ((h >>> 11) | (h << 21)) ^ ((h >>> 25) | (h << 7));
|
||||
da = d & a;
|
||||
maj = da ^ (d & b) ^ ab;
|
||||
ch = (h & e) ^ (~h & f);
|
||||
t1 = g + s1 + ch + K[j + 1] + blocks[j + 1];
|
||||
t2 = s0 + maj;
|
||||
g = c + t1 << 0;
|
||||
c = t1 + t2 << 0;
|
||||
s0 = ((c >>> 2) | (c << 30)) ^ ((c >>> 13) | (c << 19)) ^ ((c >>> 22) | (c << 10));
|
||||
s1 = ((g >>> 6) | (g << 26)) ^ ((g >>> 11) | (g << 21)) ^ ((g >>> 25) | (g << 7));
|
||||
cd = c & d;
|
||||
maj = cd ^ (c & a) ^ da;
|
||||
ch = (g & h) ^ (~g & e);
|
||||
t1 = f + s1 + ch + K[j + 2] + blocks[j + 2];
|
||||
t2 = s0 + maj;
|
||||
f = b + t1 << 0;
|
||||
b = t1 + t2 << 0;
|
||||
s0 = ((b >>> 2) | (b << 30)) ^ ((b >>> 13) | (b << 19)) ^ ((b >>> 22) | (b << 10));
|
||||
s1 = ((f >>> 6) | (f << 26)) ^ ((f >>> 11) | (f << 21)) ^ ((f >>> 25) | (f << 7));
|
||||
bc = b & c;
|
||||
maj = bc ^ (b & d) ^ cd;
|
||||
ch = (f & g) ^ (~f & h);
|
||||
t1 = e + s1 + ch + K[j + 3] + blocks[j + 3];
|
||||
t2 = s0 + maj;
|
||||
e = a + t1 << 0;
|
||||
a = t1 + t2 << 0;
|
||||
}
|
||||
|
||||
h0 = h0 + a << 0;
|
||||
h1 = h1 + b << 0;
|
||||
h2 = h2 + c << 0;
|
||||
h3 = h3 + d << 0;
|
||||
h4 = h4 + e << 0;
|
||||
h5 = h5 + f << 0;
|
||||
h6 = h6 + g << 0;
|
||||
h7 = h7 + h << 0;
|
||||
} while(!end);
|
||||
|
||||
var hex = HEX_CHARS[(h0 >> 28) & 0x0F] + HEX_CHARS[(h0 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h0 >> 20) & 0x0F] + HEX_CHARS[(h0 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h0 >> 12) & 0x0F] + HEX_CHARS[(h0 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h0 >> 4) & 0x0F] + HEX_CHARS[h0 & 0x0F] +
|
||||
HEX_CHARS[(h1 >> 28) & 0x0F] + HEX_CHARS[(h1 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h1 >> 20) & 0x0F] + HEX_CHARS[(h1 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h1 >> 12) & 0x0F] + HEX_CHARS[(h1 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h1 >> 4) & 0x0F] + HEX_CHARS[h1 & 0x0F] +
|
||||
HEX_CHARS[(h2 >> 28) & 0x0F] + HEX_CHARS[(h2 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h2 >> 20) & 0x0F] + HEX_CHARS[(h2 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h2 >> 12) & 0x0F] + HEX_CHARS[(h2 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h2 >> 4) & 0x0F] + HEX_CHARS[h2 & 0x0F] +
|
||||
HEX_CHARS[(h3 >> 28) & 0x0F] + HEX_CHARS[(h3 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h3 >> 20) & 0x0F] + HEX_CHARS[(h3 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h3 >> 12) & 0x0F] + HEX_CHARS[(h3 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h3 >> 4) & 0x0F] + HEX_CHARS[h3 & 0x0F] +
|
||||
HEX_CHARS[(h4 >> 28) & 0x0F] + HEX_CHARS[(h4 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h4 >> 20) & 0x0F] + HEX_CHARS[(h4 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h4 >> 12) & 0x0F] + HEX_CHARS[(h4 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h4 >> 4) & 0x0F] + HEX_CHARS[h4 & 0x0F] +
|
||||
HEX_CHARS[(h5 >> 28) & 0x0F] + HEX_CHARS[(h5 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h5 >> 20) & 0x0F] + HEX_CHARS[(h5 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h5 >> 12) & 0x0F] + HEX_CHARS[(h5 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h5 >> 4) & 0x0F] + HEX_CHARS[h5 & 0x0F] +
|
||||
HEX_CHARS[(h6 >> 28) & 0x0F] + HEX_CHARS[(h6 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h6 >> 20) & 0x0F] + HEX_CHARS[(h6 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h6 >> 12) & 0x0F] + HEX_CHARS[(h6 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h6 >> 4) & 0x0F] + HEX_CHARS[h6 & 0x0F];
|
||||
if(!is224) {
|
||||
hex += HEX_CHARS[(h7 >> 28) & 0x0F] + HEX_CHARS[(h7 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h7 >> 20) & 0x0F] + HEX_CHARS[(h7 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h7 >> 12) & 0x0F] + HEX_CHARS[(h7 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h7 >> 4) & 0x0F] + HEX_CHARS[h7 & 0x0F];
|
||||
}
|
||||
return hex;
|
||||
};
|
||||
|
||||
var getChunksFromAscii = function(message) {
|
||||
// a block is 32 bits(4 bytes), a chunk is 512 bits(64 bytes)
|
||||
var length = message.length;
|
||||
var chunkCount = ((length + 8) >> 6) + 1;
|
||||
var chunks = [], blocks, i;
|
||||
for(i = 0;i < chunkCount;++i) {
|
||||
chunks[i] = blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
|
||||
}
|
||||
for(i = 0;i < length;++i) {
|
||||
blocks = chunks[i >> 6];
|
||||
blocks[(i & 63) >> 2] |= message.charCodeAt(i) << (3 - (i & 3) << 3);
|
||||
}
|
||||
blocks[(i & 63) >> 2] |= 0x80 << (3 - (i & 3) << 3);
|
||||
blocks[15] = length << 3; // length * 8
|
||||
return chunks;
|
||||
};
|
||||
|
||||
var getChunksFromUtf8 = function(message) {
|
||||
// a block is 32 bits(4 bytes), a chunk is 512 bits(64 bytes)
|
||||
var bytes = getBytesFromUtf8(message);
|
||||
var length = bytes.length;
|
||||
var chunkCount = ((length + 8) >> 6) + 1;
|
||||
var chunks = [], blocks, i;
|
||||
for(i = 0;i < chunkCount;++i) {
|
||||
chunks[i] = blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
|
||||
}
|
||||
for(i = 0;i < length;++i) {
|
||||
blocks = chunks[i >> 6];
|
||||
blocks[(i & 63) >> 2] |= bytes[i] << (3 - (i & 3) << 3);
|
||||
}
|
||||
blocks[(i & 63) >> 2] |= 0x80 << (3 - (i & 3) << 3);
|
||||
blocks[15] = length << 3; // length * 8
|
||||
return chunks;
|
||||
};
|
||||
|
||||
if(typeof(module) != 'undefined') {
|
||||
if(!root.JS_SHA256_TEST && NODE_JS) {
|
||||
sha256.sha256 = sha256;
|
||||
sha256.sha224 = sha224;
|
||||
module.exports = sha256;
|
||||
|
||||
@@ -2,3 +2,12 @@ sha256 = require('../src/sha256.js').sha256;
|
||||
sha224 = require('../src/sha256.js').sha224;
|
||||
expect = require('expect.js');
|
||||
require('./test.js');
|
||||
|
||||
delete require.cache[require.resolve('../src/sha256.js')]
|
||||
delete require.cache[require.resolve('./test.js')]
|
||||
sha256 = null;
|
||||
sha224 = null;
|
||||
|
||||
JS_SHA256_TEST = true;
|
||||
require('../src/sha256.js');
|
||||
require('./test.js');
|
||||
|
||||
+72
-24
@@ -1,65 +1,113 @@
|
||||
describe('sha256', function() {
|
||||
describe('ascii', function() {
|
||||
describe('less than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
(function(sha256, sha224) {
|
||||
describe('sha256', function() {
|
||||
context('when ascii', function() {
|
||||
context('and less than 64 bytes', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha256('')).to.be('e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855');
|
||||
expect(sha256('The quick brown fox jumps over the lazy dog')).to.be('d7a8fbb307d7809469ca9abcb0082e4f8d5651e46d3cdb762d02d0bf37c9e592');
|
||||
expect(sha256('The quick brown fox jumps over the lazy dog.')).to.be('ef537f25c895bfa782526529a9b63d97aa631564d5d789c2b765448c8635fb6c');
|
||||
});
|
||||
});
|
||||
|
||||
describe('more than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
context('and more than 64 bytes', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha256('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('54e73d89e1924fdcd056390266a983924b6d6d461e9470b6cd50bbaf69b5c54c');
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe('UTF8', function() {
|
||||
describe('less than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
context('when UTF8', function() {
|
||||
context('and less than 64 bytes', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha256('中文')).to.be('72726d8818f693066ceb69afa364218b692e62ea92b385782363780f47529c21');
|
||||
expect(sha256('aécio')).to.be('53196d1acfce0c4b264e01e8018c989d571351f59e33f055f76ff15b4f0516c6');
|
||||
expect(sha256('𠜎')).to.be('8d10a48685dbc34484696de7ea7434d80a54c1d60100530faccf697463ef19c9');
|
||||
});
|
||||
});
|
||||
|
||||
describe('more than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
context('and more than 64 bytes', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha256('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('d691014feebf35b3500ef6f6738d0094cac63628a7a018a980a40292a77703d1');
|
||||
expect(sha256('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('81a1472ebdeb09406a783d607ff49ee2fde3e9f44ac1cd158ad8d6ad3c4e69fa');
|
||||
});
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe('sha224', function() {
|
||||
describe('ascii', function() {
|
||||
describe('less than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
context('when special length', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha256('0123456780123456780123456780123456780123456780123456780')).to.be('5e6b963e2b6444dab8544beab8532850cef2a9d143872a6a5384abe37e61b3db');
|
||||
expect(sha256('01234567801234567801234567801234567801234567801234567801')).to.be('85d240a4a03a0710423fc4f701da51e8785c9eaa96d718ab1c7991d6afd60d62');
|
||||
expect(sha256('0123456780123456780123456780123456780123456780123456780123456780')).to.be('c3ee464d5620eb2dde3dfda4c7955dbd9e9e2e9b113c13983fc67b0dfd892a53');
|
||||
expect(sha256('01234567801234567801234567801234567801234567801234567801234567801234567')).to.be('74b51c6911f9a8b5e7c499effe7604e43b672166818873c27752c248de434841');
|
||||
expect(sha256('012345678012345678012345678012345678012345678012345678012345678012345678')).to.be('6fba9e623ae6abf028a1b195748814aa95eebfb22e3ec5e15d2444cd6c48186a');
|
||||
});
|
||||
});
|
||||
|
||||
context('when Array', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha256([])).to.be('e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855');
|
||||
expect(sha256([211, 212])).to.be('182889f925ae4e5cc37118ded6ed87f7bdc7cab5ec5e78faef2e50048999473f');
|
||||
expect(sha256([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('d7a8fbb307d7809469ca9abcb0082e4f8d5651e46d3cdb762d02d0bf37c9e592');
|
||||
expect(sha256([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('74b51c6911f9a8b5e7c499effe7604e43b672166818873c27752c248de434841');
|
||||
});
|
||||
});
|
||||
|
||||
context('when Uint8Array', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha256(new Uint8Array([]))).to.be('e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855');
|
||||
expect(sha256(new Uint8Array([211, 212]))).to.be('182889f925ae4e5cc37118ded6ed87f7bdc7cab5ec5e78faef2e50048999473f');
|
||||
});
|
||||
});
|
||||
|
||||
context('when ArrayBuffer', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha256(new ArrayBuffer(0))).to.be('e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855');
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe('sha224', function() {
|
||||
context('when ascii', function() {
|
||||
context('and less than 64 bytes', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha224('')).to.be('d14a028c2a3a2bc9476102bb288234c415a2b01f828ea62ac5b3e42f');
|
||||
expect(sha224('The quick brown fox jumps over the lazy dog')).to.be('730e109bd7a8a32b1cb9d9a09aa2325d2430587ddbc0c38bad911525');
|
||||
expect(sha224('The quick brown fox jumps over the lazy dog.')).to.be('619cba8e8e05826e9b8c519c0a5c68f4fb653e8a3d8aa04bb2c8cd4c');
|
||||
});
|
||||
});
|
||||
|
||||
describe('more than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
context('and more than 64 bytes', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha224('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('4d97e15967391d2e846ea7d21bb480efadbae5868b731e7cc6267006');
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe('UTF8', function() {
|
||||
describe('less than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
context('when UTF8', function() {
|
||||
context('and less than 64 bytes', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha224('中文')).to.be('dfbab71afdf54388af4d55f8bd3de8c9b15e0eb916bf9125f4a959d4');
|
||||
expect(sha224('aécio')).to.be('d12841cafd89c534924a839e62bf35a2b5f3717b7802eb19bd8d8e15');
|
||||
expect(sha224('𠜎')).to.be('eaa0129b5509f5701db218fb7076b282e4409da52d06363aa3bdd63d');
|
||||
});
|
||||
});
|
||||
|
||||
describe('more than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
context('and more than 64 bytes', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha224('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('0dda421f3f81272418e1313673e9d74b7f2d04efc9c52c69458e12c3');
|
||||
expect(sha224('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('a8cb74a54e6dc6ab6110db3915ba08ffe5e1abafaea78538fa12a626');
|
||||
});
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
context('when special length', function() {
|
||||
it('should be equal', function() {
|
||||
expect(sha224('0123456780123456780123456780123456780123456780123456780')).to.be('bc4a354d66f3cff4bc6dd6a88fbb0435cede7fd5fe94da0760cb1924');
|
||||
expect(sha224('01234567801234567801234567801234567801234567801234567801')).to.be('2f148f757d1295784a7c69bf328b8bf827a536669e132234cd6f50e7');
|
||||
expect(sha224('0123456780123456780123456780123456780123456780123456780123456780')).to.be('496275a96bf41aa27ce89c3ae0fc63c3a3eab063887a8ea075bd091b');
|
||||
expect(sha224('01234567801234567801234567801234567801234567801234567801234567801234567')).to.be('16ee1b101fe0e0d8dd156d598931ec19d75b0f8dc0a0455733c168c8');
|
||||
expect(sha224('012345678012345678012345678012345678012345678012345678012345678012345678')).to.be('04c7a30079c640e440d884cdf0d7ab04fd05501d4498cb21be29ca1f');
|
||||
});
|
||||
});
|
||||
});
|
||||
})(sha256, sha224);
|
||||
|
||||
Reference in New Issue
Block a user