1. Added AMD support.

2. Fixed ArrayBuffer dosen't work in Webpack.

.covignore

@@ -1 +1,2 @@
+/node_modules/
 /tests/

.gitignore

@@ -1 +1,2 @@
-node_modules/
+/node_modules/
+/covreporter/

.travis.yml

@@ -1,12 +1,11 @@
 language: node_js
 node_js:
-  - "0.11"
+  - "0.12.15"
-  - "0.10"
+  - "4.5"
-  - "0.8"
+  - "6.5.0"
 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
 branches:
   only:

CHANGELOG.md

@@ -1,34 +1,47 @@
-# v0.2.2 / 2015-02-09
+# Change Log
 
-* Improve performance.
+## v0.3.0 / 2017-01-23
+### Added
+- AMD support.
+### Fixed
+- ArrayBuffer dosen't work in Webpack.
 
-# v0.2.1 / 2015-02-08
+## v0.2.2 / 2015-02-09
+### Improved
+- performance.
 
-* Remove ascii parameter.
+## v0.2.1 / 2015-02-08
-* Improve performance.
+### Added
-* Add test cases.
+- test cases.
+### Removed
+- ascii parameter.
+### Improved
+- performance.
 
-# v0.2.0 / 2015-02-02
+## v0.2.0 / 2015-02-02
+### Added
+- test cases.
+### Improved
+- performance.
 
-* Add test cases.
+## v0.1.3 / 2015-01-26
-* Improve performance.
+### Added
+- test cases.
+### Improved
+- performance.
 
-# v0.1.3 / 2015-01-26
+## v0.1.2 / 2015-01-07
+### Added
+- bower package.
+- travis.
+- coveralls.
+### Fixed
+- JSHint warnings.
 
-* Add test cases.
+## v0.1.1 / 2014-07-27
-* Improve performance.
+### Fixed
+- accents bug.
 
-# v0.1.2 / 2015-01-07
+## v0.1.0 / 2014-01-05
-
+### Added
-* Add bower package.
+- initial release.
-* Fixed JSHint warnings.
-* Add travis.
-* Add coveralls.
-
-# v0.1.1 / 2014-07-27
-
-Fixed accents bug
-
-# v0.1.0 / 2014-01-05
-
-Initial release

LICENSE.txt

@@ -1,4 +1,4 @@
-Copyright 2014-2015 emn178@gmail.com
+Copyright 2014-2017 Chen, Yi-Cyuan
 
 Permission is hereby granted, free of charge, to any person obtaining
 a copy of this software and associated documentation files (the

README.md

@@ -1,7 +1,7 @@
 # js-sha512
 [![Build Status](https://travis-ci.org/emn178/js-sha512.svg?branch=master)](https://travis-ci.org/emn178/js-sha512)
 [![Coverage Status](https://coveralls.io/repos/emn178/js-sha512/badge.svg?branch=master)](https://coveralls.io/r/emn178/js-sha512?branch=master)
-[![CDNJS](https://img.shields.io/cdnjs/v/js-sha512.svg)](https://cdnjs.com/libraries/js-sha512/)
+[![CDNJS](https://img.shields.io/cdnjs/v/js-sha512.svg)](https://cdnjs.com/libraries/js-sha512/)  
 [![NPM](https://nodei.co/npm/js-sha512.png?stars&downloads)](https://nodei.co/npm/js-sha512/)  
 A simple SHA-512, SHA-384, SHA-512/224, SHA-512/256 hash functions for JavaScript supports UTF-8 encoding.
 
@@ -34,112 +34,46 @@ sha512_224('Message to hash');
 ```
 If you use node.js, you should require the module first:
 ```JavaScript
-sha512 = require('js-sha512');
+var sha512 = require('js-sha512');
 ```
 or 
 ```JavaScript
-sha512 = require('js-sha512').sha512;
+var sha512 = require('js-sha512').sha512;
-sha384 = require('js-sha512').sha384;
+var sha384 = require('js-sha512').sha384;
-sha512_256 = require('js-sha512').sha512_256;
+var sha512_256 = require('js-sha512').sha512_256;
-sha512_224 = require('js-sha512').sha512_224;
+var sha512_224 = require('js-sha512').sha512_224;
+```
+It supports AMD:
+```JavaScript
+require(['your/path/sha512.js'], function(sha512) {
+// ...
+});
 ```
 ## Example
-Code
 ```JavaScript
-sha512('');
+sha512(''); // cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e
-sha512('The quick brown fox jumps over the lazy dog');
+sha512('The quick brown fox jumps over the lazy dog'); // 07e547d9586f6a73f73fbac0435ed76951218fb7d0c8d788a309d785436bbb642e93a252a954f23912547d1e8a3b5ed6e1bfd7097821233fa0538f3db854fee6
-sha512('The quick brown fox jumps over the lazy dog.');
+sha512('The quick brown fox jumps over the lazy dog.'); // 91ea1245f20d46ae9a037a989f54f1f790f0a47607eeb8a14d12890cea77a1bbc6c7ed9cf205e67b7f2b8fd4c7dfd3a7a8617e45f3c463d481c7e586c39ac1ed
-sha384('');
+sha384(''); // 38b060a751ac96384cd9327eb1b1e36a21fdb71114be07434c0cc7bf63f6e1da274edebfe76f65fbd51ad2f14898b95b
-sha384('The quick brown fox jumps over the lazy dog');
+sha384('The quick brown fox jumps over the lazy dog'); // ca737f1014a48f4c0b6dd43cb177b0afd9e5169367544c494011e3317dbf9a509cb1e5dc1e85a941bbee3d7f2afbc9b1
-sha384('The quick brown fox jumps over the lazy dog.');
+sha384('The quick brown fox jumps over the lazy dog.'); // ed892481d8272ca6df370bf706e4d7bc1b5739fa2177aae6c50e946678718fc67a7af2819a021c2fc34e91bdb63409d7
-sha512_256('');
+sha512_256(''); // c672b8d1ef56ed28ab87c3622c5114069bdd3ad7b8f9737498d0c01ecef0967a
-sha512_256('The quick brown fox jumps over the lazy dog');
+sha512_256('The quick brown fox jumps over the lazy dog'); // dd9d67b371519c339ed8dbd25af90e976a1eeefd4ad3d889005e532fc5bef04d
-sha512_256('The quick brown fox jumps over the lazy dog.');
+sha512_256('The quick brown fox jumps over the lazy dog.'); // 1546741840f8a492b959d9b8b2344b9b0eb51b004bba35c0aebaac86d45264c3
-sha512_224('');
+sha512_224(''); // 6ed0dd02806fa89e25de060c19d3ac86cabb87d6a0ddd05c333b84f4
-sha512_224('The quick brown fox jumps over the lazy dog');
+sha512_224('The quick brown fox jumps over the lazy dog'); // 944cd2847fb54558d4775db0485a50003111c8e5daa63fe722c6aa37
-sha512_224('The quick brown fox jumps over the lazy dog.');
+sha512_224('The quick brown fox jumps over the lazy dog.'); // 6d6a9279495ec4061769752e7ff9c68b6b0b3c5a281b7917ce0572de
+
+// It also supports UTF-8 encoding
+sha512('中文'); // 8b88efc2ebbcbdad5ac2d65af05bec57bda25e71fd5fb25bbd892057a2755fbd05d8d8491cb2946febd5b0f124ffdfbaecf7e34946353c4f1b5ab29545895468
+sha384('中文'); // 93422ceb8291a69b22f02dc1114c39a287493ad525dcebc77e4019a44eaee2633a85d0f29cd298ee6799048c33a4be0c
+sha512_256('中文'); // b6dab29c16ec35ab34a5d92ff135b58de96741dda78b1009a2181cf8b45d2f72
+sha512_224('中文'); // 0f46a0ae7f226517dd66ece0ce1efa29ffb7ced05ac4566fdcaed188
 ```
-Output
 
-    cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e
-    07e547d9586f6a73f73fbac0435ed76951218fb7d0c8d788a309d785436bbb642e93a252a954f23912547d1e8a3b5ed6e1bfd7097821233fa0538f3db854fee6
-    91ea1245f20d46ae9a037a989f54f1f790f0a47607eeb8a14d12890cea77a1bbc6c7ed9cf205e67b7f2b8fd4c7dfd3a7a8617e45f3c463d481c7e586c39ac1ed
-    38b060a751ac96384cd9327eb1b1e36a21fdb71114be07434c0cc7bf63f6e1da274edebfe76f65fbd51ad2f14898b95b
-    ca737f1014a48f4c0b6dd43cb177b0afd9e5169367544c494011e3317dbf9a509cb1e5dc1e85a941bbee3d7f2afbc9b1
-    ed892481d8272ca6df370bf706e4d7bc1b5739fa2177aae6c50e946678718fc67a7af2819a021c2fc34e91bdb63409d7
-    c672b8d1ef56ed28ab87c3622c5114069bdd3ad7b8f9737498d0c01ecef0967a
-    dd9d67b371519c339ed8dbd25af90e976a1eeefd4ad3d889005e532fc5bef04d
-    1546741840f8a492b959d9b8b2344b9b0eb51b004bba35c0aebaac86d45264c3
-    6ed0dd02806fa89e25de060c19d3ac86cabb87d6a0ddd05c333b84f4
-    944cd2847fb54558d4775db0485a50003111c8e5daa63fe722c6aa37
-    6d6a9279495ec4061769752e7ff9c68b6b0b3c5a281b7917ce0572de
-
-It also supports UTF-8 encoding:
-
-Code
-```JavaScript
-sha512('中文');
-sha384('中文');
-sha512_256('中文');
-sha512_224('中文');
-```
-Output
-
-    8b88efc2ebbcbdad5ac2d65af05bec57bda25e71fd5fb25bbd892057a2755fbd05d8d8491cb2946febd5b0f124ffdfbaecf7e34946353c4f1b5ab29545895468
-    93422ceb8291a69b22f02dc1114c39a287493ad525dcebc77e4019a44eaee2633a85d0f29cd298ee6799048c33a4be0c
-    b6dab29c16ec35ab34a5d92ff135b58de96741dda78b1009a2181cf8b45d2f72
-    0f46a0ae7f226517dd66ece0ce1efa29ffb7ced05ac4566fdcaed188
-
-## Benchmark
-[UTF8](http://jsperf.com/sha-512/10)  
-[ASCII](http://jsperf.com/sha-512/9)
-
-## Extensions
-### jQuery
-If you prefer jQuery style, you can add following code to add a jQuery extension.
-
-Code
-```JavaScript
-jQuery.sha512 = sha512
-jQuery.sha384 = sha384
-jQuery.sha512_256 = sha512_256
-jQuery.sha512_224 = sha512_224
-```
-And then you could use like this:
-```JavaScript
-$.sha512('message');
-$.sha384('message');
-$.sha512_256('message');
-$.sha512_224('message');
-```
-### Prototype
-If you prefer prototype style, you can add following code to add a prototype extension.
-
-Code
-```JavaScript
-String.prototype.sha512 = function() {
-  return sha512(this);
-};
-String.prototype.sha384 = function() {
-  return sha384(this);
-};
-String.prototype.sha512_256 = function() {
-  return sha512_256(this);
-};
-String.prototype.sha512_224 = function() {
-  return sha512_224(this);
-};
-```
-And then you could use like this:
-```JavaScript
-'message'.sha512();
-'message'.sha384();
-'message'.sha512_256();
-'message'.sha512_224();
-```
 ## License
 The project is released under the [MIT license](http://www.opensource.org/licenses/MIT).
 
 ## Contact
 The project's website is located at https://github.com/emn178/js-sha512  
-Author: emn178@gmail.com
+Author: Chen, Yi-Cyuan (emn178@gmail.com)

bower.json

@@ -1,7 +1,7 @@
 {
   "name": "js-sha512",
-  "version": "0.2.2",
+  "version": "0.3.0",
-  "main": ["build/sha512.min.js"],
+  "main": ["src/sha512.js"],
   "ignore": [
     "samples",
     "tests"

package.json

@@ -1,15 +1,19 @@
 {
   "name": "js-sha512",
-  "version": "0.2.2",
+  "version": "0.3.0",
   "description": "This is a simple SHA-512, SHA-384, SHA-512/224, SHA-512/256 hash functions for JavaScript supports UTF-8 encoding.",
   "main": "src/sha512.js",
   "devDependencies": {
     "expect.js": "~0.3.1",
-    "jscoverage": "~0.5.9"
+    "jscoverage": "~0.5.9",
+    "mocha": "~2.3.4",
+    "uglifyjs": "~2.4.10"
   },
   "scripts": {
     "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/sha512.js --compress --mangle --comments --output build/sha512.min.js"
   },
   "repository": {
     "type": "git",
@@ -28,7 +32,7 @@
     "HMAC"
   ],
   "license": "MIT",
-  "author": "emn178 <emn178@gmail.com>",
+  "author": "Chen, Yi-Cyuan <emn178@gmail.com>",
   "homepage": "https://github.com/emn178/js-sha512",
   "bugs": {
     "url": "https://github.com/emn178/js-sha512/issues"

src/sha512.js

@@ -1,86 +1,91 @@
 /*
- * js-sha512 v0.2.2
+ * [js-sha512]{@link https://github.com/emn178/js-sha512}
- * https://github.com/emn178/js-sha512
  *
- * Copyright 2014-2015, emn178@gmail.com
+ * @version 0.3.0
- *
+ * @author Chen, Yi-Cyuan [emn178@gmail.com]
- * Licensed under the MIT license:
+ * @copyright Chen, Yi-Cyuan 2014-2017
- * http://www.opensource.org/licenses/MIT
+ * @license MIT
  */
-;(function(root, undefined) {
+/*jslint bitwise: true */
+(function () {
   'use strict';
 
-  var NODE_JS = typeof(module) != 'undefined';
+  var root = typeof window === 'object' ? window : {};
-  if(NODE_JS) {
+  var NODE_JS = !root.JS_SHA512_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;
+  if (NODE_JS) {
     root = global;
   }
+  var COMMON_JS = !root.JS_SHA512_NO_COMMON_JS && typeof module === 'object' && module.exports;
+  var AMD = typeof define === 'function' && define.amd;
   var HEX_CHARS = '0123456789abcdef'.split('');
   var EXTRA = [-2147483648, 8388608, 32768, 128];
   var SHIFT = [24, 16, 8, 0];
-  var K =[0x428A2F98, 0xD728AE22, 0x71374491, 0x23EF65CD,
+  var K =[
-          0xB5C0FBCF, 0xEC4D3B2F, 0xE9B5DBA5, 0x8189DBBC,
+    0x428A2F98, 0xD728AE22, 0x71374491, 0x23EF65CD,
-          0x3956C25B, 0xF348B538, 0x59F111F1, 0xB605D019,
+    0xB5C0FBCF, 0xEC4D3B2F, 0xE9B5DBA5, 0x8189DBBC,
-          0x923F82A4, 0xAF194F9B, 0xAB1C5ED5, 0xDA6D8118,
+    0x3956C25B, 0xF348B538, 0x59F111F1, 0xB605D019,
-          0xD807AA98, 0xA3030242, 0x12835B01, 0x45706FBE,
+    0x923F82A4, 0xAF194F9B, 0xAB1C5ED5, 0xDA6D8118,
-          0x243185BE, 0x4EE4B28C, 0x550C7DC3, 0xD5FFB4E2,
+    0xD807AA98, 0xA3030242, 0x12835B01, 0x45706FBE,
-          0x72BE5D74, 0xF27B896F, 0x80DEB1FE, 0x3B1696B1,
+    0x243185BE, 0x4EE4B28C, 0x550C7DC3, 0xD5FFB4E2,
-          0x9BDC06A7, 0x25C71235, 0xC19BF174, 0xCF692694,
+    0x72BE5D74, 0xF27B896F, 0x80DEB1FE, 0x3B1696B1,
-          0xE49B69C1, 0x9EF14AD2, 0xEFBE4786, 0x384F25E3,
+    0x9BDC06A7, 0x25C71235, 0xC19BF174, 0xCF692694,
-          0x0FC19DC6, 0x8B8CD5B5, 0x240CA1CC, 0x77AC9C65,
+    0xE49B69C1, 0x9EF14AD2, 0xEFBE4786, 0x384F25E3,
-          0x2DE92C6F, 0x592B0275, 0x4A7484AA, 0x6EA6E483,
+    0x0FC19DC6, 0x8B8CD5B5, 0x240CA1CC, 0x77AC9C65,
-          0x5CB0A9DC, 0xBD41FBD4, 0x76F988DA, 0x831153B5,
+    0x2DE92C6F, 0x592B0275, 0x4A7484AA, 0x6EA6E483,
-          0x983E5152, 0xEE66DFAB, 0xA831C66D, 0x2DB43210,
+    0x5CB0A9DC, 0xBD41FBD4, 0x76F988DA, 0x831153B5,
-          0xB00327C8, 0x98FB213F, 0xBF597FC7, 0xBEEF0EE4,
+    0x983E5152, 0xEE66DFAB, 0xA831C66D, 0x2DB43210,
-          0xC6E00BF3, 0x3DA88FC2, 0xD5A79147, 0x930AA725,
+    0xB00327C8, 0x98FB213F, 0xBF597FC7, 0xBEEF0EE4,
-          0x06CA6351, 0xE003826F, 0x14292967, 0x0A0E6E70,
+    0xC6E00BF3, 0x3DA88FC2, 0xD5A79147, 0x930AA725,
-          0x27B70A85, 0x46D22FFC, 0x2E1B2138, 0x5C26C926,
+    0x06CA6351, 0xE003826F, 0x14292967, 0x0A0E6E70,
-          0x4D2C6DFC, 0x5AC42AED, 0x53380D13, 0x9D95B3DF,
+    0x27B70A85, 0x46D22FFC, 0x2E1B2138, 0x5C26C926,
-          0x650A7354, 0x8BAF63DE, 0x766A0ABB, 0x3C77B2A8,
+    0x4D2C6DFC, 0x5AC42AED, 0x53380D13, 0x9D95B3DF,
-          0x81C2C92E, 0x47EDAEE6, 0x92722C85, 0x1482353B,
+    0x650A7354, 0x8BAF63DE, 0x766A0ABB, 0x3C77B2A8,
-          0xA2BFE8A1, 0x4CF10364, 0xA81A664B, 0xBC423001,
+    0x81C2C92E, 0x47EDAEE6, 0x92722C85, 0x1482353B,
-          0xC24B8B70, 0xD0F89791, 0xC76C51A3, 0x0654BE30,
+    0xA2BFE8A1, 0x4CF10364, 0xA81A664B, 0xBC423001,
-          0xD192E819, 0xD6EF5218, 0xD6990624, 0x5565A910,
+    0xC24B8B70, 0xD0F89791, 0xC76C51A3, 0x0654BE30,
-          0xF40E3585, 0x5771202A, 0x106AA070, 0x32BBD1B8,
+    0xD192E819, 0xD6EF5218, 0xD6990624, 0x5565A910,
-          0x19A4C116, 0xB8D2D0C8, 0x1E376C08, 0x5141AB53,
+    0xF40E3585, 0x5771202A, 0x106AA070, 0x32BBD1B8,
-          0x2748774C, 0xDF8EEB99, 0x34B0BCB5, 0xE19B48A8,
+    0x19A4C116, 0xB8D2D0C8, 0x1E376C08, 0x5141AB53,
-          0x391C0CB3, 0xC5C95A63, 0x4ED8AA4A, 0xE3418ACB,
+    0x2748774C, 0xDF8EEB99, 0x34B0BCB5, 0xE19B48A8,
-          0x5B9CCA4F, 0x7763E373, 0x682E6FF3, 0xD6B2B8A3,
+    0x391C0CB3, 0xC5C95A63, 0x4ED8AA4A, 0xE3418ACB,
-          0x748F82EE, 0x5DEFB2FC, 0x78A5636F, 0x43172F60,
+    0x5B9CCA4F, 0x7763E373, 0x682E6FF3, 0xD6B2B8A3,
-          0x84C87814, 0xA1F0AB72, 0x8CC70208, 0x1A6439EC,
+    0x748F82EE, 0x5DEFB2FC, 0x78A5636F, 0x43172F60,
-          0x90BEFFFA, 0x23631E28, 0xA4506CEB, 0xDE82BDE9,
+    0x84C87814, 0xA1F0AB72, 0x8CC70208, 0x1A6439EC,
-          0xBEF9A3F7, 0xB2C67915, 0xC67178F2, 0xE372532B,
+    0x90BEFFFA, 0x23631E28, 0xA4506CEB, 0xDE82BDE9,
-          0xCA273ECE, 0xEA26619C, 0xD186B8C7, 0x21C0C207,
+    0xBEF9A3F7, 0xB2C67915, 0xC67178F2, 0xE372532B,
-          0xEADA7DD6, 0xCDE0EB1E, 0xF57D4F7F, 0xEE6ED178,
+    0xCA273ECE, 0xEA26619C, 0xD186B8C7, 0x21C0C207,
-          0x06F067AA, 0x72176FBA, 0x0A637DC5, 0xA2C898A6,
+    0xEADA7DD6, 0xCDE0EB1E, 0xF57D4F7F, 0xEE6ED178,
-          0x113F9804, 0xBEF90DAE, 0x1B710B35, 0x131C471B,
+    0x06F067AA, 0x72176FBA, 0x0A637DC5, 0xA2C898A6,
-          0x28DB77F5, 0x23047D84, 0x32CAAB7B, 0x40C72493,
+    0x113F9804, 0xBEF90DAE, 0x1B710B35, 0x131C471B,
-          0x3C9EBE0A, 0x15C9BEBC, 0x431D67C4, 0x9C100D4C,
+    0x28DB77F5, 0x23047D84, 0x32CAAB7B, 0x40C72493,
-          0x4CC5D4BE, 0xCB3E42B6, 0x597F299C, 0xFC657E2A,
+    0x3C9EBE0A, 0x15C9BEBC, 0x431D67C4, 0x9C100D4C,
-          0x5FCB6FAB, 0x3AD6FAEC, 0x6C44198C, 0x4A475817];
+    0x4CC5D4BE, 0xCB3E42B6, 0x597F299C, 0xFC657E2A,
+    0x5FCB6FAB, 0x3AD6FAEC, 0x6C44198C, 0x4A475817
+  ];
 
   var blocks = [];
 
-  var sha384 = function(message) {
+  var sha384 = function (message) {
     return sha512(message, 384);
   };
 
-  var sha512_256 = function(message) {
+  var sha512_256 = function (message) {
     return sha512(message, 256);
   };
 
-  var sha512_224 = function(message) {
+  var sha512_224 = function (message) {
     return sha512(message, 224);
   };
 
-  var sha512 = function(message, bits) {
+  var sha512 = function (message, bits) {
     var h0h, h0l, h1h, h1l, h2h, h2l, h3h, h3l, 
-        h4h, h4l, h5h, h5l, h6h, h6l, h7h, h7l, block, code, end = false,
+      h4h, h4l, h5h, h5l, h6h, h6l, h7h, h7l, block, code, end = false,
-        i, j, index = 0, start = 0, bytes = 0, length = message.length,
+      i, j, index = 0, start = 0, bytes = 0, length = message.length,
-        s0h, s0l, s1h, s1l, c1, c2, c3, c4, 
+      s0h, s0l, s1h, s1l, c1, c2, c3, c4, 
-        abh, abl, dah, dal, cdh, cdl, bch, bcl,
+      abh, abl, dah, dal, cdh, cdl, bch, bcl,
-        majh, majl, t1h, t1l, t2h, t2l, chh, chl;
+      majh, majl, t1h, t1l, t2h, t2l, chh, chl;
 
-    if(bits == 384) {
+    if (bits == 384) {
       h0h = 0xCBBB9D5D;
       h0l = 0xC1059ED8;
       h1h = 0x629A292A;
@@ -97,7 +102,7 @@
       h6l = 0x64F98FA7;
       h7h = 0x47B5481D;
       h7l = 0xBEFA4FA4;
-    } else if(bits == 256) {
+    } else if (bits == 256) {
       h0h = 0x22312194;
       h0l = 0xFC2BF72C;
       h1h = 0x9F555FA3;
@@ -114,7 +119,7 @@
       h6l = 0x2C85B8AA;
       h7h = 0x0EB72DDC;
       h7l = 0x81C52CA2;
-    } else if(bits == 224) {
+    } else if (bits == 224) {
       h0h = 0x8C3D37C8;
       h0l = 0x19544DA2;
       h1h = 0x73E19966;
@@ -161,7 +166,7 @@
       blocks[21] = blocks[22] = blocks[23] = blocks[24] =
       blocks[25] = blocks[26] = blocks[27] = blocks[28] =
       blocks[29] = blocks[30] = blocks[31] = blocks[32] = 0;
-      for (i = start;index < length && i < 128; ++index) {
+      for (i = start; index < length && i < 128; ++index) {
         code = message.charCodeAt(index);
         if (code < 0x80) {
           blocks[i >> 2] |= code << SHIFT[i++ & 3];
@@ -182,17 +187,17 @@
       }
       bytes += i - start;
       start = i - 128;
-      if(index == length) {
+      if (index == length) {
         blocks[i >> 2] |= EXTRA[i & 3];
         ++index;
       }
       block = blocks[32];
-      if(index > length && i < 112) {
+      if (index > length && i < 112) {
         blocks[31] = bytes << 3;
         end = true;
       }
 
-      for(j = 32;j < 160;j += 2) {
+      for (j = 32; j < 160; j += 2) {
         t1h = blocks[j - 30];
         t1l = blocks[j - 29];
         s0h = ((t1h >>> 1) | (t1l << 31)) ^ ((t1h >>> 8) | (t1l << 24)) ^ (t1h >>> 7);
@@ -220,7 +225,7 @@
       var ah = h0h, al = h0l, bh = h1h, bl = h1l, ch = h2h, cl = h2l, dh = h3h, dl = h3l, eh = h4h, el = h4l, fh = h5h, fl = h5l, gh = h6h, gl = h6l, hh = h7h, hl = h7l;
       bch = bh & ch;
       bcl = bl & cl;
-      for(j = 0;j < 160;j += 8) {
+      for (j = 0; j < 160; j += 8) {
         s0h = ((ah >>> 28) | (al << 4)) ^ ((al >>> 2) | (ah << 30)) ^ ((al >>> 7) | (ah << 25));
         s0l = ((al >>> 28) | (ah << 4)) ^ ((ah >>> 2) | (al << 30)) ^ ((ah >>> 7) | (al << 25));
 
@@ -489,91 +494,98 @@
 
       h7h = (c4 << 16) | (c3 & 0xFFFF);
       h7l = (c2 << 16) | (c1 & 0xFFFF);
-    } while(!end);
+    } while (!end);
 
     var hex = HEX_CHARS[(h0h >> 28) & 0x0F] + HEX_CHARS[(h0h >> 24) & 0x0F] +
-              HEX_CHARS[(h0h >> 20) & 0x0F] + HEX_CHARS[(h0h >> 16) & 0x0F] +
+      HEX_CHARS[(h0h >> 20) & 0x0F] + HEX_CHARS[(h0h >> 16) & 0x0F] +
-              HEX_CHARS[(h0h >> 12) & 0x0F] + HEX_CHARS[(h0h >> 8) & 0x0F] +
+      HEX_CHARS[(h0h >> 12) & 0x0F] + HEX_CHARS[(h0h >> 8) & 0x0F] +
-              HEX_CHARS[(h0h >> 4) & 0x0F] + HEX_CHARS[h0h & 0x0F] +
+      HEX_CHARS[(h0h >> 4) & 0x0F] + HEX_CHARS[h0h & 0x0F] +
-              HEX_CHARS[(h0l >> 28) & 0x0F] + HEX_CHARS[(h0l >> 24) & 0x0F] +
+      HEX_CHARS[(h0l >> 28) & 0x0F] + HEX_CHARS[(h0l >> 24) & 0x0F] +
-              HEX_CHARS[(h0l >> 20) & 0x0F] + HEX_CHARS[(h0l >> 16) & 0x0F] +
+      HEX_CHARS[(h0l >> 20) & 0x0F] + HEX_CHARS[(h0l >> 16) & 0x0F] +
-              HEX_CHARS[(h0l >> 12) & 0x0F] + HEX_CHARS[(h0l >> 8) & 0x0F] +
+      HEX_CHARS[(h0l >> 12) & 0x0F] + HEX_CHARS[(h0l >> 8) & 0x0F] +
-              HEX_CHARS[(h0l >> 4) & 0x0F] + HEX_CHARS[h0l & 0x0F] +
+      HEX_CHARS[(h0l >> 4) & 0x0F] + HEX_CHARS[h0l & 0x0F] +
-              HEX_CHARS[(h1h >> 28) & 0x0F] + HEX_CHARS[(h1h >> 24) & 0x0F] +
+      HEX_CHARS[(h1h >> 28) & 0x0F] + HEX_CHARS[(h1h >> 24) & 0x0F] +
-              HEX_CHARS[(h1h >> 20) & 0x0F] + HEX_CHARS[(h1h >> 16) & 0x0F] +
+      HEX_CHARS[(h1h >> 20) & 0x0F] + HEX_CHARS[(h1h >> 16) & 0x0F] +
-              HEX_CHARS[(h1h >> 12) & 0x0F] + HEX_CHARS[(h1h >> 8) & 0x0F] +
+      HEX_CHARS[(h1h >> 12) & 0x0F] + HEX_CHARS[(h1h >> 8) & 0x0F] +
-              HEX_CHARS[(h1h >> 4) & 0x0F] + HEX_CHARS[h1h & 0x0F] +
+      HEX_CHARS[(h1h >> 4) & 0x0F] + HEX_CHARS[h1h & 0x0F] +
-              HEX_CHARS[(h1l >> 28) & 0x0F] + HEX_CHARS[(h1l >> 24) & 0x0F] +
+      HEX_CHARS[(h1l >> 28) & 0x0F] + HEX_CHARS[(h1l >> 24) & 0x0F] +
-              HEX_CHARS[(h1l >> 20) & 0x0F] + HEX_CHARS[(h1l >> 16) & 0x0F] +
+      HEX_CHARS[(h1l >> 20) & 0x0F] + HEX_CHARS[(h1l >> 16) & 0x0F] +
-              HEX_CHARS[(h1l >> 12) & 0x0F] + HEX_CHARS[(h1l >> 8) & 0x0F] +
+      HEX_CHARS[(h1l >> 12) & 0x0F] + HEX_CHARS[(h1l >> 8) & 0x0F] +
-              HEX_CHARS[(h1l >> 4) & 0x0F] + HEX_CHARS[h1l & 0x0F] +
+      HEX_CHARS[(h1l >> 4) & 0x0F] + HEX_CHARS[h1l & 0x0F] +
-              HEX_CHARS[(h2h >> 28) & 0x0F] + HEX_CHARS[(h2h >> 24) & 0x0F] +
+      HEX_CHARS[(h2h >> 28) & 0x0F] + HEX_CHARS[(h2h >> 24) & 0x0F] +
-              HEX_CHARS[(h2h >> 20) & 0x0F] + HEX_CHARS[(h2h >> 16) & 0x0F] +
+      HEX_CHARS[(h2h >> 20) & 0x0F] + HEX_CHARS[(h2h >> 16) & 0x0F] +
-              HEX_CHARS[(h2h >> 12) & 0x0F] + HEX_CHARS[(h2h >> 8) & 0x0F] +
+      HEX_CHARS[(h2h >> 12) & 0x0F] + HEX_CHARS[(h2h >> 8) & 0x0F] +
-              HEX_CHARS[(h2h >> 4) & 0x0F] + HEX_CHARS[h2h & 0x0F] +
+      HEX_CHARS[(h2h >> 4) & 0x0F] + HEX_CHARS[h2h & 0x0F] +
-              HEX_CHARS[(h2l >> 28) & 0x0F] + HEX_CHARS[(h2l >> 24) & 0x0F] +
+      HEX_CHARS[(h2l >> 28) & 0x0F] + HEX_CHARS[(h2l >> 24) & 0x0F] +
-              HEX_CHARS[(h2l >> 20) & 0x0F] + HEX_CHARS[(h2l >> 16) & 0x0F] +
+      HEX_CHARS[(h2l >> 20) & 0x0F] + HEX_CHARS[(h2l >> 16) & 0x0F] +
-              HEX_CHARS[(h2l >> 12) & 0x0F] + HEX_CHARS[(h2l >> 8) & 0x0F] +
+      HEX_CHARS[(h2l >> 12) & 0x0F] + HEX_CHARS[(h2l >> 8) & 0x0F] +
-              HEX_CHARS[(h2l >> 4) & 0x0F] + HEX_CHARS[h2l & 0x0F] +
+      HEX_CHARS[(h2l >> 4) & 0x0F] + HEX_CHARS[h2l & 0x0F] +
-              HEX_CHARS[(h3h >> 28) & 0x0F] + HEX_CHARS[(h3h >> 24) & 0x0F] +
+      HEX_CHARS[(h3h >> 28) & 0x0F] + HEX_CHARS[(h3h >> 24) & 0x0F] +
-              HEX_CHARS[(h3h >> 20) & 0x0F] + HEX_CHARS[(h3h >> 16) & 0x0F] +
+      HEX_CHARS[(h3h >> 20) & 0x0F] + HEX_CHARS[(h3h >> 16) & 0x0F] +
-              HEX_CHARS[(h3h >> 12) & 0x0F] + HEX_CHARS[(h3h >> 8) & 0x0F] +
+      HEX_CHARS[(h3h >> 12) & 0x0F] + HEX_CHARS[(h3h >> 8) & 0x0F] +
-              HEX_CHARS[(h3h >> 4) & 0x0F] + HEX_CHARS[h3h & 0x0F];
+      HEX_CHARS[(h3h >> 4) & 0x0F] + HEX_CHARS[h3h & 0x0F];
-    if(bits >= 256) {
+    if (bits >= 256) {
       hex += HEX_CHARS[(h3l >> 28) & 0x0F] + HEX_CHARS[(h3l >> 24) & 0x0F] +
-             HEX_CHARS[(h3l >> 20) & 0x0F] + HEX_CHARS[(h3l >> 16) & 0x0F] +
+        HEX_CHARS[(h3l >> 20) & 0x0F] + HEX_CHARS[(h3l >> 16) & 0x0F] +
-             HEX_CHARS[(h3l >> 12) & 0x0F] + HEX_CHARS[(h3l >> 8) & 0x0F] +
+        HEX_CHARS[(h3l >> 12) & 0x0F] + HEX_CHARS[(h3l >> 8) & 0x0F] +
-             HEX_CHARS[(h3l >> 4) & 0x0F] + HEX_CHARS[h3l & 0x0F];
+        HEX_CHARS[(h3l >> 4) & 0x0F] + HEX_CHARS[h3l & 0x0F];
     }
-    if(bits >= 384) {
+    if (bits >= 384) {
       hex += HEX_CHARS[(h4h >> 28) & 0x0F] + HEX_CHARS[(h4h >> 24) & 0x0F] +
-             HEX_CHARS[(h4h >> 20) & 0x0F] + HEX_CHARS[(h4h >> 16) & 0x0F] +
+        HEX_CHARS[(h4h >> 20) & 0x0F] + HEX_CHARS[(h4h >> 16) & 0x0F] +
-             HEX_CHARS[(h4h >> 12) & 0x0F] + HEX_CHARS[(h4h >> 8) & 0x0F] +
+        HEX_CHARS[(h4h >> 12) & 0x0F] + HEX_CHARS[(h4h >> 8) & 0x0F] +
-             HEX_CHARS[(h4h >> 4) & 0x0F] + HEX_CHARS[h4h & 0x0F] +
+        HEX_CHARS[(h4h >> 4) & 0x0F] + HEX_CHARS[h4h & 0x0F] +
-             HEX_CHARS[(h4l >> 28) & 0x0F] + HEX_CHARS[(h4l >> 24) & 0x0F] +
+        HEX_CHARS[(h4l >> 28) & 0x0F] + HEX_CHARS[(h4l >> 24) & 0x0F] +
-             HEX_CHARS[(h4l >> 20) & 0x0F] + HEX_CHARS[(h4l >> 16) & 0x0F] +
+        HEX_CHARS[(h4l >> 20) & 0x0F] + HEX_CHARS[(h4l >> 16) & 0x0F] +
-             HEX_CHARS[(h4l >> 12) & 0x0F] + HEX_CHARS[(h4l >> 8) & 0x0F] +
+        HEX_CHARS[(h4l >> 12) & 0x0F] + HEX_CHARS[(h4l >> 8) & 0x0F] +
-             HEX_CHARS[(h4l >> 4) & 0x0F] + HEX_CHARS[h4l & 0x0F] +
+        HEX_CHARS[(h4l >> 4) & 0x0F] + HEX_CHARS[h4l & 0x0F] +
-             HEX_CHARS[(h5h >> 28) & 0x0F] + HEX_CHARS[(h5h >> 24) & 0x0F] +
+        HEX_CHARS[(h5h >> 28) & 0x0F] + HEX_CHARS[(h5h >> 24) & 0x0F] +
-             HEX_CHARS[(h5h >> 20) & 0x0F] + HEX_CHARS[(h5h >> 16) & 0x0F] +
+        HEX_CHARS[(h5h >> 20) & 0x0F] + HEX_CHARS[(h5h >> 16) & 0x0F] +
-             HEX_CHARS[(h5h >> 12) & 0x0F] + HEX_CHARS[(h5h >> 8) & 0x0F] +
+        HEX_CHARS[(h5h >> 12) & 0x0F] + HEX_CHARS[(h5h >> 8) & 0x0F] +
-             HEX_CHARS[(h5h >> 4) & 0x0F] + HEX_CHARS[h5h & 0x0F] +
+        HEX_CHARS[(h5h >> 4) & 0x0F] + HEX_CHARS[h5h & 0x0F] +
-             HEX_CHARS[(h5l >> 28) & 0x0F] + HEX_CHARS[(h5l >> 24) & 0x0F] +
+        HEX_CHARS[(h5l >> 28) & 0x0F] + HEX_CHARS[(h5l >> 24) & 0x0F] +
-             HEX_CHARS[(h5l >> 20) & 0x0F] + HEX_CHARS[(h5l >> 16) & 0x0F] +
+        HEX_CHARS[(h5l >> 20) & 0x0F] + HEX_CHARS[(h5l >> 16) & 0x0F] +
-             HEX_CHARS[(h5l >> 12) & 0x0F] + HEX_CHARS[(h5l >> 8) & 0x0F] +
+        HEX_CHARS[(h5l >> 12) & 0x0F] + HEX_CHARS[(h5l >> 8) & 0x0F] +
-             HEX_CHARS[(h5l >> 4) & 0x0F] + HEX_CHARS[h5l & 0x0F];
+        HEX_CHARS[(h5l >> 4) & 0x0F] + HEX_CHARS[h5l & 0x0F];
     }
-    if(bits == 512) {
+    if (bits == 512) {
       hex += HEX_CHARS[(h6h >> 28) & 0x0F] + HEX_CHARS[(h6h >> 24) & 0x0F] +
-             HEX_CHARS[(h6h >> 20) & 0x0F] + HEX_CHARS[(h6h >> 16) & 0x0F] +
+        HEX_CHARS[(h6h >> 20) & 0x0F] + HEX_CHARS[(h6h >> 16) & 0x0F] +
-             HEX_CHARS[(h6h >> 12) & 0x0F] + HEX_CHARS[(h6h >> 8) & 0x0F] +
+        HEX_CHARS[(h6h >> 12) & 0x0F] + HEX_CHARS[(h6h >> 8) & 0x0F] +
-             HEX_CHARS[(h6h >> 4) & 0x0F] + HEX_CHARS[h6h & 0x0F] +
+        HEX_CHARS[(h6h >> 4) & 0x0F] + HEX_CHARS[h6h & 0x0F] +
-             HEX_CHARS[(h6l >> 28) & 0x0F] + HEX_CHARS[(h6l >> 24) & 0x0F] +
+        HEX_CHARS[(h6l >> 28) & 0x0F] + HEX_CHARS[(h6l >> 24) & 0x0F] +
-             HEX_CHARS[(h6l >> 20) & 0x0F] + HEX_CHARS[(h6l >> 16) & 0x0F] +
+        HEX_CHARS[(h6l >> 20) & 0x0F] + HEX_CHARS[(h6l >> 16) & 0x0F] +
-             HEX_CHARS[(h6l >> 12) & 0x0F] + HEX_CHARS[(h6l >> 8) & 0x0F] +
+        HEX_CHARS[(h6l >> 12) & 0x0F] + HEX_CHARS[(h6l >> 8) & 0x0F] +
-             HEX_CHARS[(h6l >> 4) & 0x0F] + HEX_CHARS[h6l & 0x0F] +
+        HEX_CHARS[(h6l >> 4) & 0x0F] + HEX_CHARS[h6l & 0x0F] +
-             HEX_CHARS[(h7h >> 28) & 0x0F] + HEX_CHARS[(h7h >> 24) & 0x0F] +
+        HEX_CHARS[(h7h >> 28) & 0x0F] + HEX_CHARS[(h7h >> 24) & 0x0F] +
-             HEX_CHARS[(h7h >> 20) & 0x0F] + HEX_CHARS[(h7h >> 16) & 0x0F] +
+        HEX_CHARS[(h7h >> 20) & 0x0F] + HEX_CHARS[(h7h >> 16) & 0x0F] +
-             HEX_CHARS[(h7h >> 12) & 0x0F] + HEX_CHARS[(h7h >> 8) & 0x0F] +
+        HEX_CHARS[(h7h >> 12) & 0x0F] + HEX_CHARS[(h7h >> 8) & 0x0F] +
-             HEX_CHARS[(h7h >> 4) & 0x0F] + HEX_CHARS[h7h & 0x0F] +
+        HEX_CHARS[(h7h >> 4) & 0x0F] + HEX_CHARS[h7h & 0x0F] +
-             HEX_CHARS[(h7l >> 28) & 0x0F] + HEX_CHARS[(h7l >> 24) & 0x0F] +
+        HEX_CHARS[(h7l >> 28) & 0x0F] + HEX_CHARS[(h7l >> 24) & 0x0F] +
-             HEX_CHARS[(h7l >> 20) & 0x0F] + HEX_CHARS[(h7l >> 16) & 0x0F] +
+        HEX_CHARS[(h7l >> 20) & 0x0F] + HEX_CHARS[(h7l >> 16) & 0x0F] +
-             HEX_CHARS[(h7l >> 12) & 0x0F] + HEX_CHARS[(h7l >> 8) & 0x0F] +
+        HEX_CHARS[(h7l >> 12) & 0x0F] + HEX_CHARS[(h7l >> 8) & 0x0F] +
-             HEX_CHARS[(h7l >> 4) & 0x0F] + HEX_CHARS[h7l & 0x0F];
+        HEX_CHARS[(h7l >> 4) & 0x0F] + HEX_CHARS[h7l & 0x0F];
     }
     return hex;
   };
 
-  if(!root.JS_SHA512_TEST && NODE_JS) {
+  var exports = sha512;
-    sha512.sha512 = sha512;
+  exports.sha512 = sha512;
-    sha512.sha384 = sha384;
+  exports.sha384 = sha384;
-    sha512.sha512_256 = sha512_256;
+  exports.sha512_256 = sha512_256;
-    sha512.sha512_224 = sha512_224;
+  exports.sha512_224 = sha512_224;
-    module.exports = sha512;
+
-  } else if(root) {
+  if (COMMON_JS) {
+    module.exports = exports;
+  } else {
     root.sha512 = sha512;
     root.sha384 = sha384;
     root.sha512_256 = sha512_256;
     root.sha512_224 = sha512_224;
+    if (AMD) {
+      define(function () {
+        return exports;
+      });
+    }
   }
-}(this));
+})();

tests/node-test.js

@@ -1,17 +1,59 @@
+// Node.js env
+expect = require('expect.js');
 sha512 = require('../src/sha512.js').sha512;
 sha384 = require('../src/sha512.js').sha384;
 sha512_256 = require('../src/sha512.js').sha512_256;
 sha512_224 = require('../src/sha512.js').sha512_224;
-expect = require('expect.js');
 require('./test.js');
 
-delete require.cache[require.resolve('../src/sha512.js')]
+delete require.cache[require.resolve('../src/sha512.js')];
-delete require.cache[require.resolve('./test.js')]
+delete require.cache[require.resolve('./test.js')];
 sha512 = null;
 sha384 = null;
 sha512_256 = null;
 sha512_224 = null;
 
-JS_SHA512_TEST = true;
+// Webpack browser env
+JS_SHA512_NO_NODE_JS = true;
+window = global;
+sha512 = require('../src/sha512.js').sha512;
+sha384 = require('../src/sha512.js').sha384;
+sha512_256 = require('../src/sha512.js').sha512_256;
+sha512_224 = require('../src/sha512.js').sha512_224;
+require('./test.js');
+
+delete require.cache[require.resolve('../src/sha512.js')];
+delete require.cache[require.resolve('./test.js')];
+sha512 = null;
+sha384 = null;
+sha512_256 = null;
+sha512_224 = null;
+
+// browser env
+JS_SHA512_NO_NODE_JS = true;
+JS_SHA512_NO_COMMON_JS = true;
+window = global;
 require('../src/sha512.js');
 require('./test.js');
+
+delete require.cache[require.resolve('../src/sha512.js')];
+delete require.cache[require.resolve('./test.js')];
+sha512 = null;
+sha384 = null;
+sha512_256 = null;
+sha512_224 = null;
+
+// browser AMD
+JS_SHA512_NO_NODE_JS = true;
+JS_SHA512_NO_COMMON_JS = true;
+window = global;
+define = function (func) {
+  sha512 = func();
+  sha384 = sha512.sha384;
+  sha512_256 = sha512.sha512_256;
+  sha512_224 = sha512.sha512_224;
+  require('./test.js');
+};
+define.amd = true;
+
+require('../src/sha512.js');

tests/test.js

@@ -1,40 +1,40 @@
-(function(sha512, sha384, sha512_256, sha512_224) {
+(function (sha512, sha384, sha512_256, sha512_224) {
-  describe('sha512', function() {
+  describe('sha512', function () {
-    describe('ascii', function() {
+    describe('ascii', function () {
-      describe('less than 128 bytes', function() {
+      describe('less than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512('')).to.be('cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e');
           expect(sha512('The quick brown fox jumps over the lazy dog')).to.be('07e547d9586f6a73f73fbac0435ed76951218fb7d0c8d788a309d785436bbb642e93a252a954f23912547d1e8a3b5ed6e1bfd7097821233fa0538f3db854fee6');
           expect(sha512('The quick brown fox jumps over the lazy dog.')).to.be('91ea1245f20d46ae9a037a989f54f1f790f0a47607eeb8a14d12890cea77a1bbc6c7ed9cf205e67b7f2b8fd4c7dfd3a7a8617e45f3c463d481c7e586c39ac1ed');
         });
       });
 
-      describe('more than 128 bytes', function() {
+      describe('more than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512('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('a8dedff31e3be9df6413ef5b4ecb93d62d3fbcb04297552eab5370e04afd45927854a4373037e81a50186e678d818c9ba824f4c850f3d0f02764af0252076979');
         });
       });
     });
 
-    describe('UTF8', function() {
+    describe('UTF8', function () {
-      describe('less than 128 bytes', function() {
+      describe('less than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512('中文')).to.be('8b88efc2ebbcbdad5ac2d65af05bec57bda25e71fd5fb25bbd892057a2755fbd05d8d8491cb2946febd5b0f124ffdfbaecf7e34946353c4f1b5ab29545895468');
           expect(sha512('aécio')).to.be('e1c6925243db76985abacaf9fa85e22697f549e67f65a36c88e4046a2260990ff9eefc3402396ea8dcbe8c592d8d5671bea612156eda38d3708d394bbd17d493');
           expect(sha512('𠜎')).to.be('f3e7ee9cdf7dbb52f7edd59ce3d49868c64f2b3aceceab060b8eaaebdf9de0dae5866d660e3319c5aad426a2176cb1703efc73eb24d1a90458ceda1b7f4e3940');
         });
       });
 
-      describe('more than 128 bytes', function() {
+      describe('more than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('6cb7f6d3381a187edadb43c7cdcfbbed4d2c213a7dce8ea08fe42b9882b64e643202b4974a6db94f94650ab9173d97c58bd59f6d19d27e01aab76d8d08855c65');
           expect(sha512('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('d24af1901aaf1458f089a6eddf784ce61c3012aee0df98bdb67ad2dc6b41a3b4051d40caac524373930ae396a2dde99a9204871b40892eea3e5f3c8d46da0c3c');
         });
       });
     });
 
-    describe('special length', function() {
+    describe('special length', function () {
-      it('should be successful', function() {
+      it('should be successful', function () {
         expect(sha512('012345678012345678012345678012345678012345678012345678012345012345678012345678012345678012345678012345678012345')).to.be('a58b6132677883b0ab565dfb4284a4441a35a0954738d90ad8c17800de5ee44f6482efd4c13e05a6e907fb830fc9d9039bd96f004e5e3e8d00802fb9448dec03');
         expect(sha512('0123456780123456780123456780123456780123456780123456780123450123456780123456780123456780123456780123456780123456')).to.be('34a93615cbf314a799857dc9c1804ed04be60b481229ea3a53e00316e62ac7924ea7e65435cbd9fc7d8e10e0e52e56bd99ac571c1c470cbf9252bdd70b3fd8a3');
         expect(sha512('123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567')).to.be('4555ce42c2e19f9a09a34b3e40f85178c22cde939ac42de4d33ca0e08e3c6a2e531a3abd9265a72cc22a19d085eb2c468c20d6cfb022d8914b53d6a2b485b7c9');
@@ -43,42 +43,42 @@
     });
   });
 
-  describe('sha384', function() {
+  describe('sha384', function () {
-    describe('ascii', function() {
+    describe('ascii', function () {
-      describe('less than 128 bytes', function() {
+      describe('less than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha384('')).to.be('38b060a751ac96384cd9327eb1b1e36a21fdb71114be07434c0cc7bf63f6e1da274edebfe76f65fbd51ad2f14898b95b');
           expect(sha384('The quick brown fox jumps over the lazy dog')).to.be('ca737f1014a48f4c0b6dd43cb177b0afd9e5169367544c494011e3317dbf9a509cb1e5dc1e85a941bbee3d7f2afbc9b1');
           expect(sha384('The quick brown fox jumps over the lazy dog.')).to.be('ed892481d8272ca6df370bf706e4d7bc1b5739fa2177aae6c50e946678718fc67a7af2819a021c2fc34e91bdb63409d7');
         });
       });
 
-      describe('more than 128 bytes', function() {
+      describe('more than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha384('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('3ab853dee5785c19346e8578d9cdb3b7258a8212c15fdf25d3055b4fbbc892a529e552788992fdae68dfa34f13f0af4e');
         });
       });
     });
 
-    describe('UTF8', function() {
+    describe('UTF8', function () {
-      describe('less than 128 bytes', function() {
+      describe('less than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha384('中文')).to.be('93422ceb8291a69b22f02dc1114c39a287493ad525dcebc77e4019a44eaee2633a85d0f29cd298ee6799048c33a4be0c');
           expect(sha384('aécio')).to.be('a2146805faafc45b0055b49386768811c803ef9fa8a85b648e114276c1bf49ef1092ec1bc2d3f7e036238a97eace2087');
           expect(sha384('𠜎')).to.be('e929475cf9b4d73e2a2366146381ac779b17499c92ddf910e028eb9f30280878a2843643ed8a539af5dffed64143b93d');
         });
       });
 
-      describe('more than 128 bytes', function() {
+      describe('more than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha384('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('143f4bb1a89e576ea05bd8433a3903352c199bf6ef35bfa30afa1505d6fcef77476d1b1824105da160a5164b7c792328');
           expect(sha384('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('432a8d25efb1a8d463acc7bbbed57365cddc72de3cc19d42e1d260b1479770ecea9dd403fead2949d4fabb36939f263a');
         });
       });
     });
 
-    describe('special length', function() {
+    describe('special length', function () {
-      it('should be successful', function() {
+      it('should be successful', function () {
         expect(sha384('012345678012345678012345678012345678012345678012345678012345012345678012345678012345678012345678012345678012345')).to.be('a0ecc55799e1db4e7b30c2e78d445ada5ea2939d47e8aab51d6ae86cdcf93d5048b2666aa25fbaede7ec59ee59f46e88');
         expect(sha384('0123456780123456780123456780123456780123456780123456780123450123456780123456780123456780123456780123456780123456')).to.be('484b51b9f03f453a08c823afea1a32434b6545fb682b0b91d94e1f4bf2812abc8a31387050a2e74909f862436b88c798');
         expect(sha384('123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567')).to.be('e4c83d6e5e18b4391a0b2e5fab84234ce9fc1071d87a9dcf38ca050ca3635781ef1d65ad4f9a835df26d186384105eac');
@@ -87,42 +87,42 @@
     });
   });
 
-  describe('sha512/256', function() {
+  describe('sha512/256', function () {
-    describe('ascii', function() {
+    describe('ascii', function () {
-      describe('less than 128 bytes', function() {
+      describe('less than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512_256('')).to.be('c672b8d1ef56ed28ab87c3622c5114069bdd3ad7b8f9737498d0c01ecef0967a');
           expect(sha512_256('The quick brown fox jumps over the lazy dog')).to.be('dd9d67b371519c339ed8dbd25af90e976a1eeefd4ad3d889005e532fc5bef04d');
           expect(sha512_256('The quick brown fox jumps over the lazy dog.')).to.be('1546741840f8a492b959d9b8b2344b9b0eb51b004bba35c0aebaac86d45264c3');
         });
       });
 
-      describe('more than 128 bytes', function() {
+      describe('more than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512_256('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('21e2e940930b23f1de6377086d07e22033c6bbf3fd9fbf4b62ec66e6c08c25be');
         });
       });
     });
 
-    describe('UTF8', function() {
+    describe('UTF8', function () {
-      describe('less than 128 bytes', function() {
+      describe('less than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512_256('中文')).to.be('b6dab29c16ec35ab34a5d92ff135b58de96741dda78b1009a2181cf8b45d2f72');
           expect(sha512_256('aécio')).to.be('122802ca08e39c2ef46f6a81379dc5683bd8aa074dfb54259f0add4d8b5504bc');
           expect(sha512_256('𠜎')).to.be('1032308151c0f4f5f8d4e0d96956352eb8ff87da98df8878d8795a858a7e7c08');
         });
       });
 
-      describe('more than 128 bytes', function() {
+      describe('more than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512_256('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('d32a41d9858e45b68402f77cf9f3c3f992c36a4bffd230f78d666c87f97eaf7e');
           expect(sha512_256('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('bd1abad59e6b8ad69bc17b6e05aa13f0cb725467fbeb45b83d3e4094332d1367');
         });
       });
     });
 
-    describe('special length', function() {
+    describe('special length', function () {
-      it('should be successful', function() {
+      it('should be successful', function () {
         expect(sha512_256('012345678012345678012345678012345678012345678012345678012345012345678012345678012345678012345678012345678012345')).to.be('b8bd1d6cae9992f8619904683d54cbed560ec3ef2a33d8bc225175ec27dc09a4');
         expect(sha512_256('0123456780123456780123456780123456780123456780123456780123450123456780123456780123456780123456780123456780123456')).to.be('4edb8bb93b959f482ce2e434585f3e164f53b00c42c4c46797445b39d225cfe3');
         expect(sha512_256('123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567')).to.be('44da7ca023996ec4b4ded88410e4acc209ca26c34dc0f26550d28503974fe2d1');
@@ -131,42 +131,42 @@
     });
   });
 
-  describe('sha512/224', function() {
+  describe('sha512/224', function () {
-    describe('ascii', function() {
+    describe('ascii', function () {
-      describe('less than 128 bytes', function() {
+      describe('less than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512_224('')).to.be('6ed0dd02806fa89e25de060c19d3ac86cabb87d6a0ddd05c333b84f4');
           expect(sha512_224('The quick brown fox jumps over the lazy dog')).to.be('944cd2847fb54558d4775db0485a50003111c8e5daa63fe722c6aa37');
           expect(sha512_224('The quick brown fox jumps over the lazy dog.')).to.be('6d6a9279495ec4061769752e7ff9c68b6b0b3c5a281b7917ce0572de');
         });
       });
 
-      describe('more than 128 bytes', function() {
+      describe('more than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512_224('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('2e962464977b198ee758d615bbc92251ad2e3c0960068e279fd21d2f');
         });
       });
     });
 
-    describe('UTF8', function() {
+    describe('UTF8', function () {
-      describe('less than 128 bytes', function() {
+      describe('less than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512_224('中文')).to.be('0f46a0ae7f226517dd66ece0ce1efa29ffb7ced05ac4566fdcaed188');
           expect(sha512_224('aécio')).to.be('562f2e4ee7f7451d20dcc6a0ac1a1e1c4a75f09baaf1cf19af3e15f4');
           expect(sha512_224('𠜎')).to.be('0533318c52b3d4ad355c2a6c7e727ae3d2efa749db480ac33560b059');
         });
       });
 
-      describe('more than 128 bytes', function() {
+      describe('more than 128 bytes', function () {
-        it('should be successful', function() {
+        it('should be successful', function () {
           expect(sha512_224('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('f67e191a5d4ee67a272ccaf6cf597f0c4d6a0c46bd631be7cadb0944');
           expect(sha512_224('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('009c3d1e3172d6df71344982eada855421592aea28acbf660ada7569');
         });
       });
     });
 
-    describe('special length', function() {
+    describe('special length', function () {
-      it('should be successful', function() {
+      it('should be successful', function () {
         expect(sha512_224('012345678012345678012345678012345678012345678012345678012345012345678012345678012345678012345678012345678012345')).to.be('36d6398ca22d885432e2fe3af53b9f83b2dc7a8e9284d65b81f7a879');
         expect(sha512_224('0123456780123456780123456780123456780123456780123456780123450123456780123456780123456780123456780123456780123456')).to.be('d930407a742d10f70747f05271181ad6c1c92f87482ce6a494cb566a');
         expect(sha512_224('123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567812345678123456781234567')).to.be('1d60954ce7bee0bf5d235fe6bfc928c0f32c0f1c4992451dbc0f4dbf');