2 // RIPEMD160Managed.cs: Implements the RIPEMD-160 hash algorithm
5 // Pieter Philippaerts (Pieter@mentalis.org)
8 // - http://www.esat.kuleuven.ac.be/~cosicart/ps/AB-9601/
10 // (C) 2003 The Mentalis.org Team (http://www.mentalis.org/)
11 // Copyright (C) 2004-2005 Novell, Inc (http://www.novell.com)
13 // Permission is hereby granted, free of charge, to any person obtaining
14 // a copy of this software and associated documentation files (the
15 // "Software"), to deal in the Software without restriction, including
16 // without limitation the rights to use, copy, modify, merge, publish,
17 // distribute, sublicense, and/or sell copies of the Software, and to
18 // permit persons to whom the Software is furnished to do so, subject to
19 // the following conditions:
21 // The above copyright notice and this permission notice shall be
22 // included in all copies or substantial portions of the Software.
24 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35 using System.Runtime.InteropServices;
37 namespace System.Security.Cryptography {
39 /// Computes the <see cref="RIPEMD160"/> hash for the input data.
42 public class RIPEMD160Managed : RIPEMD160 { // not 'sealed' according to preliminary docs; this may change though
44 /// Initializes a new instance of the <see cref="RIPEMD160Managed"/> class. This class cannot be inherited.
46 public RIPEMD160Managed() {
48 _HashValue = new uint[5];
49 _ProcessingBuffer = new byte[BLOCK_SIZE_BYTES];
53 /// Initializes an instance of <see cref="RIPEMD160Managed"/>.
55 /// <exception cref="ObjectDisposedException">The RIPEMD160Managed instance has been disposed.</exception>
56 public override void Initialize() {
57 _HashValue[0] = 0x67452301;
58 _HashValue[1] = 0xefcdab89;
59 _HashValue[2] = 0x98badcfe;
60 _HashValue[3] = 0x10325476;
61 _HashValue[4] = 0xc3d2e1f0;
63 _ProcessingBufferCount = 0;
64 Array.Clear (_X, 0, _X.Length);
65 Array.Clear (_ProcessingBuffer, 0, _ProcessingBuffer.Length);
68 /// Routes data written to the object into the <see cref="RIPEMD160"/> hash algorithm for computing the hash.
70 /// <param name="array">The array of data bytes.</param>
71 /// <param name="ibStart">The offset into the byte array from which to begin using data.</param>
72 /// <param name="cbSize">The number of bytes in the array to use as data.</param>
73 /// <exception cref="ObjectDisposedException">The <see cref="RIPEMD160Managed"/> instance has been disposed.</exception>
74 protected override void HashCore(byte[] rgb, int ibStart, int cbSize) {
78 _Length += (uint)cbSize; // global length
80 if (_ProcessingBufferCount != 0) {
81 if (cbSize < (BLOCK_SIZE_BYTES - _ProcessingBufferCount)) {
82 System.Buffer.BlockCopy (rgb, ibStart, _ProcessingBuffer, _ProcessingBufferCount, cbSize);
83 _ProcessingBufferCount += cbSize;
86 i = (BLOCK_SIZE_BYTES - _ProcessingBufferCount);
87 System.Buffer.BlockCopy (rgb, ibStart, _ProcessingBuffer, _ProcessingBufferCount, i);
88 ProcessBlock (_ProcessingBuffer, 0);
89 _ProcessingBufferCount = 0;
95 for (i = 0; i < cbSize - cbSize % BLOCK_SIZE_BYTES; i += BLOCK_SIZE_BYTES) {
96 ProcessBlock (rgb, ibStart + i);
99 if (cbSize % BLOCK_SIZE_BYTES != 0) {
100 System.Buffer.BlockCopy (rgb, cbSize - cbSize % BLOCK_SIZE_BYTES + ibStart, _ProcessingBuffer, 0, cbSize % BLOCK_SIZE_BYTES);
101 _ProcessingBufferCount = cbSize % BLOCK_SIZE_BYTES;
105 /// Returns the computed <see cref="RIPEMD160"/> hash as an array of bytes after all data has been written to the object.
107 /// <returns>The computed hash value.</returns>
108 /// <exception cref="ObjectDisposedException">The <see cref="RIPEMD160Managed"/> instance has been disposed.</exception>
109 protected override byte[] HashFinal() {
110 CompressFinal(_Length);
111 byte[] hash = new byte[20];
112 if (!BitConverter.IsLittleEndian) {
113 for (int i = 0; i < 5; i++) {
114 for (int j = 0; j < 4; j++) {
115 hash [i*4+j] = (byte)(_HashValue [i] >> j*8);
119 Buffer.BlockCopy (_HashValue, 0, hash, 0, 20);
125 /// Processes one block of data.
127 /// <param name="buffer">The buffer with the data.</param>
128 /// <param name="offset">The offset in the buffer.</param>
129 private void ProcessBlock (byte[] buffer, int offset)
131 if (!BitConverter.IsLittleEndian) {
132 for (int i=0; i < _X.Length; i++) {
133 _X [i] = (uint)(buffer [offset])
134 | (((uint)(buffer [offset+1])) << 8)
135 | (((uint)(buffer [offset+2])) << 16)
136 | (((uint)(buffer [offset+3])) << 24);
140 Buffer.BlockCopy (buffer, offset, _X, 0, 64);
145 private void Compress() {
146 uint aa = _HashValue[0], bb = _HashValue[1], cc = _HashValue[2], dd = _HashValue[3], ee = _HashValue[4];
147 uint aaa = _HashValue[0], bbb = _HashValue[1], ccc = _HashValue[2], ddd = _HashValue[3], eee = _HashValue[4];
149 FF(ref aa, bb, ref cc, dd, ee, _X[ 0], 11);
150 FF(ref ee, aa, ref bb, cc, dd, _X[ 1], 14);
151 FF(ref dd, ee, ref aa, bb, cc, _X[ 2], 15);
152 FF(ref cc, dd, ref ee, aa, bb, _X[ 3], 12);
153 FF(ref bb, cc, ref dd, ee, aa, _X[ 4], 5);
154 FF(ref aa, bb, ref cc, dd, ee, _X[ 5], 8);
155 FF(ref ee, aa, ref bb, cc, dd, _X[ 6], 7);
156 FF(ref dd, ee, ref aa, bb, cc, _X[ 7], 9);
157 FF(ref cc, dd, ref ee, aa, bb, _X[ 8], 11);
158 FF(ref bb, cc, ref dd, ee, aa, _X[ 9], 13);
159 FF(ref aa, bb, ref cc, dd, ee, _X[10], 14);
160 FF(ref ee, aa, ref bb, cc, dd, _X[11], 15);
161 FF(ref dd, ee, ref aa, bb, cc, _X[12], 6);
162 FF(ref cc, dd, ref ee, aa, bb, _X[13], 7);
163 FF(ref bb, cc, ref dd, ee, aa, _X[14], 9);
164 FF(ref aa, bb, ref cc, dd, ee, _X[15], 8);
166 GG(ref ee, aa, ref bb, cc, dd, _X[ 7], 7);
167 GG(ref dd, ee, ref aa, bb, cc, _X[ 4], 6);
168 GG(ref cc, dd, ref ee, aa, bb, _X[13], 8);
169 GG(ref bb, cc, ref dd, ee, aa, _X[ 1], 13);
170 GG(ref aa, bb, ref cc, dd, ee, _X[10], 11);
171 GG(ref ee, aa, ref bb, cc, dd, _X[ 6], 9);
172 GG(ref dd, ee, ref aa, bb, cc, _X[15], 7);
173 GG(ref cc, dd, ref ee, aa, bb, _X[ 3], 15);
174 GG(ref bb, cc, ref dd, ee, aa, _X[12], 7);
175 GG(ref aa, bb, ref cc, dd, ee, _X[ 0], 12);
176 GG(ref ee, aa, ref bb, cc, dd, _X[ 9], 15);
177 GG(ref dd, ee, ref aa, bb, cc, _X[ 5], 9);
178 GG(ref cc, dd, ref ee, aa, bb, _X[ 2], 11);
179 GG(ref bb, cc, ref dd, ee, aa, _X[14], 7);
180 GG(ref aa, bb, ref cc, dd, ee, _X[11], 13);
181 GG(ref ee, aa, ref bb, cc, dd, _X[ 8], 12);
183 HH(ref dd, ee, ref aa, bb, cc, _X[ 3], 11);
184 HH(ref cc, dd, ref ee, aa, bb, _X[10], 13);
185 HH(ref bb, cc, ref dd, ee, aa, _X[14], 6);
186 HH(ref aa, bb, ref cc, dd, ee, _X[ 4], 7);
187 HH(ref ee, aa, ref bb, cc, dd, _X[ 9], 14);
188 HH(ref dd, ee, ref aa, bb, cc, _X[15], 9);
189 HH(ref cc, dd, ref ee, aa, bb, _X[ 8], 13);
190 HH(ref bb, cc, ref dd, ee, aa, _X[ 1], 15);
191 HH(ref aa, bb, ref cc, dd, ee, _X[ 2], 14);
192 HH(ref ee, aa, ref bb, cc, dd, _X[ 7], 8);
193 HH(ref dd, ee, ref aa, bb, cc, _X[ 0], 13);
194 HH(ref cc, dd, ref ee, aa, bb, _X[ 6], 6);
195 HH(ref bb, cc, ref dd, ee, aa, _X[13], 5);
196 HH(ref aa, bb, ref cc, dd, ee, _X[11], 12);
197 HH(ref ee, aa, ref bb, cc, dd, _X[ 5], 7);
198 HH(ref dd, ee, ref aa, bb, cc, _X[12], 5);
200 II(ref cc, dd, ref ee, aa, bb, _X[ 1], 11);
201 II(ref bb, cc, ref dd, ee, aa, _X[ 9], 12);
202 II(ref aa, bb, ref cc, dd, ee, _X[11], 14);
203 II(ref ee, aa, ref bb, cc, dd, _X[10], 15);
204 II(ref dd, ee, ref aa, bb, cc, _X[ 0], 14);
205 II(ref cc, dd, ref ee, aa, bb, _X[ 8], 15);
206 II(ref bb, cc, ref dd, ee, aa, _X[12], 9);
207 II(ref aa, bb, ref cc, dd, ee, _X[ 4], 8);
208 II(ref ee, aa, ref bb, cc, dd, _X[13], 9);
209 II(ref dd, ee, ref aa, bb, cc, _X[ 3], 14);
210 II(ref cc, dd, ref ee, aa, bb, _X[ 7], 5);
211 II(ref bb, cc, ref dd, ee, aa, _X[15], 6);
212 II(ref aa, bb, ref cc, dd, ee, _X[14], 8);
213 II(ref ee, aa, ref bb, cc, dd, _X[ 5], 6);
214 II(ref dd, ee, ref aa, bb, cc, _X[ 6], 5);
215 II(ref cc, dd, ref ee, aa, bb, _X[ 2], 12);
217 JJ(ref bb, cc, ref dd, ee, aa, _X[ 4], 9);
218 JJ(ref aa, bb, ref cc, dd, ee, _X[ 0], 15);
219 JJ(ref ee, aa, ref bb, cc, dd, _X[ 5], 5);
220 JJ(ref dd, ee, ref aa, bb, cc, _X[ 9], 11);
221 JJ(ref cc, dd, ref ee, aa, bb, _X[ 7], 6);
222 JJ(ref bb, cc, ref dd, ee, aa, _X[12], 8);
223 JJ(ref aa, bb, ref cc, dd, ee, _X[ 2], 13);
224 JJ(ref ee, aa, ref bb, cc, dd, _X[10], 12);
225 JJ(ref dd, ee, ref aa, bb, cc, _X[14], 5);
226 JJ(ref cc, dd, ref ee, aa, bb, _X[ 1], 12);
227 JJ(ref bb, cc, ref dd, ee, aa, _X[ 3], 13);
228 JJ(ref aa, bb, ref cc, dd, ee, _X[ 8], 14);
229 JJ(ref ee, aa, ref bb, cc, dd, _X[11], 11);
230 JJ(ref dd, ee, ref aa, bb, cc, _X[ 6], 8);
231 JJ(ref cc, dd, ref ee, aa, bb, _X[15], 5);
232 JJ(ref bb, cc, ref dd, ee, aa, _X[13], 6);
233 /* parallel round 1 */
234 JJJ(ref aaa, bbb, ref ccc, ddd, eee, _X[ 5], 8);
235 JJJ(ref eee, aaa, ref bbb, ccc, ddd, _X[14], 9);
236 JJJ(ref ddd, eee, ref aaa, bbb, ccc, _X[ 7], 9);
237 JJJ(ref ccc, ddd, ref eee, aaa, bbb, _X[ 0], 11);
238 JJJ(ref bbb, ccc, ref ddd, eee, aaa, _X[ 9], 13);
239 JJJ(ref aaa, bbb, ref ccc, ddd, eee, _X[ 2], 15);
240 JJJ(ref eee, aaa, ref bbb, ccc, ddd, _X[11], 15);
241 JJJ(ref ddd, eee, ref aaa, bbb, ccc, _X[ 4], 5);
242 JJJ(ref ccc, ddd, ref eee, aaa, bbb, _X[13], 7);
243 JJJ(ref bbb, ccc, ref ddd, eee, aaa, _X[ 6], 7);
244 JJJ(ref aaa, bbb, ref ccc, ddd, eee, _X[15], 8);
245 JJJ(ref eee, aaa, ref bbb, ccc, ddd, _X[ 8], 11);
246 JJJ(ref ddd, eee, ref aaa, bbb, ccc, _X[ 1], 14);
247 JJJ(ref ccc, ddd, ref eee, aaa, bbb, _X[10], 14);
248 JJJ(ref bbb, ccc, ref ddd, eee, aaa, _X[ 3], 12);
249 JJJ(ref aaa, bbb, ref ccc, ddd, eee, _X[12], 6);
250 /* parallel round 2 */
251 III(ref eee, aaa, ref bbb, ccc, ddd, _X[ 6], 9);
252 III(ref ddd, eee, ref aaa, bbb, ccc, _X[11], 13);
253 III(ref ccc, ddd, ref eee, aaa, bbb, _X[ 3], 15);
254 III(ref bbb, ccc, ref ddd, eee, aaa, _X[ 7], 7);
255 III(ref aaa, bbb, ref ccc, ddd, eee, _X[ 0], 12);
256 III(ref eee, aaa, ref bbb, ccc, ddd, _X[13], 8);
257 III(ref ddd, eee, ref aaa, bbb, ccc, _X[ 5], 9);
258 III(ref ccc, ddd, ref eee, aaa, bbb, _X[10], 11);
259 III(ref bbb, ccc, ref ddd, eee, aaa, _X[14], 7);
260 III(ref aaa, bbb, ref ccc, ddd, eee, _X[15], 7);
261 III(ref eee, aaa, ref bbb, ccc, ddd, _X[ 8], 12);
262 III(ref ddd, eee, ref aaa, bbb, ccc, _X[12], 7);
263 III(ref ccc, ddd, ref eee, aaa, bbb, _X[ 4], 6);
264 III(ref bbb, ccc, ref ddd, eee, aaa, _X[ 9], 15);
265 III(ref aaa, bbb, ref ccc, ddd, eee, _X[ 1], 13);
266 III(ref eee, aaa, ref bbb, ccc, ddd, _X[ 2], 11);
267 /* parallel round 3 */
268 HHH(ref ddd, eee, ref aaa, bbb, ccc, _X[15], 9);
269 HHH(ref ccc, ddd, ref eee, aaa, bbb, _X[ 5], 7);
270 HHH(ref bbb, ccc, ref ddd, eee, aaa, _X[ 1], 15);
271 HHH(ref aaa, bbb, ref ccc, ddd, eee, _X[ 3], 11);
272 HHH(ref eee, aaa, ref bbb, ccc, ddd, _X[ 7], 8);
273 HHH(ref ddd, eee, ref aaa, bbb, ccc, _X[14], 6);
274 HHH(ref ccc, ddd, ref eee, aaa, bbb, _X[ 6], 6);
275 HHH(ref bbb, ccc, ref ddd, eee, aaa, _X[ 9], 14);
276 HHH(ref aaa, bbb, ref ccc, ddd, eee, _X[11], 12);
277 HHH(ref eee, aaa, ref bbb, ccc, ddd, _X[ 8], 13);
278 HHH(ref ddd, eee, ref aaa, bbb, ccc, _X[12], 5);
279 HHH(ref ccc, ddd, ref eee, aaa, bbb, _X[ 2], 14);
280 HHH(ref bbb, ccc, ref ddd, eee, aaa, _X[10], 13);
281 HHH(ref aaa, bbb, ref ccc, ddd, eee, _X[ 0], 13);
282 HHH(ref eee, aaa, ref bbb, ccc, ddd, _X[ 4], 7);
283 HHH(ref ddd, eee, ref aaa, bbb, ccc, _X[13], 5);
284 /* parallel round 4 */
285 GGG(ref ccc, ddd, ref eee, aaa, bbb, _X[ 8], 15);
286 GGG(ref bbb, ccc, ref ddd, eee, aaa, _X[ 6], 5);
287 GGG(ref aaa, bbb, ref ccc, ddd, eee, _X[ 4], 8);
288 GGG(ref eee, aaa, ref bbb, ccc, ddd, _X[ 1], 11);
289 GGG(ref ddd, eee, ref aaa, bbb, ccc, _X[ 3], 14);
290 GGG(ref ccc, ddd, ref eee, aaa, bbb, _X[11], 14);
291 GGG(ref bbb, ccc, ref ddd, eee, aaa, _X[15], 6);
292 GGG(ref aaa, bbb, ref ccc, ddd, eee, _X[ 0], 14);
293 GGG(ref eee, aaa, ref bbb, ccc, ddd, _X[ 5], 6);
294 GGG(ref ddd, eee, ref aaa, bbb, ccc, _X[12], 9);
295 GGG(ref ccc, ddd, ref eee, aaa, bbb, _X[ 2], 12);
296 GGG(ref bbb, ccc, ref ddd, eee, aaa, _X[13], 9);
297 GGG(ref aaa, bbb, ref ccc, ddd, eee, _X[ 9], 12);
298 GGG(ref eee, aaa, ref bbb, ccc, ddd, _X[ 7], 5);
299 GGG(ref ddd, eee, ref aaa, bbb, ccc, _X[10], 15);
300 GGG(ref ccc, ddd, ref eee, aaa, bbb, _X[14], 8);
301 /* parallel round 5 */
302 FFF(ref bbb, ccc, ref ddd, eee, aaa, _X[12], 8);
303 FFF(ref aaa, bbb, ref ccc, ddd, eee, _X[15], 5);
304 FFF(ref eee, aaa, ref bbb, ccc, ddd, _X[10], 12);
305 FFF(ref ddd, eee, ref aaa, bbb, ccc, _X[ 4], 9);
306 FFF(ref ccc, ddd, ref eee, aaa, bbb, _X[ 1], 12);
307 FFF(ref bbb, ccc, ref ddd, eee, aaa, _X[ 5], 5);
308 FFF(ref aaa, bbb, ref ccc, ddd, eee, _X[ 8], 14);
309 FFF(ref eee, aaa, ref bbb, ccc, ddd, _X[ 7], 6);
310 FFF(ref ddd, eee, ref aaa, bbb, ccc, _X[ 6], 8);
311 FFF(ref ccc, ddd, ref eee, aaa, bbb, _X[ 2], 13);
312 FFF(ref bbb, ccc, ref ddd, eee, aaa, _X[13], 6);
313 FFF(ref aaa, bbb, ref ccc, ddd, eee, _X[14], 5);
314 FFF(ref eee, aaa, ref bbb, ccc, ddd, _X[ 0], 15);
315 FFF(ref ddd, eee, ref aaa, bbb, ccc, _X[ 3], 13);
316 FFF(ref ccc, ddd, ref eee, aaa, bbb, _X[ 9], 11);
317 FFF(ref bbb, ccc, ref ddd, eee, aaa, _X[11], 11);
318 /* combine results */
319 ddd += cc + _HashValue[1]; /* final result for _HashValue[0] */
320 _HashValue[1] = _HashValue[2] + dd + eee;
321 _HashValue[2] = _HashValue[3] + ee + aaa;
322 _HashValue[3] = _HashValue[4] + aa + bbb;
323 _HashValue[4] = _HashValue[0] + bb + ccc;
326 private void CompressFinal(ulong length) {
327 uint lswlen = (uint)(length & 0xFFFFFFFF);
328 uint mswlen = (uint)(length >> 32);
330 Array.Clear(_X, 0, _X.Length);
331 // put bytes from _ProcessingBuffer into _X
333 for (uint i = 0; i < (lswlen & 63); i++) {
334 // byte i goes into word X[i div 4] at pos. 8*(i mod 4)
335 _X[i >> 2] ^= ((uint)_ProcessingBuffer[ptr++]) << (int)(8 * (i & 3));
337 // append the bit m_n == 1
338 _X[(lswlen >> 2) & 15] ^= (uint)1 << (int)(8 * (lswlen & 3) + 7);
339 if ((lswlen & 63) > 55) {
340 // length goes to next block
342 Array.Clear(_X, 0, _X.Length);
344 // append length in bits
345 _X[14] = lswlen << 3;
346 _X[15] = (lswlen >> 29) | (mswlen << 3);
350 // the following methods should be inlined by the compiler
351 private uint ROL(uint x, int n) {
352 return (((x) << (n)) | ((x) >> (32-(n))));
354 private uint F(uint x, uint y, uint z) {
355 return ((x) ^ (y) ^ (z)) ;
357 private uint G(uint x, uint y, uint z) {
358 return (((x) & (y)) | (~(x) & (z)));
360 private uint H(uint x, uint y, uint z) {
361 return (((x) | ~(y)) ^ (z));
363 private uint I(uint x, uint y, uint z) {
364 return (((x) & (z)) | ((y) & ~(z)));
366 private uint J(uint x, uint y, uint z) {
367 return ((x) ^ ((y) | ~(z)));
369 private void FF(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
374 private void GG(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
375 a += G(b, c, d) + x + 0x5a827999;
379 private void HH(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
380 a += H(b, c, d) + x + 0x6ed9eba1;
384 private void II(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
385 a += I(b, c, d) + x + 0x8f1bbcdc;
389 private void JJ(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
390 a += J(b, c, d) + x + 0xa953fd4e;
394 private void FFF(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
399 private void GGG(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
400 a += G(b, c, d) + x + 0x7a6d76e9;
404 private void HHH(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
405 a += H(b, c, d) + x + 0x6d703ef3;
409 private void III(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
410 a += I(b, c, d) + x + 0x5c4dd124;
414 private void JJJ(ref uint a, uint b, ref uint c, uint d, uint e, uint x, int s) {
415 a += J(b, c, d) + x + 0x50a28be6;
421 /// A buffer that holds the extra data.
423 private byte[] _ProcessingBuffer;
429 /// The current value of the hash.
431 private uint[] _HashValue;
433 /// The number of bytes hashed.
435 private ulong _Length;
437 private int _ProcessingBufferCount; // Counts how much data we have stored that still needs processed.
439 private const int BLOCK_SIZE_BYTES = 64;