[Pkg-javascript-commits] [node-ripemd160] 01/71: initial commit
Bastien Roucariès
rouca at moszumanska.debian.org
Thu May 4 10:25:36 UTC 2017
This is an automated email from the git hooks/post-receive script.
rouca pushed a commit to branch master
in repository node-ripemd160.
commit 83b99c1a71c5c6b09501f33ec72ff79021764a1e
Author: JP Richardson <jprichardson at gmail.com>
Date: Sun Nov 3 22:50:09 2013 -0600
initial commit
---
.gitignore | 2 +
.npmignore | 4 +
README.md | 59 +++++++++++++
lib/ripemd160.js | 231 +++++++++++++++++++++++++++++++++++++++++++++++++
test/mocha.opts | 3 +
test/ripemd160.test.js | 14 +++
6 files changed, 313 insertions(+)
diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..12ac647
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1,2 @@
+node_modules/
+.DS_Store
\ No newline at end of file
diff --git a/.npmignore b/.npmignore
new file mode 100644
index 0000000..e2473e4
--- /dev/null
+++ b/.npmignore
@@ -0,0 +1,4 @@
+.gitignore
+test/
+.DS_Store
+references/
\ No newline at end of file
diff --git a/README.md b/README.md
new file mode 100644
index 0000000..06f8109
--- /dev/null
+++ b/README.md
@@ -0,0 +1,59 @@
+ripemd160
+=========
+
+JavaScript component to compute the RIPEMD160 hash of strings or bytes.
+
+AMD/CommonJS compatible.
+
+
+Install
+-------
+
+### Node.js/Browserify
+
+ npm install --save cryptocoin-ripemd160
+
+### Component
+
+ component install cryptocoinjs/ripemd160
+
+
+### Bower
+
+ bower install cryptocoin-ripemd160
+
+
+### Script
+
+```html
+<script src="/path/to/ripemd160.js"></script>
+```
+
+
+Usage
+-----
+
+### ripemd160(input)
+
+input either an array of bytes or a string
+
+```js
+ripemd160("hello") //"108f07b8382412612c048d07d13f814118445acd"
+```
+
+
+
+Credits
+-------
+
+Most of the code from CryptoJS https://code.google.com/p/crypto-js/
+
+
+
+License
+-------
+
+(MIT License)
+
+Copyright 2013, JP Richardson <jprichardson at gmail.com>
+
diff --git a/lib/ripemd160.js b/lib/ripemd160.js
new file mode 100644
index 0000000..20e7fab
--- /dev/null
+++ b/lib/ripemd160.js
@@ -0,0 +1,231 @@
+!function(globals) {
+'use strict'
+
+var _imports = {}
+
+//*** UMD BEGIN
+if (typeof define !== 'undefined' && define.amd) { //require.js / AMD
+ define(['cryptocoin-convert-hex', 'cryptocoin-convert-strings'], function(convertHex) {
+ _imports.bytesToHex = convertHex.bytesToHex
+ return ripemd160
+ })
+} else if (typeof module !== 'undefined' && module.exports) { //CommonJS
+ try { //Node.js
+ _imports.bytesToHex = require('cryptocoin-convert-hex').bytesToHex
+ _imports.convertString = require('cryptocoin-convert-string')
+ } catch (e) { //Component
+ _imports.bytesToHex = require('convert-hex').bytesToHex
+ _imports.convertString = require('convert-string')
+ }
+ module.exports = ripemd160
+} else {
+ _imports.bytesToHex = globals.convertHex.bytesToHex
+ globals.ripemd160 = ripemd160
+}
+//*** UMD END
+
+/*
+CryptoJS v3.1.2
+code.google.com/p/crypto-js
+(c) 2009-2013 by Jeff Mott. All rights reserved.
+code.google.com/p/crypto-js/wiki/License
+*/
+/** @preserve
+(c) 2012 by Cédric Mesnil. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+ - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROF [...]
+*/
+
+// Constants table
+var zl = [
+ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
+ 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,
+ 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,
+ 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,
+ 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13];
+var zr = [
+ 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,
+ 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,
+ 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,
+ 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,
+ 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11];
+var sl = [
+ 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,
+ 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,
+ 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,
+ 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,
+ 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 ];
+var sr = [
+ 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,
+ 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,
+ 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,
+ 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,
+ 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 ];
+
+var hl = [ 0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E];
+var hr = [ 0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000];
+
+var bytesToWords = function (bytes) {
+ var words = [];
+ for (var i = 0, b = 0; i < bytes.length; i++, b += 8) {
+ words[b >>> 5] |= bytes[i] << (24 - b % 32);
+ }
+ return words;
+};
+
+var wordsToBytes = function (words) {
+ var bytes = [];
+ for (var b = 0; b < words.length * 32; b += 8) {
+ bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
+ }
+ return bytes;
+};
+
+var processBlock = function (H, M, offset) {
+
+ // Swap endian
+ for (var i = 0; i < 16; i++) {
+ var offset_i = offset + i;
+ var M_offset_i = M[offset_i];
+
+ // Swap
+ M[offset_i] = (
+ (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
+ (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
+ );
+ }
+
+ // Working variables
+ var al, bl, cl, dl, el;
+ var ar, br, cr, dr, er;
+
+ ar = al = H[0];
+ br = bl = H[1];
+ cr = cl = H[2];
+ dr = dl = H[3];
+ er = el = H[4];
+ // Computation
+ var t;
+ for (var i = 0; i < 80; i += 1) {
+ t = (al + M[offset+zl[i]])|0;
+ if (i<16){
+ t += f1(bl,cl,dl) + hl[0];
+ } else if (i<32) {
+ t += f2(bl,cl,dl) + hl[1];
+ } else if (i<48) {
+ t += f3(bl,cl,dl) + hl[2];
+ } else if (i<64) {
+ t += f4(bl,cl,dl) + hl[3];
+ } else {// if (i<80) {
+ t += f5(bl,cl,dl) + hl[4];
+ }
+ t = t|0;
+ t = rotl(t,sl[i]);
+ t = (t+el)|0;
+ al = el;
+ el = dl;
+ dl = rotl(cl, 10);
+ cl = bl;
+ bl = t;
+
+ t = (ar + M[offset+zr[i]])|0;
+ if (i<16){
+ t += f5(br,cr,dr) + hr[0];
+ } else if (i<32) {
+ t += f4(br,cr,dr) + hr[1];
+ } else if (i<48) {
+ t += f3(br,cr,dr) + hr[2];
+ } else if (i<64) {
+ t += f2(br,cr,dr) + hr[3];
+ } else {// if (i<80) {
+ t += f1(br,cr,dr) + hr[4];
+ }
+ t = t|0;
+ t = rotl(t,sr[i]) ;
+ t = (t+er)|0;
+ ar = er;
+ er = dr;
+ dr = rotl(cr, 10);
+ cr = br;
+ br = t;
+ }
+ // Intermediate hash value
+ t = (H[1] + cl + dr)|0;
+ H[1] = (H[2] + dl + er)|0;
+ H[2] = (H[3] + el + ar)|0;
+ H[3] = (H[4] + al + br)|0;
+ H[4] = (H[0] + bl + cr)|0;
+ H[0] = t;
+};
+
+function f1(x, y, z) {
+ return ((x) ^ (y) ^ (z));
+
+}
+
+function f2(x, y, z) {
+ return (((x)&(y)) | ((~x)&(z)));
+}
+
+function f3(x, y, z) {
+ return (((x) | (~(y))) ^ (z));
+}
+
+function f4(x, y, z) {
+ return (((x) & (z)) | ((y)&(~(z))));
+}
+
+function f5(x, y, z) {
+ return ((x) ^ ((y) |(~(z))));
+
+}
+
+function rotl(x,n) {
+ return (x<<n) | (x>>>(32-n));
+}
+
+function ripemd160(message, options) {
+
+ if (message.constructor === String) {
+ message = _imports.convertString.UTF8.stringToBytes(message);
+ }
+
+ var H = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0];
+ var m = bytesToWords(message);
+
+ var nBitsLeft = message.length * 8;
+ var nBitsTotal = message.length * 8;
+
+ // Add padding
+ m[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
+ m[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
+ (((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) |
+ (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00)
+ );
+
+ for (var i=0 ; i<m.length; i += 16) {
+ processBlock(H, m, i);
+ }
+
+ // Swap endian
+ for (var i = 0; i < 5; i++) {
+ // Shortcut
+ var H_i = H[i];
+
+ // Swap
+ H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |
+ (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
+ }
+
+ var digestbytes = wordsToBytes(H);
+ return options && options.asBytes ? digestbytes :
+ options && options.asString ? _imports.convertString.bytesToString(digestbytes) :
+ _imports.bytesToHex(digestbytes);
+};
+
+}(this);
\ No newline at end of file
diff --git a/test/mocha.opts b/test/mocha.opts
new file mode 100644
index 0000000..33c1005
--- /dev/null
+++ b/test/mocha.opts
@@ -0,0 +1,3 @@
+--ui bdd
+--reporter spec
+--timeout 2000
\ No newline at end of file
diff --git a/test/ripemd160.test.js b/test/ripemd160.test.js
new file mode 100644
index 0000000..b00409d
--- /dev/null
+++ b/test/ripemd160.test.js
@@ -0,0 +1,14 @@
+var ripemd160 = require('../lib/ripemd160')
+
+require('terst')
+
+describe('+ ripemd160(input)', function() {
+ describe('> when input is a string', function() {
+ it('should compute the ripemd160 hash', function() {
+ var input = "hello"
+ EQ (ripemd160(input), "108f07b8382412612c048d07d13f814118445acd")
+ })
+ })
+})
+
+
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-javascript/node-ripemd160.git
More information about the Pkg-javascript-commits
mailing list