corrade-nucleus-nucleons – Blame information for rev 2

Subversion Repositories:
Rev:
Rev Author Line No. Line
2 office 1 /*
2 CryptoJS v3.1.2
3 code.google.com/p/crypto-js
4 (c) 2009-2013 by Jeff Mott. All rights reserved.
5 code.google.com/p/crypto-js/wiki/License
6 */
7 /** @preserve
8 (c) 2012 by Cédric Mesnil. All rights reserved.
9  
10 Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
11  
12 - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
13 - 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.
14  
15 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 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
16 */
17  
18 (function (Math) {
19 // Shortcuts
20 var C = CryptoJS;
21 var C_lib = C.lib;
22 var WordArray = C_lib.WordArray;
23 var Hasher = C_lib.Hasher;
24 var C_algo = C.algo;
25  
26 // Constants table
27 var _zl = WordArray.create([
28 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
29 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,
30 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,
31 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,
32 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13]);
33 var _zr = WordArray.create([
34 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,
35 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,
36 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,
37 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,
38 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11]);
39 var _sl = WordArray.create([
40 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,
41 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,
42 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,
43 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,
44 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6 ]);
45 var _sr = WordArray.create([
46 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,
47 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,
48 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,
49 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,
50 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11 ]);
51  
52 var _hl = WordArray.create([ 0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E]);
53 var _hr = WordArray.create([ 0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000]);
54  
55 /**
56 * RIPEMD160 hash algorithm.
57 */
58 var RIPEMD160 = C_algo.RIPEMD160 = Hasher.extend({
59 _doReset: function () {
60 this._hash = WordArray.create([0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]);
61 },
62  
63 _doProcessBlock: function (M, offset) {
64  
65 // Swap endian
66 for (var i = 0; i < 16; i++) {
67 // Shortcuts
68 var offset_i = offset + i;
69 var M_offset_i = M[offset_i];
70  
71 // Swap
72 M[offset_i] = (
73 (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
74 (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
75 );
76 }
77 // Shortcut
78 var H = this._hash.words;
79 var hl = _hl.words;
80 var hr = _hr.words;
81 var zl = _zl.words;
82 var zr = _zr.words;
83 var sl = _sl.words;
84 var sr = _sr.words;
85  
86 // Working variables
87 var al, bl, cl, dl, el;
88 var ar, br, cr, dr, er;
89  
90 ar = al = H[0];
91 br = bl = H[1];
92 cr = cl = H[2];
93 dr = dl = H[3];
94 er = el = H[4];
95 // Computation
96 var t;
97 for (var i = 0; i < 80; i += 1) {
98 t = (al + M[offset+zl[i]])|0;
99 if (i<16){
100 t += f1(bl,cl,dl) + hl[0];
101 } else if (i<32) {
102 t += f2(bl,cl,dl) + hl[1];
103 } else if (i<48) {
104 t += f3(bl,cl,dl) + hl[2];
105 } else if (i<64) {
106 t += f4(bl,cl,dl) + hl[3];
107 } else {// if (i<80) {
108 t += f5(bl,cl,dl) + hl[4];
109 }
110 t = t|0;
111 t = rotl(t,sl[i]);
112 t = (t+el)|0;
113 al = el;
114 el = dl;
115 dl = rotl(cl, 10);
116 cl = bl;
117 bl = t;
118  
119 t = (ar + M[offset+zr[i]])|0;
120 if (i<16){
121 t += f5(br,cr,dr) + hr[0];
122 } else if (i<32) {
123 t += f4(br,cr,dr) + hr[1];
124 } else if (i<48) {
125 t += f3(br,cr,dr) + hr[2];
126 } else if (i<64) {
127 t += f2(br,cr,dr) + hr[3];
128 } else {// if (i<80) {
129 t += f1(br,cr,dr) + hr[4];
130 }
131 t = t|0;
132 t = rotl(t,sr[i]) ;
133 t = (t+er)|0;
134 ar = er;
135 er = dr;
136 dr = rotl(cr, 10);
137 cr = br;
138 br = t;
139 }
140 // Intermediate hash value
141 t = (H[1] + cl + dr)|0;
142 H[1] = (H[2] + dl + er)|0;
143 H[2] = (H[3] + el + ar)|0;
144 H[3] = (H[4] + al + br)|0;
145 H[4] = (H[0] + bl + cr)|0;
146 H[0] = t;
147 },
148  
149 _doFinalize: function () {
150 // Shortcuts
151 var data = this._data;
152 var dataWords = data.words;
153  
154 var nBitsTotal = this._nDataBytes * 8;
155 var nBitsLeft = data.sigBytes * 8;
156  
157 // Add padding
158 dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
159 dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
160 (((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) |
161 (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00)
162 );
163 data.sigBytes = (dataWords.length + 1) * 4;
164  
165 // Hash final blocks
166 this._process();
167  
168 // Shortcuts
169 var hash = this._hash;
170 var H = hash.words;
171  
172 // Swap endian
173 for (var i = 0; i < 5; i++) {
174 // Shortcut
175 var H_i = H[i];
176  
177 // Swap
178 H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |
179 (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
180 }
181  
182 // Return final computed hash
183 return hash;
184 },
185  
186 clone: function () {
187 var clone = Hasher.clone.call(this);
188 clone._hash = this._hash.clone();
189  
190 return clone;
191 }
192 });
193  
194  
195 function f1(x, y, z) {
196 return ((x) ^ (y) ^ (z));
197  
198 }
199  
200 function f2(x, y, z) {
201 return (((x)&(y)) | ((~x)&(z)));
202 }
203  
204 function f3(x, y, z) {
205 return (((x) | (~(y))) ^ (z));
206 }
207  
208 function f4(x, y, z) {
209 return (((x) & (z)) | ((y)&(~(z))));
210 }
211  
212 function f5(x, y, z) {
213 return ((x) ^ ((y) |(~(z))));
214  
215 }
216  
217 function rotl(x,n) {
218 return (x<<n) | (x>>>(32-n));
219 }
220  
221  
222 /**
223 * Shortcut function to the hasher's object interface.
224 *
225 * @param {WordArray|string} message The message to hash.
226 *
227 * @return {WordArray} The hash.
228 *
229 * @static
230 *
231 * @example
232 *
233 * var hash = CryptoJS.RIPEMD160('message');
234 * var hash = CryptoJS.RIPEMD160(wordArray);
235 */
236 C.RIPEMD160 = Hasher._createHelper(RIPEMD160);
237  
238 /**
239 * Shortcut function to the HMAC's object interface.
240 *
241 * @param {WordArray|string} message The message to hash.
242 * @param {WordArray|string} key The secret key.
243 *
244 * @return {WordArray} The HMAC.
245 *
246 * @static
247 *
248 * @example
249 *
250 * var hmac = CryptoJS.HmacRIPEMD160(message, key);
251 */
252 C.HmacRIPEMD160 = Hasher._createHmacHelper(RIPEMD160);
253 }(Math));